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-158897699200550.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-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 22:45 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 148K 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-13-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589254578603

[2020-05-12 03:36:20] [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 03:36:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:36:20] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2020-05-12 03:36:20] [INFO ] Transformed 593 places.
[2020-05-12 03:36:20] [INFO ] Transformed 536 transitions.
[2020-05-12 03:36:20] [INFO ] Found NUPN structural information;
[2020-05-12 03:36:20] [INFO ] Parsed PT model containing 593 places and 536 transitions in 135 ms.
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 71 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 1, 0, 0, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 528 rows 585 cols
[2020-05-12 03:36:20] [INFO ] Computed 95 place invariants in 27 ms
[2020-05-12 03:36:21] [INFO ] [Real]Absence check using 57 positive place invariants in 54 ms returned sat
[2020-05-12 03:36:21] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 31 ms returned sat
[2020-05-12 03:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:21] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2020-05-12 03:36:22] [INFO ] Deduced a trap composed of 13 places in 297 ms
[2020-05-12 03:36:22] [INFO ] Deduced a trap composed of 11 places in 243 ms
[2020-05-12 03:36:22] [INFO ] Deduced a trap composed of 130 places in 211 ms
[2020-05-12 03:36:23] [INFO ] Deduced a trap composed of 14 places in 151 ms
[2020-05-12 03:36:23] [INFO ] Deduced a trap composed of 34 places in 181 ms
[2020-05-12 03:36:23] [INFO ] Deduced a trap composed of 16 places in 160 ms
[2020-05-12 03:36:23] [INFO ] Deduced a trap composed of 41 places in 162 ms
[2020-05-12 03:36:23] [INFO ] Deduced a trap composed of 135 places in 157 ms
[2020-05-12 03:36:23] [INFO ] Deduced a trap composed of 45 places in 139 ms
[2020-05-12 03:36:24] [INFO ] Deduced a trap composed of 41 places in 139 ms
[2020-05-12 03:36:24] [INFO ] Deduced a trap composed of 131 places in 132 ms
[2020-05-12 03:36:24] [INFO ] Deduced a trap composed of 45 places in 147 ms
[2020-05-12 03:36:24] [INFO ] Deduced a trap composed of 131 places in 140 ms
[2020-05-12 03:36:24] [INFO ] Deduced a trap composed of 130 places in 138 ms
[2020-05-12 03:36:24] [INFO ] Deduced a trap composed of 133 places in 127 ms
[2020-05-12 03:36:25] [INFO ] Deduced a trap composed of 138 places in 129 ms
[2020-05-12 03:36:25] [INFO ] Deduced a trap composed of 30 places in 125 ms
[2020-05-12 03:36:25] [INFO ] Deduced a trap composed of 20 places in 127 ms
[2020-05-12 03:36:25] [INFO ] Deduced a trap composed of 27 places in 128 ms
[2020-05-12 03:36:25] [INFO ] Deduced a trap composed of 8 places in 129 ms
[2020-05-12 03:36:25] [INFO ] Deduced a trap composed of 19 places in 125 ms
[2020-05-12 03:36:25] [INFO ] Deduced a trap composed of 15 places in 127 ms
[2020-05-12 03:36:25] [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 s7 s8 s209 s305 s306 s307 s538 s539) 0)") while checking expression at index 0
[2020-05-12 03:36:26] [INFO ] [Real]Absence check using 57 positive place invariants in 41 ms returned sat
[2020-05-12 03:36:26] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:26] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2020-05-12 03:36:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:36:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned unsat
[2020-05-12 03:36:27] [INFO ] [Real]Absence check using 57 positive place invariants in 99 ms returned sat
[2020-05-12 03:36:27] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 96 ms returned sat
[2020-05-12 03:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:27] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2020-05-12 03:36:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:36:28] [INFO ] [Nat]Absence check using 57 positive place invariants in 65 ms returned sat
[2020-05-12 03:36:28] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 16 ms returned sat
[2020-05-12 03:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:28] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-05-12 03:36:28] [INFO ] Deduced a trap composed of 23 places in 110 ms
[2020-05-12 03:36:28] [INFO ] Deduced a trap composed of 30 places in 79 ms
[2020-05-12 03:36:28] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 17 places in 151 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 15 places in 83 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 26 places in 74 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 29 places in 82 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 24 places in 76 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 33 places in 70 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 24 places in 90 ms
[2020-05-12 03:36:29] [INFO ] Deduced a trap composed of 27 places in 70 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 41 places in 74 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 34 places in 75 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 41 places in 73 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 35 places in 71 ms
[2020-05-12 03:36:30] [INFO ] Deduced a trap composed of 32 places in 47 ms
[2020-05-12 03:36:30] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2135 ms
[2020-05-12 03:36:30] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 24 ms.
[2020-05-12 03:36:32] [INFO ] Added : 262 causal constraints over 53 iterations in 1920 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-05-12 03:36:32] [INFO ] [Real]Absence check using 57 positive place invariants in 37 ms returned sat
[2020-05-12 03:36:32] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:33] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-05-12 03:36:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:36:33] [INFO ] [Nat]Absence check using 57 positive place invariants in 57 ms returned sat
[2020-05-12 03:36:33] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2020-05-12 03:36:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:34] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2020-05-12 03:36:34] [INFO ] Deduced a trap composed of 15 places in 175 ms
[2020-05-12 03:36:34] [INFO ] Deduced a trap composed of 43 places in 164 ms
[2020-05-12 03:36:34] [INFO ] Deduced a trap composed of 145 places in 139 ms
[2020-05-12 03:36:35] [INFO ] Deduced a trap composed of 39 places in 151 ms
[2020-05-12 03:36:35] [INFO ] Deduced a trap composed of 125 places in 154 ms
[2020-05-12 03:36:35] [INFO ] Deduced a trap composed of 34 places in 148 ms
[2020-05-12 03:36:35] [INFO ] Deduced a trap composed of 12 places in 143 ms
[2020-05-12 03:36:35] [INFO ] Deduced a trap composed of 52 places in 146 ms
[2020-05-12 03:36:35] [INFO ] Deduced a trap composed of 48 places in 143 ms
[2020-05-12 03:36:36] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2020-05-12 03:36:36] [INFO ] Deduced a trap composed of 18 places in 139 ms
[2020-05-12 03:36:36] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2020-05-12 03:36:36] [INFO ] Deduced a trap composed of 133 places in 137 ms
[2020-05-12 03:36:36] [INFO ] Deduced a trap composed of 126 places in 142 ms
[2020-05-12 03:36:37] [INFO ] Deduced a trap composed of 122 places in 189 ms
[2020-05-12 03:36:37] [INFO ] Deduced a trap composed of 30 places in 145 ms
[2020-05-12 03:36:37] [INFO ] Deduced a trap composed of 42 places in 125 ms
[2020-05-12 03:36:37] [INFO ] Deduced a trap composed of 22 places in 131 ms
[2020-05-12 03:36:37] [INFO ] Deduced a trap composed of 54 places in 144 ms
[2020-05-12 03:36:37] [INFO ] Deduced a trap composed of 33 places in 137 ms
[2020-05-12 03:36:37] [INFO ] Deduced a trap composed of 128 places in 122 ms
[2020-05-12 03:36:38] [INFO ] Deduced a trap composed of 44 places in 127 ms
[2020-05-12 03:36:38] [INFO ] Deduced a trap composed of 128 places in 117 ms
[2020-05-12 03:36:38] [INFO ] Deduced a trap composed of 122 places in 131 ms
[2020-05-12 03:36:38] [INFO ] Deduced a trap composed of 127 places in 121 ms
[2020-05-12 03:36:38] [INFO ] Deduced a trap composed of 36 places in 136 ms
[2020-05-12 03:36:38] [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 s7 s8 s9 s10 s155 s157 s159 s163 s166 s167 s168 s169 s172 s173 s174 s182 s185 s200 s340 s341 s342 s375 s376 s377 s386 s495 s496 s518 s573) 0)") while checking expression at index 3
[2020-05-12 03:36:38] [INFO ] [Real]Absence check using 57 positive place invariants in 43 ms returned sat
[2020-05-12 03:36:38] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 30 ms returned sat
[2020-05-12 03:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:39] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2020-05-12 03:36:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:36:39] [INFO ] [Nat]Absence check using 57 positive place invariants in 52 ms returned sat
[2020-05-12 03:36:39] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:36:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:40] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2020-05-12 03:36:40] [INFO ] Deduced a trap composed of 8 places in 174 ms
[2020-05-12 03:36:41] [INFO ] Deduced a trap composed of 17 places in 165 ms
[2020-05-12 03:36:41] [INFO ] Deduced a trap composed of 16 places in 133 ms
[2020-05-12 03:36:41] [INFO ] Deduced a trap composed of 14 places in 144 ms
[2020-05-12 03:36:41] [INFO ] Deduced a trap composed of 28 places in 126 ms
[2020-05-12 03:36:41] [INFO ] Deduced a trap composed of 23 places in 112 ms
[2020-05-12 03:36:41] [INFO ] Deduced a trap composed of 111 places in 111 ms
[2020-05-12 03:36:42] [INFO ] Deduced a trap composed of 42 places in 145 ms
[2020-05-12 03:36:42] [INFO ] Deduced a trap composed of 108 places in 127 ms
[2020-05-12 03:36:42] [INFO ] Deduced a trap composed of 19 places in 120 ms
[2020-05-12 03:36:42] [INFO ] Deduced a trap composed of 31 places in 130 ms
[2020-05-12 03:36:42] [INFO ] Deduced a trap composed of 36 places in 114 ms
[2020-05-12 03:36:42] [INFO ] Deduced a trap composed of 122 places in 110 ms
[2020-05-12 03:36:42] [INFO ] Deduced a trap composed of 111 places in 133 ms
[2020-05-12 03:36:43] [INFO ] Deduced a trap composed of 43 places in 109 ms
[2020-05-12 03:36:43] [INFO ] Deduced a trap composed of 39 places in 107 ms
[2020-05-12 03:36:43] [INFO ] Deduced a trap composed of 42 places in 111 ms
[2020-05-12 03:36:43] [INFO ] Deduced a trap composed of 53 places in 131 ms
[2020-05-12 03:36:43] [INFO ] Deduced a trap composed of 111 places in 111 ms
[2020-05-12 03:36:43] [INFO ] Deduced a trap composed of 38 places in 186 ms
[2020-05-12 03:36:43] [INFO ] Deduced a trap composed of 138 places in 105 ms
[2020-05-12 03:36:44] [INFO ] Deduced a trap composed of 123 places in 124 ms
[2020-05-12 03:36:44] [INFO ] Deduced a trap composed of 112 places in 145 ms
[2020-05-12 03:36:44] [INFO ] Deduced a trap composed of 112 places in 108 ms
[2020-05-12 03:36:44] [INFO ] Deduced a trap composed of 43 places in 64 ms
[2020-05-12 03:36:44] [INFO ] Deduced a trap composed of 51 places in 78 ms
[2020-05-12 03:36:44] [INFO ] Deduced a trap composed of 53 places in 59 ms
[2020-05-12 03:36:44] [INFO ] Deduced a trap composed of 53 places in 56 ms
[2020-05-12 03:36:44] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2020-05-12 03:36:44] [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 s228) 0)") while checking expression at index 4
[2020-05-12 03:36:45] [INFO ] [Real]Absence check using 57 positive place invariants in 37 ms returned sat
[2020-05-12 03:36:45] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:45] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2020-05-12 03:36:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:36:45] [INFO ] [Nat]Absence check using 57 positive place invariants in 49 ms returned sat
[2020-05-12 03:36:45] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:36:46] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2020-05-12 03:36:46] [INFO ] Deduced a trap composed of 22 places in 165 ms
[2020-05-12 03:36:46] [INFO ] Deduced a trap composed of 123 places in 148 ms
[2020-05-12 03:36:47] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-05-12 03:36:47] [INFO ] Deduced a trap composed of 49 places in 150 ms
[2020-05-12 03:36:47] [INFO ] Deduced a trap composed of 34 places in 153 ms
[2020-05-12 03:36:47] [INFO ] Deduced a trap composed of 13 places in 145 ms
[2020-05-12 03:36:47] [INFO ] Deduced a trap composed of 12 places in 145 ms
[2020-05-12 03:36:47] [INFO ] Deduced a trap composed of 23 places in 147 ms
[2020-05-12 03:36:48] [INFO ] Deduced a trap composed of 24 places in 147 ms
[2020-05-12 03:36:48] [INFO ] Deduced a trap composed of 35 places in 177 ms
[2020-05-12 03:36:48] [INFO ] Deduced a trap composed of 16 places in 141 ms
[2020-05-12 03:36:48] [INFO ] Deduced a trap composed of 117 places in 140 ms
[2020-05-12 03:36:48] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2020-05-12 03:36:48] [INFO ] Deduced a trap composed of 22 places in 140 ms
[2020-05-12 03:36:49] [INFO ] Deduced a trap composed of 123 places in 130 ms
[2020-05-12 03:36:49] [INFO ] Deduced a trap composed of 124 places in 125 ms
[2020-05-12 03:36:49] [INFO ] Deduced a trap composed of 36 places in 135 ms
[2020-05-12 03:36:49] [INFO ] Deduced a trap composed of 16 places in 121 ms
[2020-05-12 03:36:49] [INFO ] Deduced a trap composed of 129 places in 128 ms
[2020-05-12 03:36:49] [INFO ] Deduced a trap composed of 26 places in 122 ms
[2020-05-12 03:36:49] [INFO ] Deduced a trap composed of 128 places in 140 ms
[2020-05-12 03:36:50] [INFO ] Deduced a trap composed of 38 places in 128 ms
[2020-05-12 03:36:50] [INFO ] Deduced a trap composed of 134 places in 128 ms
[2020-05-12 03:36:50] [INFO ] Deduced a trap composed of 23 places in 125 ms
[2020-05-12 03:36:50] [INFO ] Deduced a trap composed of 38 places in 144 ms
[2020-05-12 03:36:50] [INFO ] Deduced a trap composed of 43 places in 143 ms
[2020-05-12 03:36:50] [INFO ] Deduced a trap composed of 33 places in 129 ms
[2020-05-12 03:36:50] [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 s41 s42 s43 s46 s47 s212 s213 s214 s218 s219 s220 s233 s236 s295 s296 s297 s301 s306 s311 s316 s406 s411 s440 s441 s442 s453 s454 s455 s546 s547) 0)") while checking expression at index 5
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 26600 steps, including 194 resets, run finished after 59 ms. (steps per millisecond=450 ) properties seen :[0, 1, 0, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 326 edges and 585 vertex of which 4 / 585 are part of one of the 1 SCC in 15 ms
Free SCC test removed 3 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1193 edges and 582 vertex of which 576 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 576 transition count 395
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 262 place count 448 transition count 395
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 262 place count 448 transition count 307
Deduced a syphon composed of 88 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 193 rules applied. Total rules applied 455 place count 343 transition count 307
Symmetric choice reduction at 2 with 74 rule applications. Total rules 529 place count 343 transition count 307
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 74 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 677 place count 269 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 677 place count 269 transition count 225
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 695 place count 259 transition count 225
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 867 place count 172 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 869 place count 171 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 870 place count 171 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 871 place count 170 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 872 place count 170 transition count 143
Applied a total of 872 rules in 107 ms. Remains 170 /585 variables (removed 415) and now considering 143/528 (removed 385) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/585 places, 143/528 transitions.
Incomplete random walk after 1000000 steps, including 66544 resets, run finished after 1733 ms. (steps per millisecond=577 ) properties seen :[1, 1, 0, 1]
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 9811 steps, including 178 resets, run visited all 1 properties in 45 ms. (steps per millisecond=218 )
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589254612968

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

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