Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r181-csrt-155344534700074.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-csrt-155344534700074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.4K Mar 24 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 24 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 24 06:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 24 06:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 24 06:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 24 06:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 06:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Mar 24 06:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 24 00:18 NewModel
-rw-r--r-- 1 mcc users 3.8K Mar 24 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 24 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 132 Mar 24 06:27 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 370 Mar 24 06:27 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 24 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 24 06:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 24 06:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 24 00:18 instance
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 iscolored
-rw-r--r-- 1 mcc users 134K Mar 24 00:18 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1553468064840

info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ FamilyReunion-COL-L00010M0001C001P001G001 @ 3570 seconds

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-04 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-00 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3562
rslt: Output for UpperBounds @ FamilyReunion-COL-L00010M0001C001P001G001

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=UpperBounds.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--timelimit=3570",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 24 22:54:24 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"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": "MAX(p970 + p971)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 550,
"markings": 551,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"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": "MAX(p880 + p881)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "MAX(p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 176,
"markings": 177,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "MAX(p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 473,
"markings": 474,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "MAX(p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 473,
"markings": 474,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "MAX(p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "MAX(p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 110,
"markings": 111,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160)",
"processed_size": 178,
"rewrites": 0
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 209,
"markings": 210,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 352,
"markings": 353,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316)",
"processed_size": 178,
"rewrites": 0
},
"result":
{
"edges": 77,
"markings": 78,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 440,
"markings": 441,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 341,
"markings": 342,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 121,
"markings": 122,
"produced_by": "search",
"value": 11
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 124,
"markings": 125,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 82948,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 3799,
"conflict_clusters": 959,
"places": 1486,
"places_significant": 1133,
"singleton_clusters": 0,
"transitions": 1234
},
"result":
{
"preliminary_value": "11 11 11 11 11 11 2 2 11 11 11 11 11 11 11 2 ",
"value": "11 11 11 11 11 11 2 2 11 11 11 11 11 11 11 2 "
},
"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 High-Level net
lola: Places: 1486, Transitions: 1234
lola: @ trans SendClearanceToRel
lola: @ trans ObtainFamRelCertif
lola: @ trans Summoned
lola: @ trans PrepIncomeCertif
lola: @ trans SetUpAppoint
lola: @ trans RegisterRelativePubHealth
lola: @ trans Gate1ANDSplit
lola: @ trans SendLangChoice
lola: @ trans HousingSuitCertifObtained
lola: @ trans ChoseFamilyReunion
lola: @ trans GotoOSSAndProdDoc
lola: @ trans ObtainRelativeFinStatement
lola: @ trans ReceiveAppointReq
lola: @ trans TransmitReq
lola: @ trans ReceiveQuestion
lola: @ trans ReceiveReqDocsReq
lola: @ trans CheckRequiredDoc
lola: @ trans ArchiveReq
lola: @ trans RespReceived
lola: @ trans ReceiveRegsitration
lola: @ trans EvaluateReq
lola: @ trans Gate1XORSplit
lola: @ trans Gate1XORJoin
lola: @ trans Gate2ANDSplit
lola: @ trans ReceiveAppoint
lola: @ trans ReceiveDocsObtained
lola: @ trans ReceiveNeedChoice
lola: @ trans ReceiveLangReq
lola: @ trans DisplayLangChoice
lola: @ trans TickDocsObtained
lola: @ trans ReceiveAccessReq
lola: @ trans Gate1ANDJoin
lola: @ trans ReceiveLangChoice
lola: @ trans Gate2XORSplit
lola: @ trans ReqHousingSuitCertif
lola: @ trans ClearanceReqReceived
lola: @ trans DisplayNeedChoice
lola: @ trans BringReqtoCINFORMI
lola: @ trans ReceiveNeedReq
lola: @ trans CommunicateResp
lola: @ trans PrepFamReuClearReq
lola: @ trans CheckHousingSuitReq
lola: @ trans ReqAppointCINFORMI
lola: @ trans AppointReceived
lola: @ trans AskCINFORMI
lola: @ trans ObtainMissingDocs
lola: @ trans ObtainRelHealtCondStatement
lola: @ trans DisplayReqDocs
lola: @ trans ExplainProcedure
lola: @ trans ProvidePersonalnfo
lola: @ trans CheckSanityReq
lola: @ trans ExplainHowToObtainMissingDocs
lola: @ trans RegisterRelative
lola: @ trans GiveAppoint
lola: @ trans AppReqReceived
lola: @ trans Gate2ANDJoin
lola: @ trans SendSuitabilityCertif
lola: @ trans SummonApplicant
lola: @ trans GotIt
lola: @ trans GoToAppoint
lola: @ trans ReceiveInstructions
lola: @ trans ReserveAppoint
lola: @ trans ReserveAppCINFORMI
lola: @ trans ReceiveHousingSuitCertifReq
lola: @ trans AccessMicTerminal
lola: @ trans Gate3XORSplit
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 2720/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 47552
lola: finding significant places
lola: 1486 places, 1234 transitions, 1133 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 UpperBounds.xml
lola: MAX(p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247) : MAX(p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482) : MAX(p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495) : MAX(p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747) : MAX(p970 + p971) : MAX(p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359) : MAX(p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958) : MAX(p880 + p881) : MAX(p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160) : MAX(p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640) : MAX(p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177) : MAX(p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316) : MAX(p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651) : MAX(p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813) : MAX(p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528) : MAX(p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p970 + p971)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p970 + p971)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 551 markings, 550 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p880 + p881)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p880 + p881)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 177 markings, 176 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 474 markings, 473 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 474 markings, 473 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 121 markings, 120 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 111 markings, 110 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160)
lola: processed formula length: 178
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 210 markings, 209 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 353 markings, 352 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316)
lola: processed formula length: 178
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 78 markings, 77 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 441 markings, 440 edges
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 342 markings, 341 edges
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 122 markings, 121 edges
lola: ========================================
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 125 markings, 124 edges
lola: RESULT
lola:
SUMMARY: 11 11 11 11 11 11 2 2 11 11 11 11 11 11 11 2
lola:
preliminary result: 11 11 11 11 11 11 2 2 11 11 11 11 11 11 11 2
lola: ========================================
lola: memory consumption: 82948 KB
lola: time consumption: 8 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
rslt: finished

BK_STOP 1553468072976

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="FamilyReunion-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181-csrt-155344534700074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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