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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 6.1K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:06 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 146K 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-12-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654200663876

Running Version 202205111006
[2022-06-02 20:11: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:11:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:11:05] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-06-02 20:11:05] [INFO ] Transformed 586 places.
[2022-06-02 20:11:05] [INFO ] Transformed 525 transitions.
[2022-06-02 20:11:05] [INFO ] Found NUPN structural information;
[2022-06-02 20:11:05] [INFO ] Parsed PT model containing 586 places and 525 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 521 rows 582 cols
[2022-06-02 20:11:06] [INFO ] Computed 98 place invariants in 27 ms
[2022-06-02 20:11:07] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned sat
[2022-06-02 20:11:07] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2022-06-02 20:11:07] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-02 20:11:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 48 ms returned sat
[2022-06-02 20:11:07] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 17 ms returned sat
[2022-06-02 20:11:09] [INFO ] After 1454ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2022-06-02 20:11:09] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 5 ms to minimize.
[2022-06-02 20:11:09] [INFO ] Deduced a trap composed of 112 places in 207 ms of which 1 ms to minimize.
[2022-06-02 20:11:10] [INFO ] Deduced a trap composed of 132 places in 179 ms of which 2 ms to minimize.
[2022-06-02 20:11:10] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
[2022-06-02 20:11:10] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2022-06-02 20:11:10] [INFO ] Deduced a trap composed of 115 places in 166 ms of which 0 ms to minimize.
[2022-06-02 20:11:10] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 1 ms to minimize.
[2022-06-02 20:11:11] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 1 ms to minimize.
[2022-06-02 20:11:11] [INFO ] Deduced a trap composed of 108 places in 167 ms of which 1 ms to minimize.
[2022-06-02 20:11:11] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 0 ms to minimize.
[2022-06-02 20:11:11] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 0 ms to minimize.
[2022-06-02 20:11:11] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2022-06-02 20:11:12] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2022-06-02 20:11:12] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:11:12] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 0 ms to minimize.
[2022-06-02 20:11:12] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:11:12] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:11:12] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2022-06-02 20:11:13] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:11:13] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:11:13] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:11:13] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:11:13] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:11:13] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:11:14] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2022-06-02 20:11:14] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:11:14] [INFO ] Deduced a trap composed of 121 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:11:14] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:11:14] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5039 ms
[2022-06-02 20:11:14] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2022-06-02 20:11:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-06-02 20:11:15] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:11:15] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:11:15] [INFO ] Deduced a trap composed of 127 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:11:16] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:11:16] [INFO ] Deduced a trap composed of 119 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:11:16] [INFO ] Deduced a trap composed of 129 places in 146 ms of which 4 ms to minimize.
[2022-06-02 20:11:16] [INFO ] Deduced a trap composed of 115 places in 145 ms of which 0 ms to minimize.
[2022-06-02 20:11:16] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:11:17] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 0 ms to minimize.
[2022-06-02 20:11:17] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 0 ms to minimize.
[2022-06-02 20:11:17] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:11:17] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:11:18] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:11:18] [INFO ] Deduced a trap composed of 140 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:11:18] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:11:18] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:11:18] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:11:19] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:11:19] [INFO ] Deduced a trap composed of 149 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:11:19] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:11:19] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:11:19] [INFO ] Deduced a trap composed of 140 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:11:20] [INFO ] Deduced a trap composed of 136 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:11:20] [INFO ] Deduced a trap composed of 148 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:11:20] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:11:20] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:11:21] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5846 ms
[2022-06-02 20:11:21] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2022-06-02 20:11:21] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 9 ms to minimize.
[2022-06-02 20:11:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-06-02 20:11:21] [INFO ] Deduced a trap composed of 127 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:11:22] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:11:22] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:11:22] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:11:22] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:11:22] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:11:22] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:11:22] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:11:23] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2022-06-02 20:11:23] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:11:23] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 10 ms to minimize.
[2022-06-02 20:11:23] [INFO ] Deduced a trap composed of 142 places in 115 ms of which 2 ms to minimize.
[2022-06-02 20:11:23] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:11:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1984 ms
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 0 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
[2022-06-02 20:11:24] [INFO ] After 16663ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 2073 ms.
[2022-06-02 20:11:26] [INFO ] After 19203ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 9 different solutions.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4730 ms.
Support contains 124 out of 582 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (complete) has 1186 edges and 582 vertex of which 578 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 578 transition count 479
Reduce places removed 41 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 58 rules applied. Total rules applied 100 place count 537 transition count 462
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 117 place count 520 transition count 462
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 117 place count 520 transition count 376
Deduced a syphon composed of 86 places in 6 ms
Ensure Unique test removed 6 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 295 place count 428 transition count 376
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 349 place count 374 transition count 322
Iterating global reduction 3 with 54 rules applied. Total rules applied 403 place count 374 transition count 322
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 513 place count 319 transition count 267
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 514 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 515 place count 318 transition count 266
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 520 place count 318 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 521 place count 317 transition count 265
Applied a total of 521 rules in 160 ms. Remains 317 /582 variables (removed 265) and now considering 265/521 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 317/582 places, 265/521 transitions.
Incomplete random walk after 1000000 steps, including 12938 resets, run finished after 17954 ms. (steps per millisecond=55 ) properties (out of 8) seen :4
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3157 resets, run finished after 4970 ms. (steps per millisecond=201 ) properties (out of 4) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 3247 resets, run finished after 4143 ms. (steps per millisecond=241 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 790109 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2754 resets, run finished after 3372 ms. (steps per millisecond=296 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 265 rows 317 cols
[2022-06-02 20:12:07] [INFO ] Computed 89 place invariants in 9 ms
[2022-06-02 20:12:07] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:12:07] [INFO ] [Nat]Absence check using 52 positive place invariants in 11 ms returned sat
[2022-06-02 20:12:07] [INFO ] [Nat]Absence check using 52 positive and 37 generalized place invariants in 11 ms returned sat
[2022-06-02 20:12:07] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:12:07] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 0 ms to minimize.
[2022-06-02 20:12:07] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:12:07] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1055 ms
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2022-06-02 20:12:08] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2022-06-02 20:12:09] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2022-06-02 20:12:09] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2022-06-02 20:12:09] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2022-06-02 20:12:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 589 ms
[2022-06-02 20:12:09] [INFO ] After 2051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 244 ms.
[2022-06-02 20:12:09] [INFO ] After 2380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 302 ms.
Support contains 67 out of 317 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 317/317 places, 265/265 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 317 transition count 259
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 311 transition count 257
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 309 transition count 257
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 16 place count 309 transition count 239
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 56 place count 287 transition count 239
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 282 transition count 234
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 282 transition count 234
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 110 place count 260 transition count 212
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 260 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 259 transition count 211
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 259 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 258 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 257 transition count 210
Applied a total of 115 rules in 79 ms. Remains 257 /317 variables (removed 60) and now considering 210/265 (removed 55) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/317 places, 210/265 transitions.
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 7310 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2157 ms. (steps per millisecond=463 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4085 ms. (steps per millisecond=244 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13365608 steps, run timeout after 39001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 13365608 steps, saw 1609570 distinct states, run finished after 39004 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 210 rows 257 cols
[2022-06-02 20:13:02] [INFO ] Computed 84 place invariants in 9 ms
[2022-06-02 20:13:02] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:13:02] [INFO ] [Nat]Absence check using 53 positive place invariants in 14 ms returned sat
[2022-06-02 20:13:02] [INFO ] [Nat]Absence check using 53 positive and 31 generalized place invariants in 11 ms returned sat
[2022-06-02 20:13:02] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 0 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 0 ms to minimize.
[2022-06-02 20:13:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1008 ms
[2022-06-02 20:13:04] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2022-06-02 20:13:04] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2022-06-02 20:13:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2022-06-02 20:13:04] [INFO ] After 1500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 188 ms.
[2022-06-02 20:13:04] [INFO ] After 1778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 263 ms.
Support contains 67 out of 257 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 257/257 places, 210/210 transitions.
Applied a total of 0 rules in 11 ms. Remains 257 /257 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/257 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 257/257 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 257 /257 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 257 cols
[2022-06-02 20:13:04] [INFO ] Computed 84 place invariants in 9 ms
[2022-06-02 20:13:04] [INFO ] Implicit Places using invariants in 144 ms returned [31, 36, 38, 40, 42, 44, 46, 48, 50, 73, 74, 75, 76, 77, 78, 88, 91, 95, 205, 214]
Discarding 20 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 148 ms to find 20 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 237/257 places, 208/210 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 235 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 235 transition count 203
Applied a total of 4 rules in 13 ms. Remains 235 /237 variables (removed 2) and now considering 203/208 (removed 5) transitions.
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:13:04] [INFO ] Computed 66 place invariants in 3 ms
[2022-06-02 20:13:04] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:13:04] [INFO ] Computed 66 place invariants in 2 ms
[2022-06-02 20:13:05] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 235/257 places, 203/210 transitions.
Finished structural reductions, in 2 iterations. Remains : 235/257 places, 203/210 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10601 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2283 ms. (steps per millisecond=438 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4302 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 17761442 steps, run timeout after 51001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 17761442 steps, saw 2267762 distinct states, run finished after 51002 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:14:13] [INFO ] Computed 66 place invariants in 2 ms
[2022-06-02 20:14:13] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:14:13] [INFO ] [Nat]Absence check using 54 positive place invariants in 11 ms returned sat
[2022-06-02 20:14:13] [INFO ] [Nat]Absence check using 54 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-02 20:14:13] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2022-06-02 20:14:13] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2022-06-02 20:14:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 268 ms
[2022-06-02 20:14:14] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2022-06-02 20:14:14] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2022-06-02 20:14:14] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2022-06-02 20:14:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
[2022-06-02 20:14:14] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-06-02 20:14:14] [INFO ] After 927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 168 ms.
Support contains 67 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 203/203 transitions.
Applied a total of 0 rules in 23 ms. Remains 235 /235 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 203/203 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:14:14] [INFO ] Computed 66 place invariants in 1 ms
[2022-06-02 20:14:14] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:14:14] [INFO ] Computed 66 place invariants in 1 ms
[2022-06-02 20:14:14] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2022-06-02 20:14:14] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:14:14] [INFO ] Computed 66 place invariants in 3 ms
[2022-06-02 20:14:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 203/203 transitions.
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 7291 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2098 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3700 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 14303019 steps, run timeout after 39001 ms. (steps per millisecond=366 ) properties seen :{}
Probabilistic random walk after 14303019 steps, saw 1859698 distinct states, run finished after 39001 ms. (steps per millisecond=366 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:15:07] [INFO ] Computed 66 place invariants in 2 ms
[2022-06-02 20:15:07] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:15:07] [INFO ] [Nat]Absence check using 54 positive place invariants in 11 ms returned sat
[2022-06-02 20:15:07] [INFO ] [Nat]Absence check using 54 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-02 20:15:07] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 241 ms
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 187 ms
[2022-06-02 20:15:08] [INFO ] After 712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2022-06-02 20:15:08] [INFO ] After 906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 170 ms.
Support contains 67 out of 235 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 203/203 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 203/203 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 235/235 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:15:08] [INFO ] Computed 66 place invariants in 2 ms
[2022-06-02 20:15:08] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:15:08] [INFO ] Computed 66 place invariants in 2 ms
[2022-06-02 20:15:08] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2022-06-02 20:15:08] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:15:08] [INFO ] Computed 66 place invariants in 5 ms
[2022-06-02 20:15:08] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 203/203 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:15:08] [INFO ] Computed 66 place invariants in 3 ms
[2022-06-02 20:15:08] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:15:08] [INFO ] [Nat]Absence check using 54 positive place invariants in 10 ms returned sat
[2022-06-02 20:15:08] [INFO ] [Nat]Absence check using 54 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-02 20:15:09] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 262 ms
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
[2022-06-02 20:15:09] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 129 ms.
[2022-06-02 20:15:09] [INFO ] After 938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 20:15:10] [INFO ] Flatten gal took : 65 ms
[2022-06-02 20:15:10] [INFO ] Flatten gal took : 21 ms
[2022-06-02 20:15:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15399483176438780973.gal : 11 ms
[2022-06-02 20:15:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2738072039002505599.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15399483176438780973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2738072039002505599.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2738072039002505599.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 29
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :29 after 35
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :35 after 48
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :48 after 144
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :276 after 15798
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :15798 after 44424
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :944550 after 990305
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :990305 after 1.65665e+06
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-11 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.65665e+06 after 8.78645e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.78645e+07 after 9.14552e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.10354e+09,5.9319,90980,2,41196,21,313784,7,0,1182,240302,0
Total reachable state count : 3103540368

Verifying 2 reachability properties.
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityFireability-10,1.24416e+06,5.97265,90980,2,2436,21,313784,7,0,1226,240302,0
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityFireability-11,124416,6.10565,90980,2,900,21,313784,8,0,1334,240302,0
[2022-06-02 20:15:16] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4797229099611011105
[2022-06-02 20:15:16] [INFO ] Applying decomposition
[2022-06-02 20:15:16] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2022-06-02 20:15:16] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:15:16] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2022-06-02 20:15:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:15:16] [INFO ] Flatten gal took : 16 ms
[2022-06-02 20:15:16] [INFO ] Flatten gal took : 69 ms
[2022-06-02 20:15:16] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2022-06-02 20:15:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 20:15:16] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4797229099611011105
[2022-06-02 20:15:16] [INFO ] Input system was already deterministic with 203 transitions.
Running compilation step : cd /tmp/ltsmin4797229099611011105;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4449603232970321926.txt' '-o' '/tmp/graph4449603232970321926.bin' '-w' '/tmp/graph4449603232970321926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4449603232970321926.bin' '-l' '-1' '-v' '-w' '/tmp/graph4449603232970321926.weights' '-q' '0' '-e' '0.001'
[2022-06-02 20:15:16] [INFO ] Decomposing Gal with order
[2022-06-02 20:15:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 20:15:16] [INFO ] Ran tautology test, simplified 0 / 2 in 225 ms.
[2022-06-02 20:15:16] [INFO ] Removed a total of 92 redundant transitions.
[2022-06-02 20:15:16] [INFO ] BMC solution for property BusinessProcesses-PT-12-ReachabilityFireability-10(UNSAT) depth K=0 took 19 ms
[2022-06-02 20:15:16] [INFO ] BMC solution for property BusinessProcesses-PT-12-ReachabilityFireability-11(UNSAT) depth K=0 took 1 ms
[2022-06-02 20:15:16] [INFO ] BMC solution for property BusinessProcesses-PT-12-ReachabilityFireability-10(UNSAT) depth K=1 took 4 ms
[2022-06-02 20:15:16] [INFO ] BMC solution for property BusinessProcesses-PT-12-ReachabilityFireability-11(UNSAT) depth K=1 took 16 ms
[2022-06-02 20:15:16] [INFO ] Flatten gal took : 138 ms
[2022-06-02 20:15:16] [INFO ] BMC solution for property BusinessProcesses-PT-12-ReachabilityFireability-10(UNSAT) depth K=2 took 107 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 203 rows 235 cols
[2022-06-02 20:15:16] [INFO ] Computed 66 place invariants in 2 ms
[2022-06-02 20:15:16] [INFO ] Computed 66 place invariants in 2 ms
[2022-06-02 20:15:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 30 ms.
[2022-06-02 20:15:16] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2597714998502004548.gal : 6 ms
[2022-06-02 20:15:16] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11152359352943196090.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2597714998502004548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11152359352943196090.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability11152359352943196090.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 38
[2022-06-02 20:15:16] [INFO ] BMC solution for property BusinessProcesses-PT-12-ReachabilityFireability-11(UNSAT) depth K=2 took 129 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 56
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :358 after 798
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-11 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-10 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
[2022-06-02 20:15:17] [INFO ] BMC solution for property BusinessProcesses-PT-12-ReachabilityFireability-10(UNSAT) depth K=3 took 269 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.2662e+08,0.25985,10636,1173,450,14019,1778,806,17272,186,3912,0
Total reachable state count : 426619536

Verifying 2 reachability properties.
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityFireability-10,2592,0.27596,10900,115,62,14019,1778,990,17272,224,3912,0
Invariant property BusinessProcesses-PT-12-ReachabilityFireability-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityFireability-11,31104,0.29357,10900,117,72,14019,1778,1153,17272,233,3912,0
[2022-06-02 20:15:17] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Exception in thread "Thread-7" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 20:15:17] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
Total runtime 252209 ms.

BK_STOP 1654200917373

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-12"
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-12, 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-165251918500415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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