Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033390200605.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Vasy2003-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390200605
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.7K Apr 12 20:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 20:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 11 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Apr 15 10:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 15 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 22:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 22:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 207K Mar 24 05:38 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 Vasy2003-PT-none-UpperBounds-00
FORMULA_NAME Vasy2003-PT-none-UpperBounds-01
FORMULA_NAME Vasy2003-PT-none-UpperBounds-02
FORMULA_NAME Vasy2003-PT-none-UpperBounds-03
FORMULA_NAME Vasy2003-PT-none-UpperBounds-04
FORMULA_NAME Vasy2003-PT-none-UpperBounds-05
FORMULA_NAME Vasy2003-PT-none-UpperBounds-06
FORMULA_NAME Vasy2003-PT-none-UpperBounds-07
FORMULA_NAME Vasy2003-PT-none-UpperBounds-08
FORMULA_NAME Vasy2003-PT-none-UpperBounds-09
FORMULA_NAME Vasy2003-PT-none-UpperBounds-10
FORMULA_NAME Vasy2003-PT-none-UpperBounds-11
FORMULA_NAME Vasy2003-PT-none-UpperBounds-12
FORMULA_NAME Vasy2003-PT-none-UpperBounds-13
FORMULA_NAME Vasy2003-PT-none-UpperBounds-14
FORMULA_NAME Vasy2003-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591234897702

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:41:40] [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 01:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:41:41] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2020-06-04 01:41:41] [INFO ] Transformed 485 places.
[2020-06-04 01:41:41] [INFO ] Transformed 776 transitions.
[2020-06-04 01:41:41] [INFO ] Found NUPN structural information;
[2020-06-04 01:41:41] [INFO ] Parsed PT model containing 485 places and 776 transitions in 262 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 55 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 6 ms. (steps per millisecond=0 )
[2020-06-04 01:41:41] [INFO ] Flatten gal took : 181 ms
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 01:41:41] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2020-06-04 01:41:41] [INFO ] Computed 66 place invariants in 35 ms
Support contains 16 out of 485 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 159 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 31 ms
Free SCC test removed 2 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1555 edges and 483 vertex of which 481 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 481 transition count 739
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 480 transition count 739
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 15 place count 480 transition count 727
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 39 place count 468 transition count 727
Symmetric choice reduction at 2 with 139 rule applications. Total rules 178 place count 468 transition count 727
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 139 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 456 place count 329 transition count 588
Ensure Unique test removed 1 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 497 place count 328 transition count 548
Symmetric choice reduction at 3 with 85 rule applications. Total rules 582 place count 328 transition count 548
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 106 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 752 place count 243 transition count 442
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 59 rules applied. Total rules applied 811 place count 243 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 812 place count 242 transition count 383
Symmetric choice reduction at 5 with 39 rule applications. Total rules 851 place count 242 transition count 383
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 67 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 929 place count 203 transition count 316
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 954 place count 203 transition count 291
Symmetric choice reduction at 6 with 3 rule applications. Total rules 957 place count 203 transition count 291
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 963 place count 200 transition count 285
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 983 place count 190 transition count 275
Discarding 40 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (complete) has 623 edges and 190 vertex of which 150 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Iterating post reduction 6 with 1 rules applied. Total rules applied 984 place count 150 transition count 265
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1004 place count 150 transition count 245
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1007 place count 150 transition count 245
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 4 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1013 place count 147 transition count 241
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1021 place count 147 transition count 233
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1023 place count 147 transition count 233
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 3 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1027 place count 145 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1033 place count 145 transition count 224
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1034 place count 145 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1035 place count 144 transition count 223
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1040 place count 144 transition count 223
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1044 place count 144 transition count 219
Applied a total of 1044 rules in 296 ms. Remains 144 /485 variables (removed 341) and now considering 219/752 (removed 533) transitions.
Finished structural reductions, in 1 iterations. Remains : 144/485 places, 219/752 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 01:41:42] [INFO ] Flow matrix only has 194 transitions (discarded 25 similar events)
// Phase 1: matrix 194 rows 144 cols
[2020-06-04 01:41:42] [INFO ] Computed 44 place invariants in 3 ms
Support contains 16 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 219/219 transitions.
Starting structural reductions, iteration 0 : 144/144 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2020-06-04 01:41:42] [INFO ] Flow matrix only has 194 transitions (discarded 25 similar events)
// Phase 1: matrix 194 rows 144 cols
[2020-06-04 01:41:42] [INFO ] Computed 44 place invariants in 2 ms
[2020-06-04 01:41:43] [INFO ] Implicit Places using invariants in 737 ms returned [42, 44, 46, 49, 50, 51, 52, 53, 54, 124]
Discarding 10 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT only with invariants took 739 ms to find 10 implicit places.
[2020-06-04 01:41:43] [INFO ] Redundant transitions in 7 ms returned []
[2020-06-04 01:41:43] [INFO ] Flow matrix only has 194 transitions (discarded 21 similar events)
// Phase 1: matrix 194 rows 134 cols
[2020-06-04 01:41:43] [INFO ] Computed 34 place invariants in 3 ms
[2020-06-04 01:41:43] [INFO ] Dead Transitions using invariants and state equation in 648 ms returned []
Starting structural reductions, iteration 1 : 134/144 places, 215/219 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 134 transition count 210
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 129 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 129 transition count 206
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 125 transition count 206
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 122 transition count 203
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 120 transition count 206
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 120 transition count 204
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 120 transition count 201
Applied a total of 33 rules in 27 ms. Remains 120 /134 variables (removed 14) and now considering 201/215 (removed 14) transitions.
[2020-06-04 01:41:43] [INFO ] Flow matrix only has 177 transitions (discarded 24 similar events)
// Phase 1: matrix 177 rows 120 cols
[2020-06-04 01:41:43] [INFO ] Computed 34 place invariants in 2 ms
[2020-06-04 01:41:44] [INFO ] Implicit Places using invariants in 652 ms returned [28, 31, 32, 37, 38, 41, 42, 102]
Discarding 8 places :
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT only with invariants took 669 ms to find 8 implicit places.
Starting structural reductions, iteration 2 : 112/144 places, 196/219 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 111 transition count 195
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 111 transition count 189
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 105 transition count 189
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 105 transition count 189
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 17 place count 104 transition count 188
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 101 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 101 transition count 175
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 101 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 100 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 100 transition count 169
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 100 transition count 166
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 46 place count 97 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 48 place count 97 transition count 171
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 60 place count 95 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 61 place count 95 transition count 161
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 67 place count 95 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Remove reverse transitions (loop back) rule discarded transition t764.t51 and 6 places that fell out of Prefix Of Interest.
Iterating global reduction 6 with 2 rules applied. Total rules applied 69 place count 88 transition count 147
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 71 place count 88 transition count 145
Applied a total of 71 rules in 49 ms. Remains 88 /112 variables (removed 24) and now considering 145/196 (removed 51) transitions.
[2020-06-04 01:41:44] [INFO ] Flow matrix only has 127 transitions (discarded 18 similar events)
// Phase 1: matrix 127 rows 88 cols
[2020-06-04 01:41:44] [INFO ] Computed 23 place invariants in 1 ms
[2020-06-04 01:41:44] [INFO ] Implicit Places using invariants in 452 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 474 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 87/144 places, 145/219 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 144
Applied a total of 2 rules in 8 ms. Remains 86 /87 variables (removed 1) and now considering 144/145 (removed 1) transitions.
[2020-06-04 01:41:44] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 86 cols
[2020-06-04 01:41:44] [INFO ] Computed 22 place invariants in 10 ms
[2020-06-04 01:41:45] [INFO ] Implicit Places using invariants in 179 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions, iteration 4 : 85/144 places, 144/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2020-06-04 01:41:45] [INFO ] Redundant transitions in 13 ms returned []
[2020-06-04 01:41:45] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 85 cols
[2020-06-04 01:41:45] [INFO ] Computed 21 place invariants in 1 ms
[2020-06-04 01:41:45] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 5 iterations. Remains : 85/144 places, 144/219 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 01:41:45] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 85 cols
[2020-06-04 01:41:45] [INFO ] Computed 21 place invariants in 1 ms
Support contains 16 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 144/144 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 144/144 transitions.
Applied a total of 0 rules in 21 ms. Remains 85 /85 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2020-06-04 01:41:45] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 85 cols
[2020-06-04 01:41:45] [INFO ] Computed 21 place invariants in 1 ms
[2020-06-04 01:41:45] [INFO ] Implicit Places using invariants in 166 ms returned []
[2020-06-04 01:41:45] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 85 cols
[2020-06-04 01:41:45] [INFO ] Computed 21 place invariants in 1 ms
[2020-06-04 01:41:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2020-06-04 01:41:46] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2020-06-04 01:41:46] [INFO ] Redundant transitions in 23 ms returned []
[2020-06-04 01:41:46] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 85 cols
[2020-06-04 01:41:46] [INFO ] Computed 21 place invariants in 14 ms
[2020-06-04 01:41:46] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 144/144 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 43 edges and 85 vertex of which 4 / 85 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Discarding 12 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Graph (complete) has 242 edges and 83 vertex of which 71 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 71 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 21 place count 71 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 67 transition count 107
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 63 transition count 103
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 39 place count 62 transition count 104
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 104
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 48 place count 62 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 62 transition count 94
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 60 transition count 92
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 60 transition count 90
Applied a total of 56 rules in 18 ms. Remains 60 /85 variables (removed 25) and now considering 90/144 (removed 54) transitions.
[2020-06-04 01:41:46] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
// Phase 1: matrix 81 rows 60 cols
[2020-06-04 01:41:46] [INFO ] Computed 15 place invariants in 1 ms
[2020-06-04 01:41:46] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-04 01:41:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ Vasy2003-PT-none @ 3570 seconds

