Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815400117.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815400117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 4.3K Apr 1 20:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 1 20:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 1 13:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 1 10:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 1 10:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 1 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 1 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 134K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of 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 1591172745742

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:25:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 08:25:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:25:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 08:25:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1449 ms
[2020-06-03 08:25:50] [INFO ] sort/places :
Response->r0,
LxM->m1,ml0,l2,m2,lm1,l3,m3,ml1,l4,lm2,m4,m5,l5,ml2,l6,lm3,m6,m7,ml3,l7,m9,m10,ml4,
CINFORMI->c2,c4,c7,c0,c1,
LxP->p1,p3,p2,p5,p4,p6,p9,pl0,pl1,
LegalResident->lm0,l12,l0,l30,l31,lc1,l1,l32,lc2,l33,lc3,l34,cg0,l35,lg0,l36,l8,l9,lm4,l38,l10,l11,l13,l16,l14,lc0,l15,l17,l18,lp0,l19,lp1,l20,l21,l22,l24,l25,l23,l28,l26,l27,l29,
LxC->c3,cl2,c5,c6,cl0,cl1,
LxR->gl1,l37,l39,l40,
GovernmentCommission->g0,g2,g4,
PublicAdminOffice->p0,p7,p8,p10,p11,
MICSystem->m0,m8,m11,
LxG->g1,gl0,g3,

