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-162038177000219.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-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K 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.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.8K 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 157K 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-15-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620939054618

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:50:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:50:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:50:56] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2021-05-13 20:50:56] [INFO ] Transformed 630 places.
[2021-05-13 20:50:56] [INFO ] Transformed 566 transitions.
[2021-05-13 20:50:56] [INFO ] Found NUPN structural information;
[2021-05-13 20:50:56] [INFO ] Parsed PT model containing 630 places and 566 transitions in 159 ms.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 562 rows 626 cols
[2021-05-13 20:50:56] [INFO ] Computed 102 place invariants in 32 ms
[2021-05-13 20:50:56] [INFO ] [Real]Absence check using 61 positive place invariants in 54 ms returned sat
[2021-05-13 20:50:56] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2021-05-13 20:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:50:57] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2021-05-13 20:50:58] [INFO ] Deduced a trap composed of 12 places in 399 ms
[2021-05-13 20:50:58] [INFO ] Deduced a trap composed of 12 places in 325 ms
[2021-05-13 20:50:58] [INFO ] Deduced a trap composed of 128 places in 295 ms
[2021-05-13 20:50:59] [INFO ] Deduced a trap composed of 24 places in 281 ms
[2021-05-13 20:50:59] [INFO ] Deduced a trap composed of 25 places in 306 ms
[2021-05-13 20:50:59] [INFO ] Deduced a trap composed of 17 places in 324 ms
[2021-05-13 20:51:00] [INFO ] Deduced a trap composed of 11 places in 192 ms
[2021-05-13 20:51:00] [INFO ] Deduced a trap composed of 15 places in 217 ms
[2021-05-13 20:51:00] [INFO ] Deduced a trap composed of 40 places in 250 ms
[2021-05-13 20:51:00] [INFO ] Deduced a trap composed of 36 places in 243 ms
[2021-05-13 20:51:01] [INFO ] Deduced a trap composed of 18 places in 244 ms
[2021-05-13 20:51:01] [INFO ] Deduced a trap composed of 18 places in 249 ms
[2021-05-13 20:51:01] [INFO ] Deduced a trap composed of 116 places in 197 ms
[2021-05-13 20:51:01] [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 s34 s35 s50 s51 s54 s55 s59 s60 s61 s86 s87 s88 s157 s158 s162 s163 s164 s168 s170 s171 s195 s196 s197 s238 s239 s243 s244 s245 s255 s288 s298 s327 s337 s357 s361 s362 s363 s367 s371 s372 s373 s377 s382 s392 s396 s397 s398 s406 s408 s421 s423 s427 s431 s432 s433 s440 s442 s443 s444 s446 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s476 s477 s480 s481 s489 s490 s491 s492 s493 s494 s497 s498 s501 s502 s511 s512 s524 s525 s528 s529 s542 s543 s550 s551 s554 s555 s567 s568 s569 s570 s575 s576 s577 s578 s585 s586 s591) 0)") while checking expression at index 0
[2021-05-13 20:51:01] [INFO ] [Real]Absence check using 61 positive place invariants in 56 ms returned sat
[2021-05-13 20:51:01] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 36 ms returned sat
[2021-05-13 20:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:03] [INFO ] [Real]Absence check using state equation in 1080 ms returned sat
[2021-05-13 20:51:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:03] [INFO ] [Nat]Absence check using 61 positive place invariants in 68 ms returned sat
[2021-05-13 20:51:03] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 33 ms returned sat
[2021-05-13 20:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:04] [INFO ] [Nat]Absence check using state equation in 999 ms returned sat
[2021-05-13 20:51:04] [INFO ] Deduced a trap composed of 19 places in 300 ms
[2021-05-13 20:51:04] [INFO ] Deduced a trap composed of 15 places in 284 ms
[2021-05-13 20:51:05] [INFO ] Deduced a trap composed of 34 places in 268 ms
[2021-05-13 20:51:05] [INFO ] Deduced a trap composed of 22 places in 251 ms
[2021-05-13 20:51:05] [INFO ] Deduced a trap composed of 26 places in 246 ms
[2021-05-13 20:51:05] [INFO ] Deduced a trap composed of 19 places in 204 ms
[2021-05-13 20:51:06] [INFO ] Deduced a trap composed of 20 places in 208 ms
[2021-05-13 20:51:06] [INFO ] Deduced a trap composed of 29 places in 249 ms
[2021-05-13 20:51:06] [INFO ] Deduced a trap composed of 31 places in 164 ms
[2021-05-13 20:51:06] [INFO ] Deduced a trap composed of 31 places in 174 ms
[2021-05-13 20:51:07] [INFO ] Deduced a trap composed of 13 places in 237 ms
[2021-05-13 20:51:07] [INFO ] Deduced a trap composed of 16 places in 168 ms
[2021-05-13 20:51:07] [INFO ] Deduced a trap composed of 159 places in 214 ms
[2021-05-13 20:51:07] [INFO ] Deduced a trap composed of 27 places in 228 ms
[2021-05-13 20:51:08] [INFO ] Deduced a trap composed of 44 places in 240 ms
[2021-05-13 20:51:08] [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 s29 s32 s33 s34 s35 s54 s55 s224 s225 s226 s230 s231 s232 s251 s254 s297 s298 s299 s303 s318 s407 s412 s417 s422 s427 s432 s437 s442 s478 s479 s482 s561 s562 s565 s566 s569 s570 s583 s584 s587 s588) 0)") while checking expression at index 1
[2021-05-13 20:51:08] [INFO ] [Real]Absence check using 61 positive place invariants in 67 ms returned sat
[2021-05-13 20:51:08] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 30 ms returned sat
[2021-05-13 20:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:09] [INFO ] [Real]Absence check using state equation in 992 ms returned sat
[2021-05-13 20:51:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:09] [INFO ] [Nat]Absence check using 61 positive place invariants in 58 ms returned sat
[2021-05-13 20:51:09] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:10] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2021-05-13 20:51:10] [INFO ] Deduced a trap composed of 13 places in 341 ms
[2021-05-13 20:51:11] [INFO ] Deduced a trap composed of 135 places in 297 ms
[2021-05-13 20:51:11] [INFO ] Deduced a trap composed of 122 places in 279 ms
[2021-05-13 20:51:11] [INFO ] Deduced a trap composed of 12 places in 262 ms
[2021-05-13 20:51:11] [INFO ] Deduced a trap composed of 22 places in 248 ms
[2021-05-13 20:51:12] [INFO ] Deduced a trap composed of 23 places in 255 ms
[2021-05-13 20:51:12] [INFO ] Deduced a trap composed of 26 places in 244 ms
[2021-05-13 20:51:12] [INFO ] Deduced a trap composed of 138 places in 287 ms
[2021-05-13 20:51:13] [INFO ] Deduced a trap composed of 16 places in 301 ms
[2021-05-13 20:51:13] [INFO ] Deduced a trap composed of 128 places in 301 ms
[2021-05-13 20:51:13] [INFO ] Deduced a trap composed of 132 places in 293 ms
[2021-05-13 20:51:14] [INFO ] Deduced a trap composed of 32 places in 266 ms
[2021-05-13 20:51:14] [INFO ] Deduced a trap composed of 139 places in 324 ms
[2021-05-13 20:51:14] [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 s29 s32 s33 s34 s35 s36 s39 s40 s41 s42 s46 s47 s48 s56 s57 s58 s89 s90 s91 s92 s101 s102 s103 s109 s110 s111 s168 s170 s171 s195 s196 s197 s230 s231 s232 s238 s239 s251 s254 s292 s294 s297 s298 s299 s303 s308 s312 s314 s317 s319 s336 s338 s341 s342 s343 s346 s347 s348 s352 s356 s357 s358 s366 s367 s368 s372 s381 s382 s383 s387 s392 s397 s411 s413 s422 s431 s433 s446 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s480 s481 s482 s483 s484 s487 s488 s489 s490 s495 s496 s504 s506 s508 s510 s516 s534 s535 s542 s543 s546 s547 s550 s551 s561 s562 s563 s564 s565 s566 s571 s572 s579 s580 s581 s582 s585 s586 s587 s588 s589 s590 s591 s592 s596 s605 s611 s614) 0)") while checking expression at index 2
[2021-05-13 20:51:14] [INFO ] [Real]Absence check using 61 positive place invariants in 58 ms returned sat
[2021-05-13 20:51:14] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 37 ms returned sat
[2021-05-13 20:51:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:15] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2021-05-13 20:51:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:15] [INFO ] [Nat]Absence check using 61 positive place invariants in 67 ms returned sat
[2021-05-13 20:51:15] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 35 ms returned sat
[2021-05-13 20:51:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:16] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2021-05-13 20:51:17] [INFO ] Deduced a trap composed of 20 places in 313 ms
[2021-05-13 20:51:17] [INFO ] Deduced a trap composed of 20 places in 301 ms
[2021-05-13 20:51:17] [INFO ] Deduced a trap composed of 18 places in 295 ms
[2021-05-13 20:51:18] [INFO ] Deduced a trap composed of 11 places in 296 ms
[2021-05-13 20:51:18] [INFO ] Deduced a trap composed of 131 places in 282 ms
[2021-05-13 20:51:18] [INFO ] Deduced a trap composed of 30 places in 272 ms
[2021-05-13 20:51:18] [INFO ] Deduced a trap composed of 32 places in 254 ms
[2021-05-13 20:51:19] [INFO ] Deduced a trap composed of 17 places in 276 ms
[2021-05-13 20:51:19] [INFO ] Deduced a trap composed of 22 places in 255 ms
[2021-05-13 20:51:19] [INFO ] Deduced a trap composed of 29 places in 277 ms
[2021-05-13 20:51:20] [INFO ] Deduced a trap composed of 124 places in 266 ms
[2021-05-13 20:51:20] [INFO ] Deduced a trap composed of 22 places in 248 ms
[2021-05-13 20:51:20] [INFO ] Deduced a trap composed of 29 places in 245 ms
[2021-05-13 20:51: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 s3 s4 s5 s54 s55 s230 s231 s232 s238 s239 s240 s243 s244 s245 s317 s318 s319 s417 s422 s427 s431 s432 s433 s437 s565 s566) 0)") while checking expression at index 3
[2021-05-13 20:51:20] [INFO ] [Real]Absence check using 61 positive place invariants in 52 ms returned sat
[2021-05-13 20:51:20] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:21] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2021-05-13 20:51:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:21] [INFO ] [Nat]Absence check using 61 positive place invariants in 58 ms returned sat
[2021-05-13 20:51:21] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:22] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2021-05-13 20:51:23] [INFO ] Deduced a trap composed of 22 places in 282 ms
[2021-05-13 20:51:23] [INFO ] Deduced a trap composed of 13 places in 224 ms
[2021-05-13 20:51:23] [INFO ] Deduced a trap composed of 11 places in 229 ms
[2021-05-13 20:51:23] [INFO ] Deduced a trap composed of 23 places in 271 ms
[2021-05-13 20:51:24] [INFO ] Deduced a trap composed of 30 places in 294 ms
[2021-05-13 20:51:24] [INFO ] Deduced a trap composed of 113 places in 285 ms
[2021-05-13 20:51:24] [INFO ] Deduced a trap composed of 18 places in 253 ms
[2021-05-13 20:51:25] [INFO ] Deduced a trap composed of 23 places in 256 ms
[2021-05-13 20:51:25] [INFO ] Deduced a trap composed of 112 places in 225 ms
[2021-05-13 20:51:25] [INFO ] Deduced a trap composed of 110 places in 209 ms
[2021-05-13 20:51:25] [INFO ] Deduced a trap composed of 29 places in 250 ms
[2021-05-13 20:51:26] [INFO ] Deduced a trap composed of 19 places in 219 ms
[2021-05-13 20:51:26] [INFO ] Deduced a trap composed of 19 places in 174 ms
[2021-05-13 20:51:26] [INFO ] Deduced a trap composed of 118 places in 200 ms
[2021-05-13 20:51:26] [INFO ] Deduced a trap composed of 20 places in 233 ms
[2021-05-13 20:51:26] [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 s193 s401 s402 s403 s557 s558 s623) 0)") while checking expression at index 4
[2021-05-13 20:51:26] [INFO ] [Real]Absence check using 61 positive place invariants in 55 ms returned sat
[2021-05-13 20:51:26] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:27] [INFO ] [Real]Absence check using state equation in 949 ms returned sat
[2021-05-13 20:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:28] [INFO ] [Nat]Absence check using 61 positive place invariants in 54 ms returned sat
[2021-05-13 20:51:28] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 29 ms returned sat
[2021-05-13 20:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:28] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2021-05-13 20:51:29] [INFO ] Deduced a trap composed of 15 places in 267 ms
[2021-05-13 20:51:29] [INFO ] Deduced a trap composed of 132 places in 287 ms
[2021-05-13 20:51:29] [INFO ] Deduced a trap composed of 20 places in 292 ms
[2021-05-13 20:51:30] [INFO ] Deduced a trap composed of 18 places in 315 ms
[2021-05-13 20:51:30] [INFO ] Deduced a trap composed of 117 places in 283 ms
[2021-05-13 20:51:30] [INFO ] Deduced a trap composed of 22 places in 258 ms
[2021-05-13 20:51:30] [INFO ] Deduced a trap composed of 131 places in 233 ms
[2021-05-13 20:51:31] [INFO ] Deduced a trap composed of 17 places in 240 ms
[2021-05-13 20:51:31] [INFO ] Deduced a trap composed of 151 places in 251 ms
[2021-05-13 20:51:31] [INFO ] Deduced a trap composed of 17 places in 296 ms
[2021-05-13 20:51:32] [INFO ] Deduced a trap composed of 120 places in 315 ms
[2021-05-13 20:51:32] [INFO ] Deduced a trap composed of 26 places in 315 ms
[2021-05-13 20:51:32] [INFO ] Deduced a trap composed of 26 places in 266 ms
[2021-05-13 20:51:33] [INFO ] Deduced a trap composed of 23 places in 270 ms
[2021-05-13 20:51: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 s168 s173 s174 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s381 s382 s383 s390 s392 s393 s394) 0)") while checking expression at index 5
[2021-05-13 20:51:33] [INFO ] [Real]Absence check using 61 positive place invariants in 48 ms returned sat
[2021-05-13 20:51:33] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:34] [INFO ] [Real]Absence check using state equation in 872 ms returned sat
[2021-05-13 20:51:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:34] [INFO ] [Nat]Absence check using 61 positive place invariants in 44 ms returned sat
[2021-05-13 20:51:34] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2021-05-13 20:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:35] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2021-05-13 20:51:35] [INFO ] Deduced a trap composed of 11 places in 251 ms
[2021-05-13 20:51:35] [INFO ] Deduced a trap composed of 132 places in 318 ms
[2021-05-13 20:51:36] [INFO ] Deduced a trap composed of 16 places in 293 ms
[2021-05-13 20:51:36] [INFO ] Deduced a trap composed of 13 places in 242 ms
[2021-05-13 20:51:36] [INFO ] Deduced a trap composed of 27 places in 226 ms
[2021-05-13 20:51:36] [INFO ] Deduced a trap composed of 30 places in 291 ms
[2021-05-13 20:51:37] [INFO ] Deduced a trap composed of 39 places in 256 ms
[2021-05-13 20:51:37] [INFO ] Deduced a trap composed of 19 places in 218 ms
[2021-05-13 20:51:37] [INFO ] Deduced a trap composed of 117 places in 248 ms
[2021-05-13 20:51:37] [INFO ] Deduced a trap composed of 109 places in 284 ms
[2021-05-13 20:51:38] [INFO ] Deduced a trap composed of 114 places in 234 ms
[2021-05-13 20:51:38] [INFO ] Deduced a trap composed of 17 places in 232 ms
[2021-05-13 20:51:38] [INFO ] Deduced a trap composed of 23 places in 216 ms
[2021-05-13 20:51:38] [INFO ] Deduced a trap composed of 26 places in 207 ms
[2021-05-13 20:51:39] [INFO ] Deduced a trap composed of 36 places in 209 ms
[2021-05-13 20:51: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 s12 s13 s14 s15 s157 s158 s168 s170 s171 s175 s178 s179 s180 s366 s367 s368 s371 s372 s373 s377 s382 s387 s538 s539) 0)") while checking expression at index 6
[2021-05-13 20:51:39] [INFO ] [Real]Absence check using 61 positive place invariants in 38 ms returned sat
[2021-05-13 20:51:39] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2021-05-13 20:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:40] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2021-05-13 20:51:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 58 ms returned sat
[2021-05-13 20:51:40] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:41] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2021-05-13 20:51:41] [INFO ] Deduced a trap composed of 137 places in 346 ms
[2021-05-13 20:51:41] [INFO ] Deduced a trap composed of 19 places in 307 ms
[2021-05-13 20:51:42] [INFO ] Deduced a trap composed of 21 places in 302 ms
[2021-05-13 20:51:42] [INFO ] Deduced a trap composed of 12 places in 305 ms
[2021-05-13 20:51:42] [INFO ] Deduced a trap composed of 16 places in 296 ms
[2021-05-13 20:51:43] [INFO ] Deduced a trap composed of 25 places in 295 ms
[2021-05-13 20:51:43] [INFO ] Deduced a trap composed of 11 places in 241 ms
[2021-05-13 20:51:43] [INFO ] Deduced a trap composed of 150 places in 269 ms
[2021-05-13 20:51:43] [INFO ] Deduced a trap composed of 135 places in 288 ms
[2021-05-13 20:51:44] [INFO ] Deduced a trap composed of 21 places in 274 ms
[2021-05-13 20:51:44] [INFO ] Deduced a trap composed of 24 places in 256 ms
[2021-05-13 20:51:44] [INFO ] Deduced a trap composed of 135 places in 242 ms
[2021-05-13 20:51:45] [INFO ] Deduced a trap composed of 22 places in 244 ms
[2021-05-13 20:51:45] [INFO ] Deduced a trap composed of 34 places in 263 ms
[2021-05-13 20:51: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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s143 s144 s145 s159 s361 s362 s363 s367 s371 s372 s373 s377 s534 s535 s538 s539) 0)") while checking expression at index 7
Support contains 27 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 331 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 15 ms
Free SCC test removed 6 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1267 edges and 620 vertex of which 617 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.15 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 617 transition count 424
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 1 with 129 rules applied. Total rules applied 268 place count 488 transition count 424
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 268 place count 488 transition count 334
Deduced a syphon composed of 90 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 465 place count 381 transition count 334
Symmetric choice reduction at 2 with 73 rule applications. Total rules 538 place count 381 transition count 334
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 73 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 684 place count 308 transition count 261
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 684 place count 308 transition count 253
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 702 place count 298 transition count 253
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 880 place count 208 transition count 165
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 882 place count 207 transition count 169
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 884 place count 207 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 886 place count 205 transition count 167
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 890 place count 205 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 891 place count 204 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 892 place count 203 transition count 166
Applied a total of 892 rules in 182 ms. Remains 203 /626 variables (removed 423) and now considering 166/562 (removed 396) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/626 places, 166/562 transitions.
Incomplete random walk after 1000000 steps, including 18912 resets, run finished after 2469 ms. (steps per millisecond=405 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 7530 resets, run finished after 1524 ms. (steps per millisecond=656 ) properties seen :[0]
// Phase 1: matrix 166 rows 203 cols
[2021-05-13 20:51:49] [INFO ] Computed 78 place invariants in 3 ms
[2021-05-13 20:51:49] [INFO ] [Real]Absence check using 58 positive place invariants in 36 ms returned sat
[2021-05-13 20:51:49] [INFO ] [Real]Absence check using 58 positive and 20 generalized place invariants in 12 ms returned sat
[2021-05-13 20:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:49] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-13 20:51:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:49] [INFO ] [Nat]Absence check using 58 positive place invariants in 33 ms returned sat
[2021-05-13 20:51:49] [INFO ] [Nat]Absence check using 58 positive and 20 generalized place invariants in 11 ms returned sat
[2021-05-13 20:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:50] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-13 20:51:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-13 20:51:50] [INFO ] [Nat]Added 5 Read/Feed constraints in 7 ms returned sat
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 41 places in 95 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 43 places in 69 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 8 places in 89 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 49 places in 80 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 46 places in 82 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 42 places in 87 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 42 places in 67 ms
[2021-05-13 20:51:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 803 ms
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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-15"
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-15, 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-162038177000219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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