Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500431.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.5K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 156K May 10 09:33 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-14-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654200732761

Running Version 202205111006
[2022-06-02 20:12:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:12:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:12:14] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2022-06-02 20:12:14] [INFO ] Transformed 624 places.
[2022-06-02 20:12:14] [INFO ] Transformed 564 transitions.
[2022-06-02 20:12:14] [INFO ] Found NUPN structural information;
[2022-06-02 20:12:14] [INFO ] Parsed PT model containing 624 places and 564 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 15) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 385111 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{12=1, 13=1}
Probabilistic random walk after 385111 steps, saw 66117 distinct states, run finished after 3002 ms. (steps per millisecond=128 ) properties seen :2
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 12 properties.
// Phase 1: matrix 556 rows 616 cols
[2022-06-02 20:12:18] [INFO ] Computed 99 place invariants in 38 ms
[2022-06-02 20:12:19] [INFO ] [Real]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-06-02 20:12:19] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 15 ms returned sat
[2022-06-02 20:12:19] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-02 20:12:19] [INFO ] [Nat]Absence check using 60 positive place invariants in 26 ms returned sat
[2022-06-02 20:12:19] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2022-06-02 20:12:21] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 6 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 760 ms
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 827 ms
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1159 ms
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 140 places in 123 ms of which 1 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 146 places in 134 ms of which 0 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 0 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 144 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 0 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 142 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 146 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 149 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 143 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 3 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 133 places in 122 ms of which 3 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 1 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 142 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 8198 ms
[2022-06-02 20:12:33] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2022-06-02 20:12:33] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2022-06-02 20:12:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-06-02 20:12:33] [INFO ] After 13406ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :8
Attempting to minimize the solution found.
Minimization took 746 ms.
[2022-06-02 20:12:34] [INFO ] After 14557ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :8
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 8 different solutions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 2552 ms.
Support contains 39 out of 616 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 610 transition count 474
Reduce places removed 81 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 92 rules applied. Total rules applied 174 place count 529 transition count 463
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 185 place count 518 transition count 463
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 185 place count 518 transition count 337
Deduced a syphon composed of 126 places in 4 ms
Ensure Unique test removed 14 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 451 place count 378 transition count 337
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 530 place count 299 transition count 258
Iterating global reduction 3 with 79 rules applied. Total rules applied 609 place count 299 transition count 258
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 609 place count 299 transition count 252
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 623 place count 291 transition count 252
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 779 place count 213 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 780 place count 213 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 782 place count 212 transition count 177
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 786 place count 212 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 787 place count 211 transition count 176
Applied a total of 787 rules in 140 ms. Remains 211 /616 variables (removed 405) and now considering 176/556 (removed 380) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/616 places, 176/556 transitions.
Incomplete random walk after 1000000 steps, including 43872 resets, run finished after 7922 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9679 resets, run finished after 3003 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5918 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 2) seen :0
Finished probabilistic random walk after 58170 steps, run visited all 2 properties in 182 ms. (steps per millisecond=319 )
Probabilistic random walk after 58170 steps, saw 12941 distinct states, run finished after 182 ms. (steps per millisecond=319 ) properties seen :2
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 35457 ms.

BK_STOP 1654200769482

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-14"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 itstools"
echo " Input is BusinessProcesses-PT-14, 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 r024-tall-165251918500431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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