[2020-06-03 08:25:50] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2020-06-03 08:25:50] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 52 ms.
[2020-06-03 08:25:50] [INFO ] Computed order based on color domains.
[2020-06-03 08:25:50] [INFO ] Unfolded HLPN to a Petri net with 1486 places and 1234 transitions in 65 ms.
[2020-06-03 08:25:50] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 11 places in 38 ms
Reduce places removed 21 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 158 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 3 ms. (steps per millisecond=0 )
[2020-06-03 08:25:51] [INFO ] Flatten gal took : 281 ms
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 1234 rows 1465 cols
[2020-06-03 08:25:51] [INFO ] Computed 332 place invariants in 152 ms
Support contains 213 out of 1465 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Discarding 133 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Graph (complete) has 2215 edges and 1465 vertex of which 1332 are kept as prefixes of interest. Removing 133 places using SCC suffix rule.22 ms
Discarding 110 places :
Implicit places reduction removed 110 places
Performed 286 Post agglomeration using F-continuation condition.Transition count delta: 286
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 1222 transition count 849
Reduce places removed 286 places and 0 transitions.
Iterating post reduction 1 with 286 rules applied. Total rules applied 683 place count 936 transition count 849
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 683 place count 936 transition count 783
Deduced a syphon composed of 66 places in 3 ms
Ensure Unique test removed 11 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 826 place count 859 transition count 783
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 848 place count 837 transition count 783
Symmetric choice reduction at 3 with 87 rule applications. Total rules 935 place count 837 transition count 783
Deduced a syphon composed of 87 places in 4 ms
Reduce places removed 87 places and 97 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 1109 place count 750 transition count 686
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 11 rules applied. Total rules applied 1120 place count 750 transition count 675
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1131 place count 739 transition count 675
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 1131 place count 739 transition count 642
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1197 place count 706 transition count 642
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1200 place count 706 transition count 642
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 33 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1206 place count 703 transition count 609
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 5 with 55 rules applied. Total rules applied 1261 place count 670 transition count 587
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1272 place count 659 transition count 587
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 1272 place count 659 transition count 565
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1316 place count 637 transition count 565
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1327 place count 637 transition count 565
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1349 place count 626 transition count 554
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 110 rules applied. Total rules applied 1459 place count 571 transition count 499
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1461 place count 570 transition count 508
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 7 with 77 rules applied. Total rules applied 1538 place count 570 transition count 431
Ensure Unique test removed 11 places
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 7 with 88 rules applied. Total rules applied 1626 place count 482 transition count 431
Applied a total of 1626 rules in 794 ms. Remains 482 /1465 variables (removed 983) and now considering 431/1234 (removed 803) transitions.
Finished structural reductions, in 1 iterations. Remains : 482/1465 places, 431/1234 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 431 rows 482 cols
[2020-06-03 08:25:52] [INFO ] Computed 104 place invariants in 18 ms
Support contains 213 out of 482 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 482/482 places, 431/431 transitions.
Applied a total of 0 rules in 50 ms. Remains 482 /482 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 482/482 places, 431/431 transitions.
Starting structural reductions, iteration 0 : 482/482 places, 431/431 transitions.
Applied a total of 0 rules in 23 ms. Remains 482 /482 variables (removed 0) and now considering 431/431 (removed 0) transitions.
// Phase 1: matrix 431 rows 482 cols
[2020-06-03 08:25:52] [INFO ] Computed 104 place invariants in 18 ms
[2020-06-03 08:25:53] [INFO ] Implicit Places using invariants in 842 ms returned [55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 88, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 247, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 426, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 848 ms to find 58 implicit places.
[2020-06-03 08:25:53] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 431 rows 424 cols
[2020-06-03 08:25:53] [INFO ] Computed 46 place invariants in 6 ms
[2020-06-03 08:25:54] [INFO ] Dead Transitions using invariants and state equation in 1040 ms returned []
Starting structural reductions, iteration 1 : 424/482 places, 431/431 transitions.
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 431
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 20 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 30 place count 414 transition count 411
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 414 transition count 411
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 20 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 60 place count 404 transition count 391
Free-agglomeration rule applied 22 times.
Iterating global reduction 0 with 22 rules applied. Total rules applied 82 place count 404 transition count 369
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 104 place count 382 transition count 369
Applied a total of 104 rules in 60 ms. Remains 382 /424 variables (removed 42) and now considering 369/431 (removed 62) transitions.
// Phase 1: matrix 369 rows 382 cols
[2020-06-03 08:25:54] [INFO ] Computed 46 place invariants in 5 ms
[2020-06-03 08:25:54] [INFO ] Implicit Places using invariants in 255 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 257 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 381/482 places, 369/431 transitions.
Applied a total of 0 rules in 12 ms. Remains 381 /381 variables (removed 0) and now considering 369/369 (removed 0) transitions.
[2020-06-03 08:25:54] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 369 rows 381 cols
[2020-06-03 08:25:54] [INFO ] Computed 45 place invariants in 4 ms
[2020-06-03 08:25:55] [INFO ] Dead Transitions using invariants and state equation in 677 ms returned []
Finished structural reductions, in 3 iterations. Remains : 381/482 places, 369/431 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 369 rows 381 cols
[2020-06-03 08:25:55] [INFO ] Computed 45 place invariants in 3 ms
Support contains 213 out of 381 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 381/381 places, 369/369 transitions.
Applied a total of 0 rules in 16 ms. Remains 381 /381 variables (removed 0) and now considering 369/369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 381/381 places, 369/369 transitions.
Starting structural reductions, iteration 0 : 381/381 places, 369/369 transitions.
Applied a total of 0 rules in 10 ms. Remains 381 /381 variables (removed 0) and now considering 369/369 (removed 0) transitions.
// Phase 1: matrix 369 rows 381 cols
[2020-06-03 08:25:55] [INFO ] Computed 45 place invariants in 3 ms
[2020-06-03 08:25:55] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 369 rows 381 cols
[2020-06-03 08:25:55] [INFO ] Computed 45 place invariants in 4 ms
[2020-06-03 08:25:56] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
[2020-06-03 08:25:56] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 369 rows 381 cols
[2020-06-03 08:25:56] [INFO ] Computed 45 place invariants in 5 ms
[2020-06-03 08:25:57] [INFO ] Dead Transitions using invariants and state equation in 809 ms returned []
Finished structural reductions, in 1 iterations. Remains : 381/381 places, 369/369 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Applied a total of 0 rules in 10 ms. Remains 381 /381 variables (removed 0) and now considering 369/369 (removed 0) transitions.
// Phase 1: matrix 369 rows 381 cols
[2020-06-03 08:25:57] [INFO ] Computed 45 place invariants in 3 ms
[2020-06-03 08:25:57] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-03 08:25:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ FamilyReunion-COL-L00010M0001C001P001G001 @ 3570 seconds

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11 2 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-03 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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-06 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-00 11 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-15 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-01 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-13 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07 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
vrfy: finished
info: timeLeft: 3566
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": "mcc2020",
"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": "Wed Jun 3 08:25:58 2020
",
"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(p168 + p169)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 44,
"markings": 45,
"produced_by": "search",
"value": 2
},
"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(p324 + p325)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 154,
"markings": 155,
"produced_by": "search",
"value": 11
},
"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(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)",
"processed_size": 58,
"rewrites": 0
},
"result":
{
"edges": 66,
"markings": 67,
"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(p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 77,
"markings": 78,
"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(p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 165,
"markings": 166,
"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(p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 77,
"markings": 78,
"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(p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32)",
"processed_size": 68,
"rewrites": 0
},
"result":
{
"edges": 198,
"markings": 199,
"produced_by": "search",
"value": 11
},
"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": 396
},
"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(p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370)",
"processed_size": 79,
"rewrites": 0
},
"result":
{
"edges": 176,
"markings": 177,
"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": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "MAX(p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54)",
"processed_size": 68,
"rewrites": 0
},
"result":
{
"edges": 220,
"markings": 221,
"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(p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 99,
"markings": 100,
"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": 594
},
"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(p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)",
"processed_size": 134,
"rewrites": 0
},
"result":
{
"edges": 11,
"markings": 12,
"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": 713
},
"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(p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 132,
"markings": 133,
"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": 891
},
"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(p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 44,
"markings": 45,
"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": 1189
},
"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(p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p77)",
"processed_size": 134,
"rewrites": 0
},
"result":
{
"edges": 11,
"markings": 12,
"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": 1783
},
"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(p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 143,
"markings": 144,
"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": 3567
},
"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(p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323)",
"processed_size": 156,
"rewrites": 0
},
"result":
{
"edges": 143,
"markings": 144,
"produced_by": "search",
"value": 11
},
"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": 20568,
"runtime": 4.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": 857,
"conflict_clusters": 335,
"places": 381,
"places_significant": 336,
"singleton_clusters": 0,
"transitions": 369
},
"result":
{
"preliminary_value": "11 11 11 11 11 11 11 11 11 11 11 2 11 11 11 11 ",
"value": "11 11 11 11 11 11 11 11 11 11 11 2 11 11 11 11 "
},
"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: 750/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12192
lola: finding significant places
lola: 381 places, 369 transitions, 336 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(p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32) : MAX(p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301) : MAX(p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) : MAX(p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202) : MAX(p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323) : MAX(p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347) : MAX(p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323) : MAX(p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191) : MAX(p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246) : MAX(p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p168 + p169) : MAX(p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) : MAX(p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p77) : MAX(p324 + p325) : MAX(p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54)
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(p168 + p169)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p168 + p169)
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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p324 + p325)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p324 + p325)
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: 155 markings, 154 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)
lola: processed formula length: 58
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: 67 markings, 66 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)
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: 78 markings, 77 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347)
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: 166 markings, 165 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)
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: 78 markings, 77 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32)
lola: processed formula length: 68
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: 199 markings, 198 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p380 + p379 + p378 + p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370)
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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54)
lola: processed formula length: 68
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: 221 markings, 220 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246)
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: 100 markings, 99 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: processed formula length: 134
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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)
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: 133 markings, 132 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167)
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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p77)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p77)
lola: processed formula length: 134
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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323)
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: 144 markings, 143 edges
lola: ========================================
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323)
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: 144 markings, 143 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 11 11 11 11 11 11 11 11 11 11 11 2 11 11 11 11
lola:
preliminary result: 11 11 11 11 11 11 11 11 11 11 11 2 11 11 11 11
lola: memory consumption: 20568 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.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="FamilyReunion-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="UpperBounds"
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 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 r170-smll-158987815400117"
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" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "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
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;