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-165251918500399.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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.5K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 00:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 00:02 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 4.0K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 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 131K 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-10-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654200603794

Running Version 202205111006
[2022-06-02 20:10:05] [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:10:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:10:05] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-06-02 20:10:05] [INFO ] Transformed 518 places.
[2022-06-02 20:10:05] [INFO ] Transformed 471 transitions.
[2022-06-02 20:10:05] [INFO ] Found NUPN structural information;
[2022-06-02 20:10:05] [INFO ] Parsed PT model containing 518 places and 471 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 471 rows 518 cols
[2022-06-02 20:10:06] [INFO ] Computed 85 place invariants in 28 ms
[2022-06-02 20:10:07] [INFO ] [Real]Absence check using 48 positive place invariants in 23 ms returned sat
[2022-06-02 20:10:07] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned sat
[2022-06-02 20:10:07] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 20:10:07] [INFO ] [Nat]Absence check using 48 positive place invariants in 24 ms returned sat
[2022-06-02 20:10:07] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2022-06-02 20:10:08] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2022-06-02 20:10:08] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 7 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 9 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 2 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 113 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 0 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 113 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 5 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 0 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 115 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 115 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 1 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 113 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 4 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 115 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 121 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 0 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 2 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 119 places in 102 ms of which 0 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 114 places in 99 ms of which 0 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 1 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 113 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 1 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2022-06-02 20:10:23] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:10:23] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2022-06-02 20:10:23] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 118 places in 112 ms of which 0 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:10:25] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:10:26] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 115 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 0 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 121 places in 105 ms of which 0 ms to minimize.
[2022-06-02 20:10:31] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:10:31] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:10:31] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 1 ms to minimize.
[2022-06-02 20:10:31] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:10:32] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 0 ms to minimize.
[2022-06-02 20:10:32] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2022-06-02 20:10:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:10:32] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2509 ms.
Support contains 53 out of 518 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 516 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 516 transition count 416
Reduce places removed 54 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 64 rules applied. Total rules applied 119 place count 462 transition count 406
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 129 place count 452 transition count 406
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 129 place count 452 transition count 306
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 337 place count 344 transition count 306
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 391 place count 290 transition count 252
Iterating global reduction 3 with 54 rules applied. Total rules applied 445 place count 290 transition count 252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 445 place count 290 transition count 251
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 447 place count 289 transition count 251
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 577 place count 224 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 578 place count 224 transition count 185
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 583 place count 224 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 584 place count 223 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 585 place count 222 transition count 184
Applied a total of 585 rules in 114 ms. Remains 222 /518 variables (removed 296) and now considering 184/471 (removed 287) transitions.
Finished structural reductions, in 1 iterations. Remains : 222/518 places, 184/471 transitions.
Incomplete random walk after 1000000 steps, including 34696 resets, run finished after 9757 ms. (steps per millisecond=102 ) properties (out of 8) seen :6
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9332 resets, run finished after 2457 ms. (steps per millisecond=407 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7725 resets, run finished after 2321 ms. (steps per millisecond=430 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 184 rows 222 cols
[2022-06-02 20:10:49] [INFO ] Computed 75 place invariants in 18 ms
[2022-06-02 20:10:49] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:10:49] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2022-06-02 20:10:49] [INFO ] [Nat]Absence check using 45 positive and 30 generalized place invariants in 10 ms returned sat
[2022-06-02 20:10:49] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:10:50] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:10:50] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:10:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 161 ms
[2022-06-02 20:10:50] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-06-02 20:10:50] [INFO ] After 568ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 120 ms.
Support contains 16 out of 222 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 222/222 places, 184/184 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 222 transition count 181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 219 transition count 181
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 6 place count 219 transition count 167
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 39 place count 200 transition count 167
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 197 transition count 164
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 197 transition count 164
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 99 place count 169 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 168 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 167 transition count 140
Applied a total of 102 rules in 35 ms. Remains 167 /222 variables (removed 55) and now considering 140/184 (removed 44) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/222 places, 140/184 transitions.
Incomplete random walk after 1000000 steps, including 73483 resets, run finished after 2043 ms. (steps per millisecond=489 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14848 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties (out of 1) seen :0
Finished probabilistic random walk after 117344 steps, run visited all 1 properties in 287 ms. (steps per millisecond=408 )
Probabilistic random walk after 117344 steps, saw 28517 distinct states, run finished after 287 ms. (steps per millisecond=408 ) properties seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 48964 ms.

BK_STOP 1654200654029

--------------------
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-10"
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-10, 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-165251918500399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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