FORMULA Vasy2003-PT-none-UpperBounds-00 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-02 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-03 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-07 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Vasy2003-PT-none-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for UpperBounds @ Vasy2003-PT-none

{
"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 01:41:46 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(p37)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 235,
"markings": 134,
"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(p77)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"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(p24)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 208,
"markings": 125,
"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(p21)",
"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(p28)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 8,
"markings": 9,
"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(p39)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 234,
"markings": 133,
"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(p62)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 204,
"markings": 121,
"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(p31)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 7,
"markings": 8,
"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(p51)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1186,
"markings": 551,
"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(p19)",
"processed_size": 8,
"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(p40)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 234,
"markings": 133,
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p70)",
"processed_size": 8,
"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(p59)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 227,
"markings": 126,
"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": 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": 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": 7,
"markings": 8,
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p49)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 2408,
"markings": 1072,
"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": 3567
},
"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(p1)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"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": 19160,
"runtime": 3.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": 548,
"conflict_clusters": 27,
"places": 85,
"places_significant": 64,
"singleton_clusters": 0,
"transitions": 144
},
"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: 229/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2720
lola: finding significant places
lola: 85 places, 144 transitions, 64 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(p37) : MAX(p77) : MAX(p24) : MAX(p21) : MAX(p28) : MAX(p39) : MAX(p62) : MAX(p31) : MAX(p51) : MAX(p19) : MAX(p40) : MAX(p70) : MAX(p59) : MAX(p30) : MAX(p49) : MAX(p1)
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(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: 134 markings, 235 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p77)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p77)
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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 254 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: 125 markings, 208 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p21)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p21)
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(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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p39)
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: 133 markings, 234 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p62)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p62)
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: 121 markings, 204 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p31)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p31)
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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p51)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p51)
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: 551 markings, 1186 edges
lola: ========================================
lola: subprocess 9 will run for 509 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 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p40)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p40)
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: 133 markings, 234 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p70)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p70)
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 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p59)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p59)
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: 126 markings, 227 edges
lola: ========================================
lola: subprocess 13 will run for 1189 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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p49)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p49)
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: 1072 markings, 2408 edges
lola: ========================================
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1)
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: 4 markings, 3 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: 19160 KB
lola: time consumption: 3 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="Vasy2003-PT-none"
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 Vasy2003-PT-none, 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 r194-csrt-159033390200605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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