Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 192K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1589259535053

[2020-05-12 04:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 04:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:58:56] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2020-05-12 04:58:56] [INFO ] Transformed 782 places.
[2020-05-12 04:58:56] [INFO ] Transformed 697 transitions.
[2020-05-12 04:58:56] [INFO ] Found NUPN structural information;
[2020-05-12 04:58:56] [INFO ] Parsed PT model containing 782 places and 697 transitions in 127 ms.
Deduced a syphon composed of 63 places in 15 ms
Reduce places removed 63 places and 59 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 55 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 49 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1]
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 1, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 638 rows 719 cols
[2020-05-12 04:58:56] [INFO ] Computed 121 place invariants in 23 ms
[2020-05-12 04:58:57] [INFO ] [Real]Absence check using 78 positive place invariants in 69 ms returned sat
[2020-05-12 04:58:57] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 28 ms returned sat
[2020-05-12 04:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:58:58] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2020-05-12 04:58:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:58:58] [INFO ] [Nat]Absence check using 78 positive place invariants in 82 ms returned sat
[2020-05-12 04:58:58] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 25 ms returned sat
[2020-05-12 04:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:58:59] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2020-05-12 04:59:00] [INFO ] Deduced a trap composed of 11 places in 380 ms
[2020-05-12 04:59:00] [INFO ] Deduced a trap composed of 16 places in 280 ms
[2020-05-12 04:59:00] [INFO ] Deduced a trap composed of 16 places in 368 ms
[2020-05-12 04:59:01] [INFO ] Deduced a trap composed of 30 places in 374 ms
[2020-05-12 04:59:01] [INFO ] Deduced a trap composed of 12 places in 244 ms
[2020-05-12 04:59:01] [INFO ] Deduced a trap composed of 127 places in 219 ms
[2020-05-12 04:59:01] [INFO ] Deduced a trap composed of 22 places in 269 ms
[2020-05-12 04:59:02] [INFO ] Deduced a trap composed of 21 places in 235 ms
[2020-05-12 04:59:02] [INFO ] Deduced a trap composed of 25 places in 255 ms
[2020-05-12 04:59:02] [INFO ] Deduced a trap composed of 143 places in 292 ms
[2020-05-12 04:59:03] [INFO ] Deduced a trap composed of 130 places in 237 ms
[2020-05-12 04:59:03] [INFO ] Deduced a trap composed of 32 places in 233 ms
[2020-05-12 04:59:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 04:59:03] [INFO ] Deduced a trap composed of 6 places in 317 ms
[2020-05-12 04:59:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s285) 0)") while checking expression at index 0
[2020-05-12 04:59:03] [INFO ] [Real]Absence check using 78 positive place invariants in 70 ms returned sat
[2020-05-12 04:59:03] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 23 ms returned sat
[2020-05-12 04:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:04] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2020-05-12 04:59:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:59:04] [INFO ] [Nat]Absence check using 78 positive place invariants in 25 ms returned unsat
[2020-05-12 04:59:05] [INFO ] [Real]Absence check using 78 positive place invariants in 60 ms returned sat
[2020-05-12 04:59:05] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 22 ms returned sat
[2020-05-12 04:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:06] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2020-05-12 04:59:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:59:06] [INFO ] [Nat]Absence check using 78 positive place invariants in 93 ms returned sat
[2020-05-12 04:59:06] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2020-05-12 04:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:07] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2020-05-12 04:59:07] [INFO ] Deduced a trap composed of 13 places in 186 ms
[2020-05-12 04:59:08] [INFO ] Deduced a trap composed of 14 places in 1036 ms
[2020-05-12 04:59:09] [INFO ] Deduced a trap composed of 20 places in 469 ms
[2020-05-12 04:59:09] [INFO ] Deduced a trap composed of 33 places in 152 ms
[2020-05-12 04:59:09] [INFO ] Deduced a trap composed of 19 places in 130 ms
[2020-05-12 04:59:09] [INFO ] Deduced a trap composed of 22 places in 103 ms
[2020-05-12 04:59:09] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-05-12 04:59:09] [INFO ] Deduced a trap composed of 22 places in 105 ms
[2020-05-12 04:59:09] [INFO ] Deduced a trap composed of 33 places in 107 ms
[2020-05-12 04:59:10] [INFO ] Deduced a trap composed of 25 places in 84 ms
[2020-05-12 04:59:10] [INFO ] Deduced a trap composed of 30 places in 112 ms
[2020-05-12 04:59:10] [INFO ] Deduced a trap composed of 26 places in 86 ms
[2020-05-12 04:59:10] [INFO ] Deduced a trap composed of 56 places in 66 ms
[2020-05-12 04:59:10] [INFO ] Deduced a trap composed of 55 places in 61 ms
[2020-05-12 04:59:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3220 ms
[2020-05-12 04:59:10] [INFO ] Computed and/alt/rep : 637/2880/637 causal constraints in 53 ms.
[2020-05-12 04:59:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t1 0) (and (and (> t456 0) (< o456 o1)) (and (> t455 0) (< o455 o1))))") while checking expression at index 2
[2020-05-12 04:59:11] [INFO ] [Real]Absence check using 78 positive place invariants in 46 ms returned sat
[2020-05-12 04:59:11] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 23 ms returned sat
[2020-05-12 04:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:12] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2020-05-12 04:59:12] [INFO ] Deduced a trap composed of 22 places in 268 ms
[2020-05-12 04:59:12] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2020-05-12 04:59:13] [INFO ] Deduced a trap composed of 19 places in 208 ms
[2020-05-12 04:59:13] [INFO ] Deduced a trap composed of 23 places in 199 ms
[2020-05-12 04:59:13] [INFO ] Deduced a trap composed of 22 places in 207 ms
[2020-05-12 04:59:13] [INFO ] Deduced a trap composed of 26 places in 197 ms
[2020-05-12 04:59:13] [INFO ] Deduced a trap composed of 164 places in 193 ms
[2020-05-12 04:59:14] [INFO ] Deduced a trap composed of 160 places in 206 ms
[2020-05-12 04:59:14] [INFO ] Deduced a trap composed of 158 places in 228 ms
[2020-05-12 04:59:14] [INFO ] Deduced a trap composed of 163 places in 218 ms
[2020-05-12 04:59:14] [INFO ] Deduced a trap composed of 166 places in 228 ms
[2020-05-12 04:59:15] [INFO ] Deduced a trap composed of 155 places in 260 ms
[2020-05-12 04:59:15] [INFO ] Deduced a trap composed of 172 places in 180 ms
[2020-05-12 04:59:15] [INFO ] Deduced a trap composed of 168 places in 189 ms
[2020-05-12 04:59:15] [INFO ] Deduced a trap composed of 167 places in 189 ms
[2020-05-12 04:59:16] [INFO ] Deduced a trap composed of 169 places in 209 ms
[2020-05-12 04:59:16] [INFO ] Deduced a trap composed of 170 places in 187 ms
[2020-05-12 04:59:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s69 s71 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s108 s109 s110 s114 s115 s116 s149 s150 s151 s152 s153 s154 s155 s156 s160 s161 s171 s172 s173 s176 s177 s181 s200 s201 s202 s220 s221 s249 s250 s251 s277 s282 s283 s335 s336 s337 s350 s351 s352 s360 s361 s362 s365 s367 s376 s396 s401 s405 s407 s433 s438 s448 s467 s469 s473 s478 s483 s493 s498 s508 s517 s518 s519 s527 s530 s531 s532 s533 s538 s539 s540 s541 s544 s545 s548 s549 s550 s551 s552 s554 s555 s556 s560 s561 s573 s574 s575 s576 s593 s594 s599 s600 s608 s609 s610 s611 s612 s613 s614 s615 s616 s619 s620 s623 s624 s625 s626 s629 s630 s637 s638 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s651 s652 s659 s660 s661 s662 s665 s666 s667 s674 s675 s678 s679 s682 s683 s684 s687 s688 s695 s696 s697 s702 s703) 0)") while checking expression at index 3
[2020-05-12 04:59:16] [INFO ] [Real]Absence check using 78 positive place invariants in 47 ms returned sat
[2020-05-12 04:59:16] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 24 ms returned sat
[2020-05-12 04:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:17] [INFO ] [Real]Absence check using state equation in 985 ms returned sat
[2020-05-12 04:59:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:59:17] [INFO ] [Nat]Absence check using 78 positive place invariants in 130 ms returned unsat
[2020-05-12 04:59:17] [INFO ] [Real]Absence check using 78 positive place invariants in 50 ms returned sat
[2020-05-12 04:59:17] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 22 ms returned sat
[2020-05-12 04:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:18] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2020-05-12 04:59:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:59:18] [INFO ] [Nat]Absence check using 78 positive place invariants in 23 ms returned unsat
[2020-05-12 04:59:19] [INFO ] [Real]Absence check using 78 positive place invariants in 51 ms returned sat
[2020-05-12 04:59:19] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 43 ms returned sat
[2020-05-12 04:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:20] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2020-05-12 04:59:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:59:20] [INFO ] [Nat]Absence check using 78 positive place invariants in 94 ms returned sat
[2020-05-12 04:59:20] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 41 ms returned sat
[2020-05-12 04:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:21] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2020-05-12 04:59:21] [INFO ] Deduced a trap composed of 8 places in 196 ms
[2020-05-12 04:59:21] [INFO ] Deduced a trap composed of 20 places in 192 ms
[2020-05-12 04:59:22] [INFO ] Deduced a trap composed of 23 places in 198 ms
[2020-05-12 04:59:22] [INFO ] Deduced a trap composed of 139 places in 462 ms
[2020-05-12 04:59:22] [INFO ] Deduced a trap composed of 34 places in 222 ms
[2020-05-12 04:59:23] [INFO ] Deduced a trap composed of 22 places in 204 ms
[2020-05-12 04:59:23] [INFO ] Deduced a trap composed of 21 places in 189 ms
[2020-05-12 04:59:23] [INFO ] Deduced a trap composed of 159 places in 204 ms
[2020-05-12 04:59:23] [INFO ] Deduced a trap composed of 159 places in 234 ms
[2020-05-12 04:59:24] [INFO ] Deduced a trap composed of 165 places in 312 ms
[2020-05-12 04:59:24] [INFO ] Deduced a trap composed of 154 places in 208 ms
[2020-05-12 04:59:24] [INFO ] Deduced a trap composed of 18 places in 193 ms
[2020-05-12 04:59:24] [INFO ] Deduced a trap composed of 31 places in 185 ms
[2020-05-12 04:59:24] [INFO ] Deduced a trap composed of 158 places in 194 ms
[2020-05-12 04:59:25] [INFO ] Deduced a trap composed of 175 places in 197 ms
[2020-05-12 04:59:25] [INFO ] Deduced a trap composed of 54 places in 50 ms
[2020-05-12 04:59:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3892 ms
[2020-05-12 04:59:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 11 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 403 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.16 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 686 transition count 453
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 338 place count 522 transition count 453
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 338 place count 522 transition count 354
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 556 place count 403 transition count 354
Symmetric choice reduction at 2 with 89 rule applications. Total rules 645 place count 403 transition count 354
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 89 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 823 place count 314 transition count 265
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 823 place count 314 transition count 256
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 843 place count 303 transition count 256
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 1053 place count 197 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1057 place count 195 transition count 159
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1059 place count 195 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1061 place count 193 transition count 157
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1062 place count 193 transition count 157
Applied a total of 1062 rules in 191 ms. Remains 193 /719 variables (removed 526) and now considering 157/638 (removed 481) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/719 places, 157/638 transitions.
Incomplete random walk after 1000000 steps, including 40151 resets, run finished after 2378 ms. (steps per millisecond=420 ) properties seen :[0, 1, 1, 1]
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 13196 resets, run finished after 1227 ms. (steps per millisecond=814 ) properties seen :[0]
[2020-05-12 04:59:29] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
// Phase 1: matrix 156 rows 193 cols
[2020-05-12 04:59:29] [INFO ] Computed 83 place invariants in 3 ms
[2020-05-12 04:59:29] [INFO ] [Real]Absence check using 65 positive place invariants in 34 ms returned sat
[2020-05-12 04:59:29] [INFO ] [Real]Absence check using 65 positive and 18 generalized place invariants in 14 ms returned sat
[2020-05-12 04:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:29] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-05-12 04:59:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:59:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 26 ms returned sat
[2020-05-12 04:59:29] [INFO ] [Nat]Absence check using 65 positive and 18 generalized place invariants in 12 ms returned sat
[2020-05-12 04:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:59:29] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2020-05-12 04:59:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2020-05-12 04:59:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 18 ms returned sat
[2020-05-12 04:59:29] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-05-12 04:59:29] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-05-12 04:59:30] [INFO ] Deduced a trap composed of 41 places in 60 ms
[2020-05-12 04:59:30] [INFO ] Deduced a trap composed of 31 places in 49 ms
[2020-05-12 04:59:30] [INFO ] Deduced a trap composed of 39 places in 42 ms
[2020-05-12 04:59:30] [INFO ] Deduced a trap composed of 43 places in 60 ms
[2020-05-12 04:59:30] [INFO ] Deduced a trap composed of 33 places in 58 ms
[2020-05-12 04:59:30] [INFO ] Deduced a trap composed of 41 places in 64 ms
[2020-05-12 04:59:30] [INFO ] Deduced a trap composed of 44 places in 36 ms
[2020-05-12 04:59:30] [INFO ] Deduced a trap composed of 41 places in 89 ms
[2020-05-12 04:59:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 674 ms
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1589259570730

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699300606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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