Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000503.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.4K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 100K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591159953444

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:52:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 04:52:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:52:35] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2020-06-03 04:52:35] [INFO ] Transformed 386 places.
[2020-06-03 04:52:35] [INFO ] Transformed 360 transitions.
[2020-06-03 04:52:35] [INFO ] Found NUPN structural information;
[2020-06-03 04:52:35] [INFO ] Parsed PT model containing 386 places and 360 transitions in 105 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 108 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 360 rows 386 cols
[2020-06-03 04:52:35] [INFO ] Computed 62 place invariants in 23 ms
[2020-06-03 04:52:36] [INFO ] [Real]Absence check using 33 positive place invariants in 82 ms returned sat
[2020-06-03 04:52:36] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 15 ms returned sat
[2020-06-03 04:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:52:36] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2020-06-03 04:52:36] [INFO ] Deduced a trap composed of 93 places in 239 ms
[2020-06-03 04:52:36] [INFO ] Deduced a trap composed of 20 places in 169 ms
[2020-06-03 04:52:37] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-06-03 04:52:37] [INFO ] Deduced a trap composed of 11 places in 99 ms
[2020-06-03 04:52:37] [INFO ] Deduced a trap composed of 12 places in 120 ms
[2020-06-03 04:52:37] [INFO ] Deduced a trap composed of 14 places in 99 ms
[2020-06-03 04:52:37] [INFO ] Deduced a trap composed of 13 places in 122 ms
[2020-06-03 04:52:37] [INFO ] Deduced a trap composed of 109 places in 134 ms
[2020-06-03 04:52:37] [INFO ] Deduced a trap composed of 114 places in 94 ms
[2020-06-03 04:52:38] [INFO ] Deduced a trap composed of 27 places in 133 ms
[2020-06-03 04:52:38] [INFO ] Deduced a trap composed of 104 places in 162 ms
[2020-06-03 04:52:38] [INFO ] Deduced a trap composed of 28 places in 96 ms
[2020-06-03 04:52:38] [INFO ] Deduced a trap composed of 106 places in 101 ms
[2020-06-03 04:52:38] [INFO ] Deduced a trap composed of 35 places in 92 ms
[2020-06-03 04:52:38] [INFO ] Deduced a trap composed of 103 places in 131 ms
[2020-06-03 04:52:38] [INFO ] Deduced a trap composed of 21 places in 148 ms
[2020-06-03 04:52:39] [INFO ] Deduced a trap composed of 25 places in 173 ms
[2020-06-03 04:52:39] [INFO ] Deduced a trap composed of 123 places in 166 ms
[2020-06-03 04:52:39] [INFO ] Deduced a trap composed of 104 places in 92 ms
[2020-06-03 04:52:39] [INFO ] Deduced a trap composed of 115 places in 106 ms
[2020-06-03 04:52:39] [INFO ] Deduced a trap composed of 113 places in 97 ms
[2020-06-03 04:52:39] [INFO ] Deduced a trap composed of 117 places in 93 ms
[2020-06-03 04:52:40] [INFO ] Deduced a trap composed of 110 places in 97 ms
[2020-06-03 04:52:40] [INFO ] Deduced a trap composed of 103 places in 114 ms
[2020-06-03 04:52:40] [INFO ] Deduced a trap composed of 106 places in 97 ms
[2020-06-03 04:52:40] [INFO ] Deduced a trap composed of 100 places in 139 ms
[2020-06-03 04:52:40] [INFO ] Deduced a trap composed of 98 places in 117 ms
[2020-06-03 04:52:40] [INFO ] Deduced a trap composed of 32 places in 213 ms
[2020-06-03 04:52:41] [INFO ] Deduced a trap composed of 99 places in 183 ms
[2020-06-03 04:52:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s21 s22 s26 s27 s28 s32 s34 s35 s37 s38 s52 s53 s54 s71 s82 s83 s84 s85 s86 s87 s88 s134 s135 s136 s152 s153 s154 s159 s162 s180 s182 s185 s187 s211 s221 s226 s231 s240 s241 s242 s256 s261 s265 s266 s267 s268 s269 s270 s271 s274 s275 s276 s277 s282 s283 s287 s288 s296 s297 s302 s303 s307 s308 s309 s311 s312 s313 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s337 s338 s339 s340 s343 s344 s351 s352 s358 s359 s371 s372 s373 s374 s380 s381 s382) 0)") while checking expression at index 0
[2020-06-03 04:52:41] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2020-06-03 04:52:41] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2020-06-03 04:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:52:41] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2020-06-03 04:52:41] [INFO ] Deduced a trap composed of 11 places in 153 ms
[2020-06-03 04:52:41] [INFO ] Deduced a trap composed of 18 places in 102 ms
[2020-06-03 04:52:41] [INFO ] Deduced a trap composed of 19 places in 89 ms
[2020-06-03 04:52:41] [INFO ] Deduced a trap composed of 75 places in 99 ms
[2020-06-03 04:52:42] [INFO ] Deduced a trap composed of 13 places in 102 ms
[2020-06-03 04:52:42] [INFO ] Deduced a trap composed of 12 places in 90 ms
[2020-06-03 04:52:42] [INFO ] Deduced a trap composed of 29 places in 47 ms
[2020-06-03 04:52:42] [INFO ] Deduced a trap composed of 32 places in 52 ms
[2020-06-03 04:52:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 894 ms
[2020-06-03 04:52:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:52:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-06-03 04:52:42] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2020-06-03 04:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:52:42] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2020-06-03 04:52:43] [INFO ] Deduced a trap composed of 11 places in 209 ms
[2020-06-03 04:52:43] [INFO ] Deduced a trap composed of 18 places in 143 ms
[2020-06-03 04:52:43] [INFO ] Deduced a trap composed of 15 places in 157 ms
[2020-06-03 04:52:43] [INFO ] Deduced a trap composed of 12 places in 111 ms
[2020-06-03 04:52:43] [INFO ] Deduced a trap composed of 29 places in 42 ms
[2020-06-03 04:52:43] [INFO ] Deduced a trap composed of 32 places in 74 ms
[2020-06-03 04:52:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 930 ms
[2020-06-03 04:52:43] [INFO ] Computed and/alt/rep : 359/1286/359 causal constraints in 42 ms.
[2020-06-03 04:52:45] [INFO ] Added : 236 causal constraints over 48 iterations in 2031 ms. Result :sat
[2020-06-03 04:52:46] [INFO ] Deduced a trap composed of 92 places in 372 ms
[2020-06-03 04:52:46] [INFO ] Deduced a trap composed of 94 places in 251 ms
[2020-06-03 04:52:46] [INFO ] Deduced a trap composed of 95 places in 244 ms
[2020-06-03 04:52:47] [INFO ] Deduced a trap composed of 91 places in 178 ms
[2020-06-03 04:52:47] [INFO ] Deduced a trap composed of 97 places in 358 ms
[2020-06-03 04:52:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s32 s37 s38 s58 s59 s62 s63 s66 s67 s71 s73 s75 s80 s82 s83 s84 s85 s86 s87 s88 s91 s92 s101 s122 s123 s124 s128 s129 s130 s134 s135 s136 s140 s141 s142 s152 s153 s154 s159 s162 s186 s191 s196 s220 s222 s226 s231 s241 s251 s256 s261 s265 s268 s269 s270 s271 s274 s275 s276 s277 s278 s279 s280 s281 s284 s285 s286 s289 s290 s291 s292 s298 s299 s300 s301 s304 s305 s311 s313 s323 s324 s325 s326 s329 s330 s333 s334 s337 s338 s343 s344 s351 s374 s383) 0)") while checking expression at index 1
[2020-06-03 04:52:47] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-06-03 04:52:47] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 43 ms returned sat
[2020-06-03 04:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:52:47] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2020-06-03 04:52:48] [INFO ] Deduced a trap composed of 8 places in 216 ms
[2020-06-03 04:52:48] [INFO ] Deduced a trap composed of 21 places in 216 ms
[2020-06-03 04:52:48] [INFO ] Deduced a trap composed of 11 places in 109 ms
[2020-06-03 04:52:49] [INFO ] Deduced a trap composed of 11 places in 724 ms
[2020-06-03 04:52:49] [INFO ] Deduced a trap composed of 13 places in 56 ms
[2020-06-03 04:52:49] [INFO ] Deduced a trap composed of 20 places in 49 ms
[2020-06-03 04:52:49] [INFO ] Deduced a trap composed of 20 places in 61 ms
[2020-06-03 04:52:49] [INFO ] Deduced a trap composed of 28 places in 59 ms
[2020-06-03 04:52:49] [INFO ] Deduced a trap composed of 35 places in 19 ms
[2020-06-03 04:52:49] [INFO ] Deduced a trap composed of 31 places in 16 ms
[2020-06-03 04:52:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1751 ms
[2020-06-03 04:52:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:52:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 264 ms returned sat
[2020-06-03 04:52:50] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 200 ms returned sat
[2020-06-03 04:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:52:50] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2020-06-03 04:52:50] [INFO ] Deduced a trap composed of 10 places in 253 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 8 places in 135 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 14 places in 72 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 15 places in 63 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 11 places in 67 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 13 places in 45 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 20 places in 63 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 28 places in 40 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 31 places in 57 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2020-06-03 04:52:51] [INFO ] Deduced a trap composed of 33 places in 17 ms
[2020-06-03 04:52:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1171 ms
[2020-06-03 04:52:51] [INFO ] Computed and/alt/rep : 359/1286/359 causal constraints in 18 ms.
[2020-06-03 04:52:53] [INFO ] Added : 248 causal constraints over 50 iterations in 1578 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 04:52:53] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned unsat
[2020-06-03 04:52:53] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2020-06-03 04:52:53] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 15 ms returned unsat
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 22700 steps, including 277 resets, run finished after 47 ms. (steps per millisecond=482 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 11 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 207 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 28 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.87 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 378 transition count 272
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 168 place count 299 transition count 272
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 168 place count 299 transition count 214
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 292 place count 233 transition count 214
Symmetric choice reduction at 2 with 43 rule applications. Total rules 335 place count 233 transition count 214
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 43 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 421 place count 190 transition count 171
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 421 place count 190 transition count 166
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 432 place count 184 transition count 166
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 534 place count 132 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 131 transition count 119
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 131 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 129 transition count 117
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 129 transition count 117
Applied a total of 545 rules in 211 ms. Remains 129 /386 variables (removed 257) and now considering 117/360 (removed 243) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/386 places, 117/360 transitions.
Finished random walk after 234051 steps, including 11525 resets, run visited all 3 properties in 413 ms. (steps per millisecond=566 )
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

--------------------
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="BusinessProcesses-PT-07"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-07, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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