fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987914100566
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BusinessProcesses-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15724.510 3600000.00 79865.00 89.60 FTFFFFFFTFTFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.1K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 157K 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-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 1591164603312

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:10:05] [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:10:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:10:05] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2020-06-03 06:10:05] [INFO ] Transformed 630 places.
[2020-06-03 06:10:05] [INFO ] Transformed 566 transitions.
[2020-06-03 06:10:05] [INFO ] Found NUPN structural information;
[2020-06-03 06:10:05] [INFO ] Parsed PT model containing 630 places and 566 transitions in 137 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) 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 10000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) 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]
// Phase 1: matrix 562 rows 626 cols
[2020-06-03 06:10:05] [INFO ] Computed 102 place invariants in 28 ms
[2020-06-03 06:10:06] [INFO ] [Real]Absence check using 61 positive place invariants in 115 ms returned sat
[2020-06-03 06:10:06] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 32 ms returned sat
[2020-06-03 06:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:07] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2020-06-03 06:10:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:07] [INFO ] [Nat]Absence check using 61 positive place invariants in 320 ms returned sat
[2020-06-03 06:10:07] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 21 ms returned sat
[2020-06-03 06:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:08] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2020-06-03 06:10:09] [INFO ] Deduced a trap composed of 18 places in 421 ms
[2020-06-03 06:10:09] [INFO ] Deduced a trap composed of 13 places in 192 ms
[2020-06-03 06:10:09] [INFO ] Deduced a trap composed of 12 places in 328 ms
[2020-06-03 06:10:09] [INFO ] Deduced a trap composed of 17 places in 175 ms
[2020-06-03 06:10:10] [INFO ] Deduced a trap composed of 18 places in 185 ms
[2020-06-03 06:10:10] [INFO ] Deduced a trap composed of 12 places in 179 ms
[2020-06-03 06:10:10] [INFO ] Deduced a trap composed of 25 places in 213 ms
[2020-06-03 06:10:10] [INFO ] Deduced a trap composed of 123 places in 162 ms
[2020-06-03 06:10:10] [INFO ] Deduced a trap composed of 24 places in 264 ms
[2020-06-03 06:10:11] [INFO ] Deduced a trap composed of 28 places in 173 ms
[2020-06-03 06:10:11] [INFO ] Deduced a trap composed of 26 places in 614 ms
[2020-06-03 06:10:12] [INFO ] Deduced a trap composed of 30 places in 229 ms
[2020-06-03 06:10:12] [INFO ] Deduced a trap composed of 38 places in 139 ms
[2020-06-03 06:10:12] [INFO ] Deduced a trap composed of 138 places in 319 ms
[2020-06-03 06:10: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 s2 s30 s31 s34 s46 s47 s48 s59 s60 s61 s96 s110 s111 s122 s195 s196 s200 s218 s219 s220 s243 s244 s245 s251 s254 s292 s293 s294 s298 s302 s304 s312 s313 s314 s318 s323 s327 s337 s341 s342 s343 s362 s367 s372 s382 s392 s402 s412 s417 s422 s432 s437 s446 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s468 s469 s472 s473 s478 s479 s482 s483 s484 s489 s490 s491 s492 s497 s498 s501 s502 s504 s508 s509 s510 s513 s514 s515 s516 s517 s518 s519 s524 s525 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s544 s545 s546 s547 s550 s551 s559 s560 s561 s562 s565 s566 s567 s568 s573 s574 s577 s578 s579 s580 s583 s584 s589 s590 s591 s592 s593 s608 s617 s618 s619) 0)") while checking expression at index 0
[2020-06-03 06:10:12] [INFO ] [Real]Absence check using 61 positive place invariants in 53 ms returned sat
[2020-06-03 06:10:12] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:10:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:13] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2020-06-03 06:10:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:13] [INFO ] [Nat]Absence check using 61 positive place invariants in 43 ms returned sat
[2020-06-03 06:10:13] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2020-06-03 06:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:14] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2020-06-03 06:10:15] [INFO ] Deduced a trap composed of 20 places in 596 ms
[2020-06-03 06:10:15] [INFO ] Deduced a trap composed of 131 places in 532 ms
[2020-06-03 06:10:15] [INFO ] Deduced a trap composed of 20 places in 236 ms
[2020-06-03 06:10:16] [INFO ] Deduced a trap composed of 138 places in 216 ms
[2020-06-03 06:10:16] [INFO ] Deduced a trap composed of 136 places in 766 ms
[2020-06-03 06:10:17] [INFO ] Deduced a trap composed of 122 places in 223 ms
[2020-06-03 06:10:17] [INFO ] Deduced a trap composed of 137 places in 210 ms
[2020-06-03 06:10:17] [INFO ] Deduced a trap composed of 121 places in 188 ms
[2020-06-03 06:10:17] [INFO ] Deduced a trap composed of 124 places in 186 ms
[2020-06-03 06:10:18] [INFO ] Deduced a trap composed of 144 places in 256 ms
[2020-06-03 06:10:18] [INFO ] Deduced a trap composed of 23 places in 183 ms
[2020-06-03 06:10:18] [INFO ] Deduced a trap composed of 123 places in 205 ms
[2020-06-03 06:10:18] [INFO ] Deduced a trap composed of 129 places in 200 ms
[2020-06-03 06:10:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s41 s42 s43 s44 s45 s54 s55 s143 s144 s145 s168 s173 s174 s178 s179 s180 s184 s185 s186 s195 s196 s200 s206 s207 s208 s243 s244 s245 s251 s254 s288 s293 s297 s299 s303 s308 s313 s318 s332 s336 s337 s338 s341 s343 s356 s358 s361 s362 s363 s367 s372 s377 s382 s387 s402 s407 s426 s427 s428 s431 s432 s433 s446 s449 s450 s451 s452 s455 s456 s457 s458 s465 s466 s467 s476 s477 s478 s479 s482 s485 s486 s487 s488 s489 s490 s497 s498 s499 s500 s501 s502 s503 s507 s511 s512 s526 s527 s528 s529 s534 s535 s538 s539 s540 s541 s548 s549 s554 s555 s563 s564 s565 s566 s569 s570 s583 s584 s585 s586 s589 s590 s591 s594 s595 s609 s610) 0)") while checking expression at index 1
[2020-06-03 06:10:18] [INFO ] [Real]Absence check using 61 positive place invariants in 46 ms returned sat
[2020-06-03 06:10:18] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 26 ms returned sat
[2020-06-03 06:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:19] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2020-06-03 06:10:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:19] [INFO ] [Nat]Absence check using 61 positive place invariants in 42 ms returned sat
[2020-06-03 06:10:19] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 41 ms returned sat
[2020-06-03 06:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:20] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2020-06-03 06:10:20] [INFO ] Deduced a trap composed of 18 places in 217 ms
[2020-06-03 06:10:21] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2020-06-03 06:10:21] [INFO ] Deduced a trap composed of 27 places in 169 ms
[2020-06-03 06:10:21] [INFO ] Deduced a trap composed of 122 places in 189 ms
[2020-06-03 06:10:21] [INFO ] Deduced a trap composed of 16 places in 187 ms
[2020-06-03 06:10:21] [INFO ] Deduced a trap composed of 142 places in 185 ms
[2020-06-03 06:10:22] [INFO ] Deduced a trap composed of 30 places in 172 ms
[2020-06-03 06:10:22] [INFO ] Deduced a trap composed of 22 places in 197 ms
[2020-06-03 06:10:22] [INFO ] Deduced a trap composed of 12 places in 178 ms
[2020-06-03 06:10:22] [INFO ] Deduced a trap composed of 128 places in 186 ms
[2020-06-03 06:10:22] [INFO ] Deduced a trap composed of 20 places in 178 ms
[2020-06-03 06:10:23] [INFO ] Deduced a trap composed of 27 places in 189 ms
[2020-06-03 06:10:23] [INFO ] Deduced a trap composed of 17 places in 174 ms
[2020-06-03 06:10:23] [INFO ] Deduced a trap composed of 33 places in 179 ms
[2020-06-03 06:10:23] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-06-03 06:10:23] [INFO ] Deduced a trap composed of 32 places in 174 ms
[2020-06-03 06:10:24] [INFO ] Deduced a trap composed of 39 places in 147 ms
[2020-06-03 06:10:24] [INFO ] Deduced a trap composed of 122 places in 185 ms
[2020-06-03 06:10:24] [INFO ] Deduced a trap composed of 24 places in 138 ms
[2020-06-03 06:10:24] [INFO ] Deduced a trap composed of 31 places in 138 ms
[2020-06-03 06:10:24] [INFO ] Deduced a trap composed of 30 places in 155 ms
[2020-06-03 06:10:24] [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 s49 s50 s51 s52 s53 s54 s55 s238 s239 s240 s243 s244 s245 s417 s422 s427 s431 s432 s433 s437 s565 s566 s577 s578) 0)") while checking expression at index 2
[2020-06-03 06:10:24] [INFO ] [Real]Absence check using 61 positive place invariants in 33 ms returned sat
[2020-06-03 06:10:24] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:25] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2020-06-03 06:10:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:25] [INFO ] [Nat]Absence check using 61 positive place invariants in 52 ms returned sat
[2020-06-03 06:10:25] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 21 ms returned sat
[2020-06-03 06:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:26] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2020-06-03 06:10:26] [INFO ] Deduced a trap composed of 13 places in 183 ms
[2020-06-03 06:10:27] [INFO ] Deduced a trap composed of 12 places in 201 ms
[2020-06-03 06:10:27] [INFO ] Deduced a trap composed of 12 places in 197 ms
[2020-06-03 06:10:27] [INFO ] Deduced a trap composed of 19 places in 180 ms
[2020-06-03 06:10:27] [INFO ] Deduced a trap composed of 16 places in 192 ms
[2020-06-03 06:10:27] [INFO ] Deduced a trap composed of 18 places in 179 ms
[2020-06-03 06:10:28] [INFO ] Deduced a trap composed of 37 places in 231 ms
[2020-06-03 06:10:28] [INFO ] Deduced a trap composed of 118 places in 246 ms
[2020-06-03 06:10:28] [INFO ] Deduced a trap composed of 125 places in 195 ms
[2020-06-03 06:10:28] [INFO ] Deduced a trap composed of 117 places in 192 ms
[2020-06-03 06:10:29] [INFO ] Deduced a trap composed of 27 places in 208 ms
[2020-06-03 06:10:29] [INFO ] Deduced a trap composed of 31 places in 178 ms
[2020-06-03 06:10:29] [INFO ] Deduced a trap composed of 16 places in 172 ms
[2020-06-03 06:10:29] [INFO ] Deduced a trap composed of 24 places in 195 ms
[2020-06-03 06:10:29] [INFO ] Deduced a trap composed of 31 places in 155 ms
[2020-06-03 06:10:30] [INFO ] Deduced a trap composed of 35 places in 161 ms
[2020-06-03 06:10:30] [INFO ] Deduced a trap composed of 112 places in 197 ms
[2020-06-03 06:10:30] [INFO ] Deduced a trap composed of 24 places in 154 ms
[2020-06-03 06:10:30] [INFO ] Deduced a trap composed of 124 places in 175 ms
[2020-06-03 06:10:30] [INFO ] Deduced a trap composed of 28 places in 175 ms
[2020-06-03 06:10:30] [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 s238 s239 s240 s243 s244 s245 s317 s318 s319 s417 s422 s427 s431 s432 s433 s437 s565 s566 s577 s578) 0)") while checking expression at index 3
[2020-06-03 06:10:30] [INFO ] [Real]Absence check using 61 positive place invariants in 48 ms returned sat
[2020-06-03 06:10:30] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:10:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:31] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2020-06-03 06:10:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:31] [INFO ] [Nat]Absence check using 61 positive place invariants in 133 ms returned sat
[2020-06-03 06:10:31] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 21 ms returned sat
[2020-06-03 06:10:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:32] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2020-06-03 06:10:32] [INFO ] Deduced a trap composed of 19 places in 197 ms
[2020-06-03 06:10:33] [INFO ] Deduced a trap composed of 23 places in 209 ms
[2020-06-03 06:10:33] [INFO ] Deduced a trap composed of 12 places in 159 ms
[2020-06-03 06:10:33] [INFO ] Deduced a trap composed of 23 places in 199 ms
[2020-06-03 06:10:33] [INFO ] Deduced a trap composed of 155 places in 190 ms
[2020-06-03 06:10:33] [INFO ] Deduced a trap composed of 13 places in 181 ms
[2020-06-03 06:10:34] [INFO ] Deduced a trap composed of 20 places in 169 ms
[2020-06-03 06:10:34] [INFO ] Deduced a trap composed of 12 places in 131 ms
[2020-06-03 06:10:34] [INFO ] Deduced a trap composed of 22 places in 97 ms
[2020-06-03 06:10:34] [INFO ] Deduced a trap composed of 11 places in 117 ms
[2020-06-03 06:10:34] [INFO ] Deduced a trap composed of 32 places in 119 ms
[2020-06-03 06:10:34] [INFO ] Deduced a trap composed of 26 places in 110 ms
[2020-06-03 06:10:34] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-06-03 06:10:35] [INFO ] Deduced a trap composed of 24 places in 110 ms
[2020-06-03 06:10:35] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2020-06-03 06:10:35] [INFO ] Deduced a trap composed of 24 places in 105 ms
[2020-06-03 06:10:35] [INFO ] Deduced a trap composed of 22 places in 108 ms
[2020-06-03 06:10:35] [INFO ] Deduced a trap composed of 22 places in 104 ms
[2020-06-03 06:10:35] [INFO ] Deduced a trap composed of 18 places in 107 ms
[2020-06-03 06:10:35] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-06-03 06:10:35] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-06-03 06:10:36] [INFO ] Deduced a trap composed of 24 places in 111 ms
[2020-06-03 06:10:36] [INFO ] Deduced a trap composed of 33 places in 115 ms
[2020-06-03 06:10:36] [INFO ] Deduced a trap composed of 31 places in 105 ms
[2020-06-03 06:10:36] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3812 ms
[2020-06-03 06:10:36] [INFO ] Computed and/alt/rep : 561/2502/561 causal constraints in 35 ms.
[2020-06-03 06:10:36] [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 (=> (> t114 0) (and (> t549 0) (< o549 o114)))") while checking expression at index 4
[2020-06-03 06:10:36] [INFO ] [Real]Absence check using 61 positive place invariants in 51 ms returned sat
[2020-06-03 06:10:36] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-06-03 06:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:37] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2020-06-03 06:10:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:37] [INFO ] [Nat]Absence check using 61 positive place invariants in 41 ms returned sat
[2020-06-03 06:10:37] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-06-03 06:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:38] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2020-06-03 06:10:38] [INFO ] Deduced a trap composed of 23 places in 157 ms
[2020-06-03 06:10:38] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2020-06-03 06:10:39] [INFO ] Deduced a trap composed of 12 places in 229 ms
[2020-06-03 06:10:39] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2020-06-03 06:10:39] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-03 06:10:39] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-03 06:10:39] [INFO ] Deduced a trap composed of 18 places in 166 ms
[2020-06-03 06:10:40] [INFO ] Deduced a trap composed of 32 places in 187 ms
[2020-06-03 06:10:40] [INFO ] Deduced a trap composed of 26 places in 141 ms
[2020-06-03 06:10:40] [INFO ] Deduced a trap composed of 22 places in 127 ms
[2020-06-03 06:10:40] [INFO ] Deduced a trap composed of 17 places in 180 ms
[2020-06-03 06:10:40] [INFO ] Deduced a trap composed of 22 places in 162 ms
[2020-06-03 06:10:40] [INFO ] Deduced a trap composed of 24 places in 166 ms
[2020-06-03 06:10:41] [INFO ] Deduced a trap composed of 34 places in 136 ms
[2020-06-03 06:10:41] [INFO ] Deduced a trap composed of 25 places in 122 ms
[2020-06-03 06:10:41] [INFO ] Deduced a trap composed of 28 places in 135 ms
[2020-06-03 06:10:41] [INFO ] Deduced a trap composed of 32 places in 135 ms
[2020-06-03 06:10:41] [INFO ] Deduced a trap composed of 37 places in 124 ms
[2020-06-03 06:10:41] [INFO ] Deduced a trap composed of 28 places in 122 ms
[2020-06-03 06:10:42] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2020-06-03 06:10:42] [INFO ] Deduced a trap composed of 21 places in 99 ms
[2020-06-03 06:10:42] [INFO ] Deduced a trap composed of 47 places in 102 ms
[2020-06-03 06:10:42] [INFO ] Deduced a trap composed of 46 places in 115 ms
[2020-06-03 06:10:42] [INFO ] Deduced a trap composed of 53 places in 109 ms
[2020-06-03 06:10:42] [INFO ] Deduced a trap composed of 31 places in 100 ms
[2020-06-03 06:10:42] [INFO ] Deduced a trap composed of 36 places in 105 ms
[2020-06-03 06:10:42] [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 s36 s37 s38 s39 s40 s41 s42 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s361 s362 s363 s367 s372 s375 s377 s378 s379 s524 s525 s534 s535) 0)") while checking expression at index 5
[2020-06-03 06:10:42] [INFO ] [Real]Absence check using 61 positive place invariants in 51 ms returned sat
[2020-06-03 06:10:42] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:43] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2020-06-03 06:10:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:43] [INFO ] [Nat]Absence check using 61 positive place invariants in 38 ms returned sat
[2020-06-03 06:10:43] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 21 ms returned sat
[2020-06-03 06:10:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:44] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2020-06-03 06:10:44] [INFO ] Deduced a trap composed of 12 places in 237 ms
[2020-06-03 06:10:45] [INFO ] Deduced a trap composed of 21 places in 614 ms
[2020-06-03 06:10:45] [INFO ] Deduced a trap composed of 19 places in 176 ms
[2020-06-03 06:10:45] [INFO ] Deduced a trap composed of 118 places in 208 ms
[2020-06-03 06:10:46] [INFO ] Deduced a trap composed of 39 places in 174 ms
[2020-06-03 06:10:46] [INFO ] Deduced a trap composed of 34 places in 173 ms
[2020-06-03 06:10:46] [INFO ] Deduced a trap composed of 25 places in 189 ms
[2020-06-03 06:10:46] [INFO ] Deduced a trap composed of 35 places in 176 ms
[2020-06-03 06:10:47] [INFO ] Deduced a trap composed of 31 places in 509 ms
[2020-06-03 06:10:47] [INFO ] Deduced a trap composed of 20 places in 234 ms
[2020-06-03 06:10:47] [INFO ] Deduced a trap composed of 20 places in 200 ms
[2020-06-03 06:10:47] [INFO ] Deduced a trap composed of 21 places in 173 ms
[2020-06-03 06:10:48] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2020-06-03 06:10:48] [INFO ] Deduced a trap composed of 18 places in 213 ms
[2020-06-03 06:10:48] [INFO ] Deduced a trap composed of 41 places in 167 ms
[2020-06-03 06:10:48] [INFO ] Deduced a trap composed of 38 places in 218 ms
[2020-06-03 06:10:48] [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 s34 s35 s50 s51 s54 s190 s191 s192 s238 s239 s243 s244 s245 s251 s254 s287 s288 s289 s293 s303 s318 s407 s412 s426 s427 s428 s432 s437 s442 s561 s562 s569 s570 s573 s574) 0)") while checking expression at index 6
Support contains 23 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 339 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1267 edges and 620 vertex of which 618 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 618 transition count 421
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 276 place count 485 transition count 421
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 276 place count 485 transition count 331
Deduced a syphon composed of 90 places in 3 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 473 place count 378 transition count 331
Symmetric choice reduction at 2 with 71 rule applications. Total rules 544 place count 378 transition count 331
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 71 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 686 place count 307 transition count 260
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 686 place count 307 transition count 253
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 702 place count 298 transition count 253
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 886 place count 205 transition count 162
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 888 place count 204 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 890 place count 204 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 892 place count 202 transition count 164
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 897 place count 202 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 898 place count 201 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 899 place count 200 transition count 163
Applied a total of 899 rules in 184 ms. Remains 200 /626 variables (removed 426) and now considering 163/562 (removed 399) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/626 places, 163/562 transitions.
Incomplete random walk after 1000000 steps, including 18575 resets, run finished after 1994 ms. (steps per millisecond=501 ) properties seen :[0, 1, 1, 1, 1, 0, 1]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 8140 resets, run finished after 1169 ms. (steps per millisecond=855 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6216 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties seen :[0, 1]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 163 rows 200 cols
[2020-06-03 06:10:53] [INFO ] Computed 78 place invariants in 2 ms
[2020-06-03 06:10:53] [INFO ] [Real]Absence check using 59 positive place invariants in 144 ms returned sat
[2020-06-03 06:10:53] [INFO ] [Real]Absence check using 59 positive and 19 generalized place invariants in 7 ms returned sat
[2020-06-03 06:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:53] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2020-06-03 06:10:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:53] [INFO ] [Nat]Absence check using 59 positive place invariants in 47 ms returned sat
[2020-06-03 06:10:53] [INFO ] [Nat]Absence check using 59 positive and 19 generalized place invariants in 10 ms returned sat
[2020-06-03 06:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:53] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2020-06-03 06:10:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-03 06:10:53] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2020-06-03 06:10:53] [INFO ] Deduced a trap composed of 43 places in 71 ms
[2020-06-03 06:10:54] [INFO ] Deduced a trap composed of 43 places in 48 ms
[2020-06-03 06:10:54] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2020-06-03 06:10:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2020-06-03 06:10:54] [INFO ] Computed and/alt/rep : 159/605/159 causal constraints in 13 ms.
[2020-06-03 06:10:54] [INFO ] Added : 81 causal constraints over 17 iterations in 434 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
Incomplete Parikh walk after 10900 steps, including 779 resets, run finished after 27 ms. (steps per millisecond=403 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 163/163 transitions.
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 670 edges and 200 vertex of which 198 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 198 transition count 157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 193 transition count 157
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 193 transition count 153
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 22 place count 186 transition count 153
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 186 transition count 153
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 184 transition count 151
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 170 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 169 transition count 136
Applied a total of 57 rules in 20 ms. Remains 169 /200 variables (removed 31) and now considering 136/163 (removed 27) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/200 places, 136/163 transitions.
Incomplete random walk after 1000000 steps, including 28289 resets, run finished after 1740 ms. (steps per millisecond=574 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 17398 resets, run finished after 1559 ms. (steps per millisecond=641 ) properties seen :[0]
Finished probabilistic random walk after 309 steps, run visited all 1 properties in 13 ms. (steps per millisecond=23 )
Probabilistic random walk after 309 steps, saw 137 distinct states, run finished after 13 ms. (steps per millisecond=23 ) properties seen :[1]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-01 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-15"
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-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 r182-oct2-158987914100566"
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 ;