Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000223.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 159K May 5 16:51 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-16-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620939181512

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:53:03] [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]
[2021-05-13 20:53:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:53:03] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-13 20:53:03] [INFO ] Transformed 638 places.
[2021-05-13 20:53:03] [INFO ] Transformed 578 transitions.
[2021-05-13 20:53:03] [INFO ] Found NUPN structural information;
[2021-05-13 20:53:03] [INFO ] Parsed PT model containing 638 places and 578 transitions in 125 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 570 rows 630 cols
[2021-05-13 20:53:03] [INFO ] Computed 100 place invariants in 27 ms
[2021-05-13 20:53:03] [INFO ] [Real]Absence check using 62 positive place invariants in 56 ms returned sat
[2021-05-13 20:53:03] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 28 ms returned sat
[2021-05-13 20:53:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:04] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2021-05-13 20:53:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:53:04] [INFO ] [Nat]Absence check using 62 positive place invariants in 99 ms returned sat
[2021-05-13 20:53:04] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 33 ms returned sat
[2021-05-13 20:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:05] [INFO ] [Nat]Absence check using state equation in 910 ms returned sat
[2021-05-13 20:53:06] [INFO ] Deduced a trap composed of 15 places in 362 ms
[2021-05-13 20:53:06] [INFO ] Deduced a trap composed of 16 places in 199 ms
[2021-05-13 20:53:06] [INFO ] Deduced a trap composed of 18 places in 186 ms
[2021-05-13 20:53:06] [INFO ] Deduced a trap composed of 17 places in 205 ms
[2021-05-13 20:53:07] [INFO ] Deduced a trap composed of 14 places in 193 ms
[2021-05-13 20:53:07] [INFO ] Deduced a trap composed of 11 places in 92 ms
[2021-05-13 20:53:07] [INFO ] Deduced a trap composed of 42 places in 109 ms
[2021-05-13 20:53:07] [INFO ] Deduced a trap composed of 42 places in 113 ms
[2021-05-13 20:53:07] [INFO ] Deduced a trap composed of 39 places in 110 ms
[2021-05-13 20:53:07] [INFO ] Deduced a trap composed of 44 places in 123 ms
[2021-05-13 20:53:07] [INFO ] Deduced a trap composed of 51 places in 156 ms
[2021-05-13 20:53:08] [INFO ] Deduced a trap composed of 32 places in 95 ms
[2021-05-13 20:53:08] [INFO ] Deduced a trap composed of 49 places in 94 ms
[2021-05-13 20:53:08] [INFO ] Deduced a trap composed of 44 places in 79 ms
[2021-05-13 20:53:08] [INFO ] Deduced a trap composed of 51 places in 75 ms
[2021-05-13 20:53:08] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2644 ms
[2021-05-13 20:53:08] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 37 ms.
[2021-05-13 20:53:09] [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 (=> (> t303 0) (and (> t302 0) (< o302 o303)))") while checking expression at index 0
[2021-05-13 20:53:09] [INFO ] [Real]Absence check using 62 positive place invariants in 56 ms returned sat
[2021-05-13 20:53:09] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2021-05-13 20:53:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:10] [INFO ] [Real]Absence check using state equation in 925 ms returned sat
[2021-05-13 20:53:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:53:10] [INFO ] [Nat]Absence check using 62 positive place invariants in 92 ms returned sat
[2021-05-13 20:53:10] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2021-05-13 20:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:11] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2021-05-13 20:53:12] [INFO ] Deduced a trap composed of 108 places in 266 ms
[2021-05-13 20:53:12] [INFO ] Deduced a trap composed of 8 places in 176 ms
[2021-05-13 20:53:12] [INFO ] Deduced a trap composed of 14 places in 185 ms
[2021-05-13 20:53:12] [INFO ] Deduced a trap composed of 17 places in 234 ms
[2021-05-13 20:53:13] [INFO ] Deduced a trap composed of 19 places in 193 ms
[2021-05-13 20:53:13] [INFO ] Deduced a trap composed of 42 places in 113 ms
[2021-05-13 20:53:13] [INFO ] Deduced a trap composed of 16 places in 156 ms
[2021-05-13 20:53:13] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2021-05-13 20:53:13] [INFO ] Deduced a trap composed of 23 places in 115 ms
[2021-05-13 20:53:13] [INFO ] Deduced a trap composed of 53 places in 119 ms
[2021-05-13 20:53:13] [INFO ] Deduced a trap composed of 52 places in 92 ms
[2021-05-13 20:53:14] [INFO ] Deduced a trap composed of 72 places in 113 ms
[2021-05-13 20:53:14] [INFO ] Deduced a trap composed of 79 places in 121 ms
[2021-05-13 20:53:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2301 ms
[2021-05-13 20:53:14] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 34 ms.
[2021-05-13 20:53:15] [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 (=> (> t263 0) (and (> t550 0) (< o550 o263)))") while checking expression at index 1
[2021-05-13 20:53:15] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2021-05-13 20:53:15] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 37 ms returned sat
[2021-05-13 20:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:16] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2021-05-13 20:53:17] [INFO ] Deduced a trap composed of 8 places in 325 ms
[2021-05-13 20:53:17] [INFO ] Deduced a trap composed of 14 places in 292 ms
[2021-05-13 20:53:17] [INFO ] Deduced a trap composed of 13 places in 273 ms
[2021-05-13 20:53:18] [INFO ] Deduced a trap composed of 19 places in 293 ms
[2021-05-13 20:53:18] [INFO ] Deduced a trap composed of 16 places in 284 ms
[2021-05-13 20:53:18] [INFO ] Deduced a trap composed of 12 places in 287 ms
[2021-05-13 20:53:18] [INFO ] Deduced a trap composed of 37 places in 258 ms
[2021-05-13 20:53:19] [INFO ] Deduced a trap composed of 44 places in 290 ms
[2021-05-13 20:53:19] [INFO ] Deduced a trap composed of 15 places in 266 ms
[2021-05-13 20:53:19] [INFO ] Deduced a trap composed of 127 places in 286 ms
[2021-05-13 20:53:20] [INFO ] Deduced a trap composed of 131 places in 262 ms
[2021-05-13 20:53:20] [INFO ] Deduced a trap composed of 16 places in 248 ms
[2021-05-13 20:53:20] [INFO ] Deduced a trap composed of 15 places in 249 ms
[2021-05-13 20:53:20] [INFO ] Deduced a trap composed of 21 places in 248 ms
[2021-05-13 20:53:20] [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 s67 s68 s232 s233 s234 s247 s250 s337 s338 s339 s343 s348 s438 s443 s583 s584 s591 s592) 0)") while checking expression at index 2
[2021-05-13 20:53:21] [INFO ] [Real]Absence check using 62 positive place invariants in 51 ms returned sat
[2021-05-13 20:53:21] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2021-05-13 20:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:21] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2021-05-13 20:53:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:53:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 65 ms returned sat
[2021-05-13 20:53:22] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2021-05-13 20:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:23] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2021-05-13 20:53:23] [INFO ] Deduced a trap composed of 21 places in 275 ms
[2021-05-13 20:53:23] [INFO ] Deduced a trap composed of 16 places in 255 ms
[2021-05-13 20:53:23] [INFO ] Deduced a trap composed of 8 places in 231 ms
[2021-05-13 20:53:24] [INFO ] Deduced a trap composed of 11 places in 215 ms
[2021-05-13 20:53:24] [INFO ] Deduced a trap composed of 16 places in 210 ms
[2021-05-13 20:53:24] [INFO ] Deduced a trap composed of 43 places in 214 ms
[2021-05-13 20:53:24] [INFO ] Deduced a trap composed of 18 places in 202 ms
[2021-05-13 20:53:25] [INFO ] Deduced a trap composed of 36 places in 199 ms
[2021-05-13 20:53:25] [INFO ] Deduced a trap composed of 122 places in 182 ms
[2021-05-13 20:53:25] [INFO ] Deduced a trap composed of 116 places in 171 ms
[2021-05-13 20:53:25] [INFO ] Deduced a trap composed of 49 places in 229 ms
[2021-05-13 20:53:26] [INFO ] Deduced a trap composed of 120 places in 235 ms
[2021-05-13 20:53:26] [INFO ] Deduced a trap composed of 126 places in 201 ms
[2021-05-13 20:53:26] [INFO ] Deduced a trap composed of 122 places in 203 ms
[2021-05-13 20:53:26] [INFO ] Deduced a trap composed of 121 places in 212 ms
[2021-05-13 20:53:26] [INFO ] Deduced a trap composed of 32 places in 191 ms
[2021-05-13 20:53:27] [INFO ] Deduced a trap composed of 120 places in 220 ms
[2021-05-13 20:53:27] [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 s44 s45 s47 s48 s51 s52 s60 s61 s63 s64 s67 s68 s86 s91 s92 s114 s115 s116 s125 s126 s127 s136 s137 s138 s166 s167 s168 s235 s238 s239 s240 s284 s286 s294 s296 s308 s328 s333 s338 s343 s348 s353 s357 s359 s362 s363 s364 s367 s368 s369 s373 s377 s378 s379 s383 s392 s393 s394 s403 s422 s423 s424 s427 s429 s432 s433 s434 s438 s443 s447 s450 s451 s452 s453 s456 s457 s458 s459 s471 s472 s473 s474 s475 s476 s486 s487 s488 s489 s501 s502 s505 s506 s507 s508 s509 s510 s513 s514 s519 s520 s540 s541 s544 s545 s548 s549 s579 s580 s583 s584 s587 s588 s595) 0)") while checking expression at index 3
[2021-05-13 20:53:27] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2021-05-13 20:53:27] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 32 ms returned sat
[2021-05-13 20:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:28] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2021-05-13 20:53:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:53:28] [INFO ] [Nat]Absence check using 62 positive place invariants in 68 ms returned sat
[2021-05-13 20:53:28] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 32 ms returned sat
[2021-05-13 20:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:29] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2021-05-13 20:53:29] [INFO ] Deduced a trap composed of 16 places in 305 ms
[2021-05-13 20:53:30] [INFO ] Deduced a trap composed of 15 places in 261 ms
[2021-05-13 20:53:30] [INFO ] Deduced a trap composed of 8 places in 247 ms
[2021-05-13 20:53:30] [INFO ] Deduced a trap composed of 17 places in 276 ms
[2021-05-13 20:53:30] [INFO ] Deduced a trap composed of 13 places in 264 ms
[2021-05-13 20:53:31] [INFO ] Deduced a trap composed of 42 places in 238 ms
[2021-05-13 20:53:31] [INFO ] Deduced a trap composed of 52 places in 238 ms
[2021-05-13 20:53:31] [INFO ] Deduced a trap composed of 62 places in 236 ms
[2021-05-13 20:53:31] [INFO ] Deduced a trap composed of 18 places in 184 ms
[2021-05-13 20:53:32] [INFO ] Deduced a trap composed of 23 places in 177 ms
[2021-05-13 20:53:32] [INFO ] Deduced a trap composed of 26 places in 174 ms
[2021-05-13 20:53:32] [INFO ] Deduced a trap composed of 37 places in 175 ms
[2021-05-13 20:53:32] [INFO ] Deduced a trap composed of 157 places in 173 ms
[2021-05-13 20:53:32] [INFO ] Deduced a trap composed of 152 places in 174 ms
[2021-05-13 20:53:33] [INFO ] Deduced a trap composed of 162 places in 245 ms
[2021-05-13 20:53:33] [INFO ] Deduced a trap composed of 160 places in 172 ms
[2021-05-13 20:53: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 s9 s10 s51 s52 s60 s61 s63 s64 s67 s81 s82 s86 s88 s89 s91 s92 s94 s95 s96 s97 s98 s99 s106 s107 s108 s109 s120 s121 s122 s136 s137 s138 s142 s143 s144 s154 s155 s156 s160 s161 s162 s169 s171 s172 s173 s180 s181 s182 s183 s186 s189 s190 s202 s203 s204 s238 s239 s240 s284 s285 s286 s290 s299 s303 s308 s318 s323 s327 s329 s333 s338 s343 s348 s353 s377 s379 s383 s393 s407 s408 s409 s418 s428 s438 s447 s448 s449 s450 s451 s452 s453 s457 s458 s459 s460 s461 s464 s465 s468 s469 s470 s475 s476 s477 s478 s479 s480 s481 s482 s483 s486 s487 s498 s499 s500 s505 s506 s507 s508 s517 s518 s519 s520 s527 s528 s532 s533 s538 s539 s542 s543 s544 s545 s546 s547 s556 s557 s563 s565 s575 s576 s583 s584 s587 s588 s593 s594 s595 s596 s618 s627) 0)") while checking expression at index 4
[2021-05-13 20:53:33] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2021-05-13 20:53:33] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2021-05-13 20:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:34] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2021-05-13 20:53:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:53:34] [INFO ] [Nat]Absence check using 62 positive place invariants in 91 ms returned sat
[2021-05-13 20:53:34] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2021-05-13 20:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:35] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2021-05-13 20:53:35] [INFO ] Deduced a trap composed of 12 places in 303 ms
[2021-05-13 20:53:36] [INFO ] Deduced a trap composed of 8 places in 273 ms
[2021-05-13 20:53:36] [INFO ] Deduced a trap composed of 17 places in 263 ms
[2021-05-13 20:53:36] [INFO ] Deduced a trap composed of 15 places in 269 ms
[2021-05-13 20:53:36] [INFO ] Deduced a trap composed of 16 places in 271 ms
[2021-05-13 20:53:37] [INFO ] Deduced a trap composed of 28 places in 246 ms
[2021-05-13 20:53:37] [INFO ] Deduced a trap composed of 19 places in 240 ms
[2021-05-13 20:53:37] [INFO ] Deduced a trap composed of 22 places in 246 ms
[2021-05-13 20:53:38] [INFO ] Deduced a trap composed of 20 places in 236 ms
[2021-05-13 20:53:38] [INFO ] Deduced a trap composed of 32 places in 248 ms
[2021-05-13 20:53:38] [INFO ] Deduced a trap composed of 143 places in 235 ms
[2021-05-13 20:53:38] [INFO ] Deduced a trap composed of 147 places in 231 ms
[2021-05-13 20:53:39] [INFO ] Deduced a trap composed of 24 places in 232 ms
[2021-05-13 20:53:39] [INFO ] Deduced a trap composed of 16 places in 228 ms
[2021-05-13 20:53:39] [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 s163 s322 s323 s324) 0)") while checking expression at index 5
[2021-05-13 20:53:39] [INFO ] [Real]Absence check using 62 positive place invariants in 55 ms returned sat
[2021-05-13 20:53:39] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2021-05-13 20:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:40] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2021-05-13 20:53:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:53:40] [INFO ] [Nat]Absence check using 62 positive place invariants in 91 ms returned sat
[2021-05-13 20:53:40] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 29 ms returned sat
[2021-05-13 20:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:41] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2021-05-13 20:53:41] [INFO ] Deduced a trap composed of 17 places in 287 ms
[2021-05-13 20:53:42] [INFO ] Deduced a trap composed of 8 places in 198 ms
[2021-05-13 20:53:42] [INFO ] Deduced a trap composed of 14 places in 297 ms
[2021-05-13 20:53:42] [INFO ] Deduced a trap composed of 19 places in 172 ms
[2021-05-13 20:53:42] [INFO ] Deduced a trap composed of 14 places in 138 ms
[2021-05-13 20:53:42] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2021-05-13 20:53:43] [INFO ] Deduced a trap composed of 87 places in 125 ms
[2021-05-13 20:53:43] [INFO ] Deduced a trap composed of 42 places in 112 ms
[2021-05-13 20:53:43] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2021-05-13 20:53:43] [INFO ] Deduced a trap composed of 37 places in 95 ms
[2021-05-13 20:53:43] [INFO ] Deduced a trap composed of 22 places in 58 ms
[2021-05-13 20:53:43] [INFO ] Deduced a trap composed of 29 places in 54 ms
[2021-05-13 20:53:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2112 ms
[2021-05-13 20:53:43] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 34 ms.
[2021-05-13 20:53:45] [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 (=> (> t149 0) (and (> t145 0) (< o145 o149)))") while checking expression at index 6
Support contains 15 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 352 edges and 630 vertex of which 7 / 630 are part of one of the 1 SCC in 25 ms
Free SCC test removed 6 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.13 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 618 transition count 420
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 292 place count 477 transition count 420
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 292 place count 477 transition count 333
Deduced a syphon composed of 87 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 189 rules applied. Total rules applied 481 place count 375 transition count 333
Symmetric choice reduction at 2 with 80 rule applications. Total rules 561 place count 375 transition count 333
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 80 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 721 place count 295 transition count 253
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 721 place count 295 transition count 245
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 740 place count 284 transition count 245
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 932 place count 187 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 934 place count 186 transition count 154
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 936 place count 186 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 938 place count 184 transition count 152
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 939 place count 184 transition count 152
Applied a total of 939 rules in 213 ms. Remains 184 /630 variables (removed 446) and now considering 152/570 (removed 418) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/630 places, 152/570 transitions.
Incomplete random walk after 1000000 steps, including 34068 resets, run finished after 2408 ms. (steps per millisecond=415 ) properties seen :[1, 1, 1, 1, 1, 1, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 12323 resets, run finished after 1197 ms. (steps per millisecond=835 ) properties seen :[0]
// Phase 1: matrix 152 rows 184 cols
[2021-05-13 20:53:49] [INFO ] Computed 75 place invariants in 3 ms
[2021-05-13 20:53:49] [INFO ] [Real]Absence check using 56 positive place invariants in 29 ms returned sat
[2021-05-13 20:53:49] [INFO ] [Real]Absence check using 56 positive and 19 generalized place invariants in 8 ms returned sat
[2021-05-13 20:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:49] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-13 20:53:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:53:49] [INFO ] [Nat]Absence check using 56 positive place invariants in 26 ms returned sat
[2021-05-13 20:53:49] [INFO ] [Nat]Absence check using 56 positive and 19 generalized place invariants in 7 ms returned sat
[2021-05-13 20:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:53:49] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-13 20:53:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-13 20:53:49] [INFO ] [Nat]Added 11 Read/Feed constraints in 58 ms returned sat
[2021-05-13 20:53:49] [INFO ] Computed and/alt/rep : 151/2723/151 causal constraints in 14 ms.
[2021-05-13 20:53:50] [INFO ] Added : 77 causal constraints over 16 iterations in 793 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
Incomplete Parikh walk after 4900 steps, including 166 resets, run finished after 40 ms. (steps per millisecond=122 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 184/184 places, 152/152 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 182 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 182 transition count 148
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 178 transition count 148
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 178 transition count 148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 177 transition count 147
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 33 place count 167 transition count 137
Applied a total of 33 rules in 34 ms. Remains 167 /184 variables (removed 17) and now considering 137/152 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/184 places, 137/152 transitions.
Incomplete random walk after 1000000 steps, including 41138 resets, run finished after 2490 ms. (steps per millisecond=401 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 15454 resets, run finished after 1270 ms. (steps per millisecond=787 ) properties seen :[0]
Finished probabilistic random walk after 11124 steps, run visited all 1 properties in 31 ms. (steps per millisecond=358 )
Probabilistic random walk after 11124 steps, saw 3123 distinct states, run finished after 31 ms. (steps per millisecond=358 ) properties seen :[1]
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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-16"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is BusinessProcesses-PT-16, 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 r037-tajo-162038177000223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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