Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900400589.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 DLCround-PT-11b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400589
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.9K Mar 30 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 00:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 00:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 DLCround-PT-11b-UpperBounds-00
FORMULA_NAME DLCround-PT-11b-UpperBounds-01
FORMULA_NAME DLCround-PT-11b-UpperBounds-02
FORMULA_NAME DLCround-PT-11b-UpperBounds-03
FORMULA_NAME DLCround-PT-11b-UpperBounds-04
FORMULA_NAME DLCround-PT-11b-UpperBounds-05
FORMULA_NAME DLCround-PT-11b-UpperBounds-06
FORMULA_NAME DLCround-PT-11b-UpperBounds-07
FORMULA_NAME DLCround-PT-11b-UpperBounds-08
FORMULA_NAME DLCround-PT-11b-UpperBounds-09
FORMULA_NAME DLCround-PT-11b-UpperBounds-10
FORMULA_NAME DLCround-PT-11b-UpperBounds-11
FORMULA_NAME DLCround-PT-11b-UpperBounds-12
FORMULA_NAME DLCround-PT-11b-UpperBounds-13
FORMULA_NAME DLCround-PT-11b-UpperBounds-14
FORMULA_NAME DLCround-PT-11b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591255988497

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:33:11] [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-04 07:33:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:33:12] [INFO ] Load time of PNML (sax parser for PT used): 614 ms
[2020-06-04 07:33:12] [INFO ] Transformed 4375 places.
[2020-06-04 07:33:12] [INFO ] Transformed 6991 transitions.
[2020-06-04 07:33:12] [INFO ] Found NUPN structural information;
[2020-06-04 07:33:12] [INFO ] Parsed PT model containing 4375 places and 6991 transitions in 902 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 463 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 5 ms. (steps per millisecond=0 )
[2020-06-04 07:33:14] [INFO ] Flatten gal took : 847 ms
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 3 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 6991 rows 4375 cols
[2020-06-04 07:33:14] [INFO ] Computed 244 place invariants in 200 ms
Support contains 16 out of 4375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3998 edges and 4375 vertex of which 736 / 4375 are part of one of the 52 SCC in 33 ms
Free SCC test removed 684 places
Drop transitions removed 764 transitions
Reduce isomorphic transitions removed 764 transitions.
Performed 1547 Post agglomeration using F-continuation condition.Transition count delta: 1547
Iterating post reduction 0 with 2311 rules applied. Total rules applied 2312 place count 3691 transition count 4680
Reduce places removed 1547 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 1631 rules applied. Total rules applied 3943 place count 2144 transition count 4596
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 44 rules applied. Total rules applied 3987 place count 2108 transition count 4588
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3991 place count 2104 transition count 4588
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 3991 place count 2104 transition count 4580
Deduced a syphon composed of 8 places in 133 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 4007 place count 2096 transition count 4580
Symmetric choice reduction at 4 with 593 rule applications. Total rules 4600 place count 2096 transition count 4580
Deduced a syphon composed of 593 places in 150 ms
Reduce places removed 593 places and 593 transitions.
Iterating global reduction 4 with 1186 rules applied. Total rules applied 5786 place count 1503 transition count 3987
Performed 261 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 261 Pre rules applied. Total rules applied 5786 place count 1503 transition count 3726
Deduced a syphon composed of 261 places in 82 ms
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 4 with 522 rules applied. Total rules applied 6308 place count 1242 transition count 3726
Symmetric choice reduction at 4 with 91 rule applications. Total rules 6399 place count 1242 transition count 3726
Deduced a syphon composed of 91 places in 74 ms
Reduce places removed 91 places and 1341 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 6581 place count 1151 transition count 2385
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 6613 place count 1151 transition count 2353
Performed 302 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 302 places in 2 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 5 with 604 rules applied. Total rules applied 7217 place count 849 transition count 2039
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 7229 place count 849 transition count 2027
Renaming transitions due to excessive name length > 1024 char.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -611
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 7331 place count 798 transition count 2638
Drop transitions removed 32 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 7366 place count 798 transition count 2603
Free-agglomeration rule applied 469 times with reduction of 215 identical transitions.
Iterating global reduction 7 with 469 rules applied. Total rules applied 7835 place count 798 transition count 1919
Reduce places removed 469 places and 0 transitions.
Drop transitions removed 1023 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 1036 transitions.
Discarding 45 places :
Also discarding 108 output transitions
Drop transitions removed 108 transitions
Graph (complete) has 789 edges and 329 vertex of which 284 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.13 ms
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1507 rules applied. Total rules applied 9342 place count 284 transition count 774
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 9379 place count 283 transition count 738
Symmetric choice reduction at 9 with 6 rule applications. Total rules 9385 place count 283 transition count 738
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 90 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 9397 place count 277 transition count 648
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 9403 place count 277 transition count 642
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 9407 place count 277 transition count 638
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Discarding 21 places :
Also discarding 0 output transitions
Graph (complete) has 609 edges and 273 vertex of which 252 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Iterating post reduction 10 with 65 rules applied. Total rules applied 9472 place count 252 transition count 578
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 9473 place count 252 transition count 591
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 9489 place count 251 transition count 576
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 9490 place count 251 transition count 576
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 12 with 53 rules applied. Total rules applied 9543 place count 251 transition count 523
Symmetric choice reduction at 12 with 6 rule applications. Total rules 9549 place count 251 transition count 523
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 90 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 9561 place count 245 transition count 433
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 9567 place count 245 transition count 427
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 9570 place count 245 transition count 424
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 43 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 32 places :
Also discarding 0 output transitions
Graph (complete) has 512 edges and 242 vertex of which 210 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Iterating post reduction 13 with 49 rules applied. Total rules applied 9619 place count 210 transition count 379
Applied a total of 9619 rules in 3140 ms. Remains 210 /4375 variables (removed 4165) and now considering 379/6991 (removed 6612) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/4375 places, 379/6991 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 )
[2020-06-04 07:33:18] [INFO ] Flow matrix only has 121 transitions (discarded 258 similar events)
// Phase 1: matrix 121 rows 210 cols
[2020-06-04 07:33:18] [INFO ] Computed 155 place invariants in 2 ms
Support contains 16 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 379/379 transitions.
Applied a total of 0 rules in 18 ms. Remains 210 /210 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/210 places, 379/379 transitions.
Starting structural reductions, iteration 0 : 210/210 places, 379/379 transitions.
Applied a total of 0 rules in 19 ms. Remains 210 /210 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2020-06-04 07:33:18] [INFO ] Flow matrix only has 121 transitions (discarded 258 similar events)
// Phase 1: matrix 121 rows 210 cols
[2020-06-04 07:33:18] [INFO ] Computed 155 place invariants in 2 ms
[2020-06-04 07:33:18] [INFO ] Implicit Places using invariants in 725 ms returned [21, 22, 37, 38, 41, 77, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 126, 127, 128, 129, 130, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203]
Discarding 115 places :
Ensure Unique test removed 185 transitions
Reduce isomorphic transitions removed 185 transitions.
Implicit Place search using SMT only with invariants took 746 ms to find 115 implicit places.
[2020-06-04 07:33:19] [INFO ] Redundant transitions in 135 ms returned [43, 46, 48, 50, 52, 54, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 93, 96, 104, 105, 107, 109, 114, 116, 120, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 180, 181, 182, 188]
Found 52 redundant transitions using SMT.
Drop transitions removed 52 transitions
Redundant transitions reduction (with SMT) removed 52 transitions :[188, 182, 181, 180, 159, 158, 157, 156, 155, 154, 153, 152, 151, 150, 149, 148, 147, 146, 145, 144, 143, 142, 141, 140, 139, 138, 137, 120, 116, 114, 109, 107, 105, 104, 96, 93, 92, 90, 88, 86, 84, 82, 80, 78, 76, 74, 54, 52, 50, 48, 46, 43]
[2020-06-04 07:33:19] [INFO ] Flow matrix only has 121 transitions (discarded 21 similar events)
// Phase 1: matrix 121 rows 95 cols
[2020-06-04 07:33:19] [INFO ] Computed 40 place invariants in 4 ms
[2020-06-04 07:33:19] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Starting structural reductions, iteration 1 : 95/210 places, 142/379 transitions.
Graph (trivial) has 42 edges and 95 vertex of which 23 / 95 are part of one of the 6 SCC in 1 ms
Free SCC test removed 17 places
Discarding 31 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Graph (complete) has 133 edges and 78 vertex of which 47 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Drop transitions removed 39 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 47 transition count 49
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 68 place count 47 transition count 46
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 44 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 43 transition count 45
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 43 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 43 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 42 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 42 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 42 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 41 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 39 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 85 place count 39 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 38 transition count 39
Applied a total of 87 rules in 37 ms. Remains 38 /95 variables (removed 57) and now considering 39/142 (removed 103) transitions.
// Phase 1: matrix 39 rows 38 cols
[2020-06-04 07:33:19] [INFO ] Computed 15 place invariants in 0 ms
[2020-06-04 07:33:19] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 39 rows 38 cols
[2020-06-04 07:33:19] [INFO ] Computed 15 place invariants in 0 ms
[2020-06-04 07:33:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-04 07:33:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 38/210 places, 39/379 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 39 rows 38 cols
[2020-06-04 07:33:19] [INFO ] Computed 15 place invariants in 0 ms
Support contains 16 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 39/39 transitions.
Starting structural reductions, iteration 0 : 38/38 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 38 cols
[2020-06-04 07:33:19] [INFO ] Computed 15 place invariants in 0 ms
[2020-06-04 07:33:19] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 39 rows 38 cols
[2020-06-04 07:33:19] [INFO ] Computed 15 place invariants in 0 ms
[2020-06-04 07:33:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-04 07:33:19] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2020-06-04 07:33:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 39 rows 38 cols
[2020-06-04 07:33:19] [INFO ] Computed 15 place invariants in 1 ms
[2020-06-04 07:33:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 39/39 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Graph (trivial) has 3 edges and 38 vertex of which 2 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 36 edges and 37 vertex of which 35 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 34 transition count 36
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 34 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 33 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 33 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 33 transition count 34
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 33 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 32 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 32 transition count 32
Applied a total of 15 rules in 5 ms. Remains 32 /38 variables (removed 6) and now considering 32/39 (removed 7) transitions.
// Phase 1: matrix 32 rows 32 cols
[2020-06-04 07:33:19] [INFO ] Computed 12 place invariants in 0 ms
[2020-06-04 07:33:19] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2020-06-04 07:33:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ DLCround-PT-11b @ 3570 seconds

FORMULA DLCround-PT-11b-UpperBounds-00 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-02 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-03 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-07 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-11b-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for UpperBounds @ DLCround-PT-11b

{
"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": "Thu Jun 4 07:33:19 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p27)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p2)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p19)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p23)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p37)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p32)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p14)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p24)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p28)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p9)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p12)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p7)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p17)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 1
},
"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": 1188
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p35)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 1782
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p6)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 3564
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p30)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 18560,
"runtime": 6.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": 89,
"conflict_clusters": 32,
"places": 38,
"places_significant": 23,
"singleton_clusters": 0,
"transitions": 39
},
"result":
{
"preliminary_value": "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ",
"value": "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 "
},
"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: 77/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1216
lola: finding significant places
lola: 38 places, 39 transitions, 23 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(p27) : MAX(p2) : MAX(p19) : MAX(p23) : MAX(p37) : MAX(p32) : MAX(p14) : MAX(p24) : MAX(p28) : MAX(p9) : MAX(p12) : MAX(p7) : MAX(p17) : MAX(p35) : MAX(p6) : MAX(p30)
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(p27)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p27)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2)
lola: processed formula length: 7
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p19)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p23)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p23)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p37)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p37)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p32)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p32)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p28)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p28)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p9)
lola: processed formula length: 7
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p12)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p7)
lola: processed formula length: 7
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p17)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p17)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p35)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p35)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p6)
lola: processed formula length: 7
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p30)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: memory consumption: 18560 KB
lola: time consumption: 6 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="DLCround-PT-11b"
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 DLCround-PT-11b, 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 r180-ebro-158987900400589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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