Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200542.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200542
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1589253634576

[2020-05-12 03:20:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 03:20:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:20:37] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2020-05-12 03:20:37] [INFO ] Transformed 586 places.
[2020-05-12 03:20:37] [INFO ] Transformed 525 transitions.
[2020-05-12 03:20:37] [INFO ] Found NUPN structural information;
[2020-05-12 03:20:37] [INFO ] Parsed PT model containing 586 places and 525 transitions in 139 ms.
Deduced a syphon composed of 4 places in 23 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 71 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 73 resets, run finished after 112 ms. (steps per millisecond=89 ) properties seen :[1, 0, 0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 521 rows 582 cols
[2020-05-12 03:20:37] [INFO ] Computed 98 place invariants in 39 ms
[2020-05-12 03:20:38] [INFO ] [Real]Absence check using 55 positive place invariants in 41 ms returned sat
[2020-05-12 03:20:38] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 34 ms returned sat
[2020-05-12 03:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:38] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2020-05-12 03:20:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:20:39] [INFO ] [Nat]Absence check using 55 positive place invariants in 117 ms returned sat
[2020-05-12 03:20:39] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 188 ms returned sat
[2020-05-12 03:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:40] [INFO ] [Nat]Absence check using state equation in 1067 ms returned sat
[2020-05-12 03:20:40] [INFO ] Deduced a trap composed of 124 places in 387 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 22 places in 262 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 16 places in 300 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 12 places in 214 ms
[2020-05-12 03:20:41] [INFO ] Deduced a trap composed of 18 places in 185 ms
[2020-05-12 03:20:42] [INFO ] Deduced a trap composed of 119 places in 199 ms
[2020-05-12 03:20:42] [INFO ] Deduced a trap composed of 21 places in 177 ms
[2020-05-12 03:20:42] [INFO ] Deduced a trap composed of 123 places in 276 ms
[2020-05-12 03:20:42] [INFO ] Deduced a trap composed of 26 places in 301 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 136 places in 231 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 25 places in 161 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 22 places in 263 ms
[2020-05-12 03:20:43] [INFO ] Deduced a trap composed of 29 places in 157 ms
[2020-05-12 03:20:44] [INFO ] Deduced a trap composed of 107 places in 258 ms
[2020-05-12 03:20:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s27 s28 s31 s32 s145 s151 s152 s154 s155 s191 s192 s193 s197 s198 s199 s209 s210 s211 s215 s216 s217 s223 s224 s240 s269 s270 s271 s279 s298 s299 s300 s309 s313 s314 s315 s324 s333 s334 s335 s339 s344 s349 s364 s384 s394 s399 s404 s407 s410 s411 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s437 s438 s439 s440 s441 s442 s443 s444 s449 s450 s451 s452 s474 s475 s478 s479 s480 s481 s484 s485 s490 s491 s498 s499 s502 s503 s506 s507 s509 s510 s511 s512 s523 s524 s527 s528 s539 s540 s541 s542 s543 s579) 0)") while checking expression at index 0
[2020-05-12 03:20:44] [INFO ] [Real]Absence check using 55 positive place invariants in 63 ms returned unsat
[2020-05-12 03:20:44] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-05-12 03:20:44] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:45] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2020-05-12 03:20:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:20:45] [INFO ] [Nat]Absence check using 55 positive place invariants in 38 ms returned sat
[2020-05-12 03:20:45] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:45] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 19 places in 187 ms
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 11 places in 556 ms
[2020-05-12 03:20:46] [INFO ] Deduced a trap composed of 118 places in 194 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 21 places in 189 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 32 places in 187 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 30 places in 145 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 33 places in 217 ms
[2020-05-12 03:20:47] [INFO ] Deduced a trap composed of 24 places in 157 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 39 places in 225 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 43 places in 272 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 49 places in 161 ms
[2020-05-12 03:20:48] [INFO ] Deduced a trap composed of 22 places in 157 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 21 places in 137 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 118 places in 138 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 21 places in 141 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 121 places in 139 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 119 places in 134 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 111 places in 138 ms
[2020-05-12 03:20:49] [INFO ] Deduced a trap composed of 117 places in 134 ms
[2020-05-12 03:20:50] [INFO ] Deduced a trap composed of 113 places in 136 ms
[2020-05-12 03:20:50] [INFO ] Deduced a trap composed of 115 places in 134 ms
[2020-05-12 03:20:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s66 s67 s68 s139 s140 s141 s145 s148 s149 s151 s152 s154 s155 s159 s160 s161 s171 s172 s173 s176 s177 s178 s179 s197 s198 s199 s215 s216 s217 s223 s224 s236 s239 s270 s284 s309 s313 s315 s324 s329 s334 s339 s344 s369 s378 s380 s384 s389 s394 s398 s399 s400 s404 s409 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s472 s473 s474 s475 s478 s479 s480 s481 s484 s485 s500 s501 s502 s503 s508 s513 s514 s519 s520 s521 s522 s523 s524 s539 s540 s543 s574 s575) 0)") while checking expression at index 2
[2020-05-12 03:20:50] [INFO ] [Real]Absence check using 55 positive place invariants in 41 ms returned sat
[2020-05-12 03:20:50] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 24 ms returned sat
[2020-05-12 03:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:51] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2020-05-12 03:20:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:20:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 54 ms returned sat
[2020-05-12 03:20:51] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned sat
[2020-05-12 03:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:51] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 10 places in 222 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 8 places in 189 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 11 places in 196 ms
[2020-05-12 03:20:52] [INFO ] Deduced a trap composed of 14 places in 150 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 24 places in 226 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 28 places in 169 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 21 places in 156 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 11 places in 188 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 18 places in 152 ms
[2020-05-12 03:20:53] [INFO ] Deduced a trap composed of 21 places in 141 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 23 places in 146 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 17 places in 178 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 105 places in 160 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 146 places in 135 ms
[2020-05-12 03:20:54] [INFO ] Deduced a trap composed of 134 places in 141 ms
[2020-05-12 03:20:55] [INFO ] Deduced a trap composed of 31 places in 168 ms
[2020-05-12 03:20:55] [INFO ] Deduced a trap composed of 19 places in 152 ms
[2020-05-12 03:20:55] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-05-12 03:20:55] [INFO ] Deduced a trap composed of 21 places in 139 ms
[2020-05-12 03:20:55] [INFO ] Deduced a trap composed of 30 places in 148 ms
[2020-05-12 03:20:55] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2020-05-12 03:20:56] [INFO ] Deduced a trap composed of 33 places in 185 ms
[2020-05-12 03:20:56] [INFO ] Deduced a trap composed of 17 places in 116 ms
[2020-05-12 03:20:56] [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 s174 s368 s369 s370) 0)") while checking expression at index 3
[2020-05-12 03:20:56] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2020-05-12 03:20:56] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:56] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2020-05-12 03:20:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:20:57] [INFO ] [Nat]Absence check using 55 positive place invariants in 92 ms returned sat
[2020-05-12 03:20:57] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:20:57] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2020-05-12 03:20:57] [INFO ] Deduced a trap composed of 13 places in 145 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 19 places in 152 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 23 places in 145 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 137 places in 141 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 15 places in 149 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 13 places in 141 ms
[2020-05-12 03:20:58] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2020-05-12 03:20:59] [INFO ] Deduced a trap composed of 11 places in 141 ms
[2020-05-12 03:20:59] [INFO ] Deduced a trap composed of 111 places in 139 ms
[2020-05-12 03:20:59] [INFO ] Deduced a trap composed of 144 places in 144 ms
[2020-05-12 03:20:59] [INFO ] Deduced a trap composed of 40 places in 134 ms
[2020-05-12 03:20:59] [INFO ] Deduced a trap composed of 42 places in 147 ms
[2020-05-12 03:20:59] [INFO ] Deduced a trap composed of 27 places in 132 ms
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 26 places in 137 ms
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 30 places in 130 ms
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 47 places in 145 ms
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 34 places in 134 ms
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 23 places in 196 ms
[2020-05-12 03:21:00] [INFO ] Deduced a trap composed of 32 places in 157 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 49 places in 138 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 38 places in 127 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 126 places in 145 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 137 places in 140 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 130 places in 135 ms
[2020-05-12 03:21:01] [INFO ] Deduced a trap composed of 138 places in 133 ms
[2020-05-12 03:21:02] [INFO ] Deduced a trap composed of 139 places in 170 ms
[2020-05-12 03:21:02] [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 s69 s73 s77 s84 s85 s86 s87 s88 s102 s111 s139 s140 s141 s159 s160 s161 s165 s166 s167 s176 s177 s185 s203 s204 s205 s223 s224 s225 s270 s284 s294 s299 s309 s329 s339 s344 s364 s388 s389 s390 s399 s409 s413 s414 s415 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s428 s429 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s451 s452 s453 s454 s457 s458 s461 s462 s463 s464 s465 s466 s472 s473 s474 s475 s478 s479 s480 s481 s482 s483 s484 s485 s490 s491 s492 s493 s494 s495 s500 s501 s506 s507 s511 s512 s513 s514 s519 s520 s523 s524 s525 s526 s529 s530 s531 s532 s537 s538 s539 s540 s543 s551 s552 s553 s560 s561 s562) 0)") while checking expression at index 4
[2020-05-12 03:21:02] [INFO ] [Real]Absence check using 55 positive place invariants in 54 ms returned sat
[2020-05-12 03:21:02] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:02] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2020-05-12 03:21:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:21:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 38 ms returned sat
[2020-05-12 03:21:03] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 37 ms returned sat
[2020-05-12 03:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:03] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2020-05-12 03:21:03] [INFO ] Deduced a trap composed of 12 places in 85 ms
[2020-05-12 03:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2020-05-12 03:21:03] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 25 ms.
[2020-05-12 03:21:05] [INFO ] Added : 155 causal constraints over 32 iterations in 1439 ms. Result :sat
[2020-05-12 03:21:05] [INFO ] Deduced a trap composed of 42 places in 92 ms
[2020-05-12 03:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 13400 steps, including 126 resets, run finished after 32 ms. (steps per millisecond=418 ) properties seen :[0, 0, 1, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 326 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 36 ms
Free SCC test removed 6 places
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Iterating post reduction 0 with 135 rules applied. Total rules applied 137 place count 572 transition count 385
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 1 with 127 rules applied. Total rules applied 264 place count 445 transition count 385
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 264 place count 445 transition count 295
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 461 place count 338 transition count 295
Symmetric choice reduction at 2 with 70 rule applications. Total rules 531 place count 338 transition count 295
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 70 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 671 place count 268 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 671 place count 268 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 682 place count 262 transition count 220
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 3 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 179 rules applied. Total rules applied 861 place count 171 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 863 place count 170 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 865 place count 170 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 867 place count 168 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 868 place count 168 transition count 134
Applied a total of 868 rules in 169 ms. Remains 168 /582 variables (removed 414) and now considering 134/521 (removed 387) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/582 places, 134/521 transitions.
Finished random walk after 586 steps, including 23 resets, run visited all 3 properties in 4 ms. (steps per millisecond=146 )
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589253665868

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699200542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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