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.r182-oct2-158987914100598.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 itslola
Input is BusinessProcesses-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 26K 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 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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 15K 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 189K 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-19-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591167477367

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:57:59] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:57:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:57:59] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-06-03 06:57:59] [INFO ] Transformed 772 places.
[2020-06-03 06:57:59] [INFO ] Transformed 685 transitions.
[2020-06-03 06:57:59] [INFO ] Found NUPN structural information;
[2020-06-03 06:57:59] [INFO ] Parsed PT model containing 772 places and 685 transitions in 166 ms.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 62 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 670 rows 757 cols
[2020-06-03 06:57:59] [INFO ] Computed 125 place invariants in 33 ms
[2020-06-03 06:58:00] [INFO ] [Real]Absence check using 78 positive place invariants in 71 ms returned sat
[2020-06-03 06:58:00] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 26 ms returned sat
[2020-06-03 06:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:01] [INFO ] [Real]Absence check using state equation in 1023 ms returned sat
[2020-06-03 06:58:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:01] [INFO ] [Nat]Absence check using 78 positive place invariants in 104 ms returned sat
[2020-06-03 06:58:01] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 26 ms returned sat
[2020-06-03 06:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:02] [INFO ] [Nat]Absence check using state equation in 1160 ms returned sat
[2020-06-03 06:58:03] [INFO ] Deduced a trap composed of 15 places in 374 ms
[2020-06-03 06:58:03] [INFO ] Deduced a trap composed of 13 places in 271 ms
[2020-06-03 06:58:03] [INFO ] Deduced a trap composed of 15 places in 259 ms
[2020-06-03 06:58:03] [INFO ] Deduced a trap composed of 8 places in 242 ms
[2020-06-03 06:58:04] [INFO ] Deduced a trap composed of 138 places in 245 ms
[2020-06-03 06:58:04] [INFO ] Deduced a trap composed of 33 places in 265 ms
[2020-06-03 06:58:04] [INFO ] Deduced a trap composed of 23 places in 281 ms
[2020-06-03 06:58:05] [INFO ] Deduced a trap composed of 24 places in 258 ms
[2020-06-03 06:58:05] [INFO ] Deduced a trap composed of 25 places in 236 ms
[2020-06-03 06:58:05] [INFO ] Deduced a trap composed of 23 places in 182 ms
[2020-06-03 06:58:05] [INFO ] Deduced a trap composed of 135 places in 232 ms
[2020-06-03 06:58:05] [INFO ] Deduced a trap composed of 16 places in 174 ms
[2020-06-03 06:58:06] [INFO ] Deduced a trap composed of 19 places in 191 ms
[2020-06-03 06:58:06] [INFO ] Deduced a trap composed of 26 places in 182 ms
[2020-06-03 06:58:06] [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 s82 s83 s87 s290 s291 s292 s300 s303 s345 s350 s374 s375 s376 s379 s380 s381 s390 s400 s405 s565 s566 s586 s587) 0)") while checking expression at index 0
[2020-06-03 06:58:06] [INFO ] [Real]Absence check using 78 positive place invariants in 81 ms returned sat
[2020-06-03 06:58:06] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2020-06-03 06:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:07] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2020-06-03 06:58:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:07] [INFO ] [Nat]Absence check using 78 positive place invariants in 72 ms returned sat
[2020-06-03 06:58:07] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2020-06-03 06:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:08] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2020-06-03 06:58:09] [INFO ] Deduced a trap composed of 13 places in 270 ms
[2020-06-03 06:58:09] [INFO ] Deduced a trap composed of 15 places in 268 ms
[2020-06-03 06:58:09] [INFO ] Deduced a trap composed of 15 places in 379 ms
[2020-06-03 06:58:10] [INFO ] Deduced a trap composed of 8 places in 255 ms
[2020-06-03 06:58:10] [INFO ] Deduced a trap composed of 19 places in 209 ms
[2020-06-03 06:58:10] [INFO ] Deduced a trap composed of 15 places in 213 ms
[2020-06-03 06:58:10] [INFO ] Deduced a trap composed of 33 places in 224 ms
[2020-06-03 06:58:11] [INFO ] Deduced a trap composed of 18 places in 246 ms
[2020-06-03 06:58:11] [INFO ] Deduced a trap composed of 29 places in 216 ms
[2020-06-03 06:58:11] [INFO ] Deduced a trap composed of 23 places in 248 ms
[2020-06-03 06:58:12] [INFO ] Deduced a trap composed of 15 places in 269 ms
[2020-06-03 06:58:12] [INFO ] Deduced a trap composed of 17 places in 228 ms
[2020-06-03 06:58:12] [INFO ] Deduced a trap composed of 31 places in 151 ms
[2020-06-03 06:58:12] [INFO ] Deduced a trap composed of 37 places in 129 ms
[2020-06-03 06:58:12] [INFO ] Deduced a trap composed of 21 places in 163 ms
[2020-06-03 06:58:12] [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 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s491 s492 s493 s495 s497 s498 s499 s672 s673) 0)") while checking expression at index 1
[2020-06-03 06:58:12] [INFO ] [Real]Absence check using 78 positive place invariants in 49 ms returned sat
[2020-06-03 06:58:13] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 46 ms returned sat
[2020-06-03 06:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:14] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2020-06-03 06:58:14] [INFO ] Deduced a trap composed of 8 places in 216 ms
[2020-06-03 06:58:14] [INFO ] Deduced a trap composed of 20 places in 360 ms
[2020-06-03 06:58:14] [INFO ] Deduced a trap composed of 15 places in 210 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 13 places in 199 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 13 places in 156 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 33 places in 129 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 16 places in 137 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 33 places in 98 ms
[2020-06-03 06:58:15] [INFO ] Deduced a trap composed of 42 places in 101 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 26 places in 95 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 43 places in 90 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 33 places in 87 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 35 places in 88 ms
[2020-06-03 06:58:16] [INFO ] Deduced a trap composed of 31 places in 75 ms
[2020-06-03 06:58:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2472 ms
[2020-06-03 06:58:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:16] [INFO ] [Nat]Absence check using 78 positive place invariants in 77 ms returned sat
[2020-06-03 06:58:16] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2020-06-03 06:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:17] [INFO ] [Nat]Absence check using state equation in 1020 ms returned sat
[2020-06-03 06:58:17] [INFO ] Deduced a trap composed of 12 places in 126 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 8 places in 149 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 15 places in 117 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 25 places in 136 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 31 places in 109 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 28 places in 127 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 41 places in 107 ms
[2020-06-03 06:58:18] [INFO ] Deduced a trap composed of 59 places in 108 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 69 places in 104 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 49 places in 125 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 52 places in 114 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 70 places in 102 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 34 places in 105 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 50 places in 109 ms
[2020-06-03 06:58:19] [INFO ] Deduced a trap composed of 121 places in 116 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 71 places in 114 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 105 places in 113 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 34 places in 164 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 30 places in 117 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 37 places in 101 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 42 places in 121 ms
[2020-06-03 06:58:20] [INFO ] Deduced a trap composed of 101 places in 103 ms
[2020-06-03 06:58:21] [INFO ] Deduced a trap composed of 115 places in 89 ms
[2020-06-03 06:58:21] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2020-06-03 06:58:21] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3385 ms
[2020-06-03 06:58:21] [INFO ] Computed and/alt/rep : 669/3234/669 causal constraints in 30 ms.
[2020-06-03 06:58:21] [INFO ] Added : 40 causal constraints over 8 iterations in 435 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 06:58:21] [INFO ] [Real]Absence check using 78 positive place invariants in 47 ms returned sat
[2020-06-03 06:58:21] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 26 ms returned sat
[2020-06-03 06:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:22] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2020-06-03 06:58:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:58:23] [INFO ] [Nat]Absence check using 78 positive place invariants in 90 ms returned unsat
[2020-06-03 06:58:23] [INFO ] [Real]Absence check using 78 positive place invariants in 53 ms returned sat
[2020-06-03 06:58:23] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 28 ms returned sat
[2020-06-03 06:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:24] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2020-06-03 06:58:24] [INFO ] Deduced a trap composed of 13 places in 249 ms
[2020-06-03 06:58:24] [INFO ] Deduced a trap composed of 146 places in 245 ms
[2020-06-03 06:58:25] [INFO ] Deduced a trap composed of 17 places in 232 ms
[2020-06-03 06:58:25] [INFO ] Deduced a trap composed of 151 places in 240 ms
[2020-06-03 06:58:25] [INFO ] Deduced a trap composed of 15 places in 191 ms
[2020-06-03 06:58:25] [INFO ] Deduced a trap composed of 8 places in 203 ms
[2020-06-03 06:58:26] [INFO ] Deduced a trap composed of 19 places in 256 ms
[2020-06-03 06:58:26] [INFO ] Deduced a trap composed of 24 places in 256 ms
[2020-06-03 06:58:26] [INFO ] Deduced a trap composed of 136 places in 248 ms
[2020-06-03 06:58:27] [INFO ] Deduced a trap composed of 21 places in 196 ms
[2020-06-03 06:58:27] [INFO ] Deduced a trap composed of 24 places in 182 ms
[2020-06-03 06:58:27] [INFO ] Deduced a trap composed of 17 places in 193 ms
[2020-06-03 06:58:27] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-06-03 06:58:27] [INFO ] Deduced a trap composed of 19 places in 182 ms
[2020-06-03 06:58:28] [INFO ] Deduced a trap composed of 16 places in 172 ms
[2020-06-03 06:58:28] [INFO ] Deduced a trap composed of 27 places in 176 ms
[2020-06-03 06:58:28] [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 s11 s12 s13 s14 s15 s234 s235 s236 s239 s240 s491 s492 s493 s497 s672 s673) 0)") while checking expression at index 4
[2020-06-03 06:58:28] [INFO ] [Real]Absence check using 78 positive place invariants in 60 ms returned sat
[2020-06-03 06:58:28] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2020-06-03 06:58:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:58:29] [INFO ] [Real]Absence check using state equation in 1042 ms returned sat
[2020-06-03 06:58:29] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2020-06-03 06:58:29] [INFO ] Deduced a trap composed of 15 places in 193 ms
[2020-06-03 06:58:30] [INFO ] Deduced a trap composed of 17 places in 191 ms
[2020-06-03 06:58:30] [INFO ] Deduced a trap composed of 30 places in 242 ms
[2020-06-03 06:58:30] [INFO ] Deduced a trap composed of 15 places in 187 ms
[2020-06-03 06:58:30] [INFO ] Deduced a trap composed of 33 places in 184 ms
[2020-06-03 06:58:31] [INFO ] Deduced a trap composed of 33 places in 182 ms
[2020-06-03 06:58:31] [INFO ] Deduced a trap composed of 155 places in 184 ms
[2020-06-03 06:58:31] [INFO ] Deduced a trap composed of 156 places in 187 ms
[2020-06-03 06:58:31] [INFO ] Deduced a trap composed of 23 places in 205 ms
[2020-06-03 06:58:31] [INFO ] Deduced a trap composed of 36 places in 185 ms
[2020-06-03 06:58:32] [INFO ] Deduced a trap composed of 23 places in 207 ms
[2020-06-03 06:58:32] [INFO ] Deduced a trap composed of 15 places in 212 ms
[2020-06-03 06:58:32] [INFO ] Deduced a trap composed of 30 places in 179 ms
[2020-06-03 06:58:32] [INFO ] Deduced a trap composed of 26 places in 178 ms
[2020-06-03 06:58:33] [INFO ] Deduced a trap composed of 27 places in 173 ms
[2020-06-03 06:58:33] [INFO ] Deduced a trap composed of 30 places in 175 ms
[2020-06-03 06:58:33] [INFO ] Deduced a trap composed of 165 places in 219 ms
[2020-06-03 06:58:33] [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 s42 s43 s57 s58 s61 s73 s78 s79 s119 s120 s121 s159 s160 s161 s165 s166 s167 s172 s174 s176 s186 s187 s201 s207 s210 s235 s236 s239 s240 s246 s247 s266 s267 s268 s278 s279 s280 s281 s345 s350 s360 s370 s374 s376 s380 s385 s390 s395 s405 s413 s415 s418 s431 s432 s433 s437 s446 s447 s448 s456 s458 s461 s463 s467 s472 s477 s482 s487 s497 s502 s511 s513 s516 s518 s522 s532 s537 s542 s546 s547 s548 s549 s550 s551 s552 s553 s554 s555 s556 s557 s558 s559 s560 s573 s574 s579 s580 s581 s582 s583 s586 s587 s588 s589 s593 s594 s597 s598 s599 s600 s609 s610 s627 s628 s629 s630 s631 s632 s633 s634 s639 s640 s644 s649 s653 s654 s655 s656 s659 s664 s665 s670 s671 s672 s673 s683 s684 s688 s689 s694 s695 s698 s699 s700 s701 s706 s707 s714 s715 s718 s719 s722 s723 s736 s752 s753) 0)") while checking expression at index 5
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 8 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 424 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 15 ms
Free SCC test removed 6 places
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 742 transition count 493
Reduce places removed 168 places and 0 transitions.
Iterating post reduction 1 with 168 rules applied. Total rules applied 346 place count 574 transition count 493
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 346 place count 574 transition count 380
Deduced a syphon composed of 113 places in 2 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 596 place count 437 transition count 380
Symmetric choice reduction at 2 with 94 rule applications. Total rules 690 place count 437 transition count 380
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 94 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 878 place count 343 transition count 286
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 878 place count 343 transition count 277
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 899 place count 331 transition count 277
Symmetric choice reduction at 2 with 1 rule applications. Total rules 900 place count 331 transition count 277
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 902 place count 330 transition count 276
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 1140 place count 210 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1142 place count 209 transition count 161
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1144 place count 209 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1146 place count 207 transition count 159
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1147 place count 207 transition count 159
Applied a total of 1147 rules in 210 ms. Remains 207 /757 variables (removed 550) and now considering 159/670 (removed 511) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/757 places, 159/670 transitions.
Finished random walk after 2260 steps, including 104 resets, run visited all 5 properties in 24 ms. (steps per millisecond=94 )
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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-19"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is BusinessProcesses-PT-19, 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 r182-oct2-158987914100598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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