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-158897699200551.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-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200551
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.2K 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.3K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.4K 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 148K 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-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589254629336

[2020-05-12 03:37:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:37:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:37:10] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2020-05-12 03:37:10] [INFO ] Transformed 593 places.
[2020-05-12 03:37:10] [INFO ] Transformed 536 transitions.
[2020-05-12 03:37:10] [INFO ] Found NUPN structural information;
[2020-05-12 03:37:10] [INFO ] Parsed PT model containing 593 places and 536 transitions in 113 ms.
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 69 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 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 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 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 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 528 rows 585 cols
[2020-05-12 03:37:11] [INFO ] Computed 95 place invariants in 25 ms
[2020-05-12 03:37:11] [INFO ] [Real]Absence check using 57 positive place invariants in 45 ms returned sat
[2020-05-12 03:37:11] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:12] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2020-05-12 03:37:12] [INFO ] Deduced a trap composed of 35 places in 246 ms
[2020-05-12 03:37:12] [INFO ] Deduced a trap composed of 16 places in 164 ms
[2020-05-12 03:37:12] [INFO ] Deduced a trap composed of 17 places in 166 ms
[2020-05-12 03:37:13] [INFO ] Deduced a trap composed of 21 places in 186 ms
[2020-05-12 03:37:13] [INFO ] Deduced a trap composed of 25 places in 262 ms
[2020-05-12 03:37:13] [INFO ] Deduced a trap composed of 15 places in 186 ms
[2020-05-12 03:37:13] [INFO ] Deduced a trap composed of 124 places in 164 ms
[2020-05-12 03:37:14] [INFO ] Deduced a trap composed of 123 places in 186 ms
[2020-05-12 03:37:14] [INFO ] Deduced a trap composed of 12 places in 228 ms
[2020-05-12 03:37:14] [INFO ] Deduced a trap composed of 18 places in 155 ms
[2020-05-12 03:37:14] [INFO ] Deduced a trap composed of 12 places in 216 ms
[2020-05-12 03:37:15] [INFO ] Deduced a trap composed of 44 places in 436 ms
[2020-05-12 03:37:15] [INFO ] Deduced a trap composed of 36 places in 264 ms
[2020-05-12 03:37:15] [INFO ] Deduced a trap composed of 26 places in 205 ms
[2020-05-12 03:37:16] [INFO ] Deduced a trap composed of 128 places in 205 ms
[2020-05-12 03:37:16] [INFO ] Deduced a trap composed of 33 places in 222 ms
[2020-05-12 03:37:16] [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 s18 s19 s97 s355 s356 s357 s361 s371 s480 s481 s484 s485 s487 s488 s551) 0)") while checking expression at index 0
[2020-05-12 03:37:16] [INFO ] [Real]Absence check using 57 positive place invariants in 45 ms returned sat
[2020-05-12 03:37:16] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 20 ms returned sat
[2020-05-12 03:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:17] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2020-05-12 03:37:17] [INFO ] Deduced a trap composed of 14 places in 217 ms
[2020-05-12 03:37:17] [INFO ] Deduced a trap composed of 8 places in 183 ms
[2020-05-12 03:37:17] [INFO ] Deduced a trap composed of 18 places in 164 ms
[2020-05-12 03:37:18] [INFO ] Deduced a trap composed of 16 places in 168 ms
[2020-05-12 03:37:18] [INFO ] Deduced a trap composed of 21 places in 165 ms
[2020-05-12 03:37:18] [INFO ] Deduced a trap composed of 13 places in 159 ms
[2020-05-12 03:37:18] [INFO ] Deduced a trap composed of 35 places in 154 ms
[2020-05-12 03:37:19] [INFO ] Deduced a trap composed of 15 places in 617 ms
[2020-05-12 03:37:19] [INFO ] Deduced a trap composed of 17 places in 163 ms
[2020-05-12 03:37:19] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2020-05-12 03:37:19] [INFO ] Deduced a trap composed of 25 places in 158 ms
[2020-05-12 03:37:20] [INFO ] Deduced a trap composed of 24 places in 138 ms
[2020-05-12 03:37:20] [INFO ] Deduced a trap composed of 132 places in 144 ms
[2020-05-12 03:37:20] [INFO ] Deduced a trap composed of 22 places in 169 ms
[2020-05-12 03:37:20] [INFO ] Deduced a trap composed of 20 places in 325 ms
[2020-05-12 03:37:21] [INFO ] Deduced a trap composed of 121 places in 465 ms
[2020-05-12 03:37:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 03:37:21] [INFO ] Deduced a trap composed of 6 places in 489 ms
[2020-05-12 03:37:21] [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 s228) 0)") while checking expression at index 1
[2020-05-12 03:37:22] [INFO ] [Real]Absence check using 57 positive place invariants in 357 ms returned sat
[2020-05-12 03:37:22] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 03:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:23] [INFO ] [Real]Absence check using state equation in 1273 ms returned unsat
[2020-05-12 03:37:23] [INFO ] [Real]Absence check using 57 positive place invariants in 82 ms returned sat
[2020-05-12 03:37:23] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 49 ms returned sat
[2020-05-12 03:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:25] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2020-05-12 03:37:25] [INFO ] Deduced a trap composed of 8 places in 194 ms
[2020-05-12 03:37:25] [INFO ] Deduced a trap composed of 16 places in 221 ms
[2020-05-12 03:37:25] [INFO ] Deduced a trap composed of 14 places in 165 ms
[2020-05-12 03:37:25] [INFO ] Deduced a trap composed of 121 places in 201 ms
[2020-05-12 03:37:26] [INFO ] Deduced a trap composed of 15 places in 166 ms
[2020-05-12 03:37:26] [INFO ] Deduced a trap composed of 28 places in 175 ms
[2020-05-12 03:37:26] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2020-05-12 03:37:26] [INFO ] Deduced a trap composed of 15 places in 206 ms
[2020-05-12 03:37:27] [INFO ] Deduced a trap composed of 25 places in 345 ms
[2020-05-12 03:37:28] [INFO ] Deduced a trap composed of 34 places in 1423 ms
[2020-05-12 03:37:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s155 s157 s159 s161 s163 s164 s165 s166 s169 s172 s173 s174 s175 s179 s188 s194 s200 s237 s238 s239 s240 s241 s380 s381 s382 s385 s386 s387 s389 s391 s392 s393) 0)") while checking expression at index 3
[2020-05-12 03:37:28] [INFO ] [Real]Absence check using 57 positive place invariants in 39 ms returned sat
[2020-05-12 03:37:28] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:29] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2020-05-12 03:37:30] [INFO ] Deduced a trap composed of 14 places in 516 ms
[2020-05-12 03:37:30] [INFO ] Deduced a trap composed of 11 places in 474 ms
[2020-05-12 03:37:30] [INFO ] Deduced a trap composed of 21 places in 229 ms
[2020-05-12 03:37:31] [INFO ] Deduced a trap composed of 44 places in 353 ms
[2020-05-12 03:37:31] [INFO ] Deduced a trap composed of 22 places in 220 ms
[2020-05-12 03:37:31] [INFO ] Deduced a trap composed of 32 places in 266 ms
[2020-05-12 03:37:32] [INFO ] Deduced a trap composed of 32 places in 300 ms
[2020-05-12 03:37:32] [INFO ] Deduced a trap composed of 36 places in 216 ms
[2020-05-12 03:37:32] [INFO ] Deduced a trap composed of 128 places in 227 ms
[2020-05-12 03:37:32] [INFO ] Deduced a trap composed of 39 places in 194 ms
[2020-05-12 03:37:33] [INFO ] Deduced a trap composed of 144 places in 210 ms
[2020-05-12 03:37:33] [INFO ] Deduced a trap composed of 124 places in 203 ms
[2020-05-12 03:37:33] [INFO ] Deduced a trap composed of 28 places in 187 ms
[2020-05-12 03:37:34] [INFO ] Deduced a trap composed of 139 places in 1117 ms
[2020-05-12 03:37:34] [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 s32 s33 s41 s44 s45 s46 s47 s53 s54 s82 s83 s84 s85 s86 s87 s88 s89 s92 s93 s100 s101 s102 s122 s123 s124 s134 s135 s136 s152 s153 s154 s157 s175 s179 s237 s271 s275 s276 s277 s280 s282 s286 s291 s295 s296 s297 s300 s302 s306 s311 s321 s330 s332 s336 s341 s346 s350 s352 s361 s371 s381 s395 s396 s397 s400 s402 s409 s411 s412 s413 s415 s418 s419 s420 s421 s422 s423 s425 s426 s427 s430 s431 s432 s433 s460 s461 s470 s471 s476 s477 s482 s483 s484 s485 s487 s488 s489 s490 s495 s496 s507 s508 s513 s516 s517 s518 s520 s521 s522 s523 s526 s527 s528 s529 s530 s531 s532 s533 s538 s539 s540 s541 s542 s543 s544 s545 s546 s547 s550 s551 s559 s560 s570 s573 s574 s575 s579) 0)") while checking expression at index 4
[2020-05-12 03:37:34] [INFO ] [Real]Absence check using 57 positive place invariants in 39 ms returned sat
[2020-05-12 03:37:34] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 03:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:35] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2020-05-12 03:37:36] [INFO ] Deduced a trap composed of 8 places in 808 ms
[2020-05-12 03:37:36] [INFO ] Deduced a trap composed of 15 places in 255 ms
[2020-05-12 03:37:38] [INFO ] Deduced a trap composed of 18 places in 1342 ms
[2020-05-12 03:37:41] [INFO ] Deduced a trap composed of 15 places in 3173 ms
[2020-05-12 03:37:41] [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 s155 s390 s391 s392) 0)") while checking expression at index 5
[2020-05-12 03:37:41] [INFO ] [Real]Absence check using 57 positive place invariants in 66 ms returned unsat
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 24 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 311 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 16 ms
Free SCC test removed 6 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 573 transition count 395
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 258 place count 449 transition count 395
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 258 place count 449 transition count 317
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 169 rules applied. Total rules applied 427 place count 358 transition count 317
Symmetric choice reduction at 2 with 70 rule applications. Total rules 497 place count 358 transition count 317
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 637 place count 288 transition count 247
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 637 place count 288 transition count 241
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 651 place count 280 transition count 241
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 825 place count 192 transition count 155
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 827 place count 191 transition count 159
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 829 place count 191 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 831 place count 189 transition count 157
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 835 place count 189 transition count 157
Applied a total of 835 rules in 194 ms. Remains 189 /585 variables (removed 396) and now considering 157/528 (removed 371) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/585 places, 157/528 transitions.
Incomplete random walk after 1000000 steps, including 24826 resets, run finished after 2391 ms. (steps per millisecond=418 ) properties seen :[1, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5463 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties seen :[1, 0, 0]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 5868 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6357 resets, run finished after 1177 ms. (steps per millisecond=849 ) properties seen :[0, 0]
// Phase 1: matrix 157 rows 189 cols
[2020-05-12 03:37:47] [INFO ] Computed 73 place invariants in 4 ms
[2020-05-12 03:37:47] [INFO ] [Real]Absence check using 53 positive place invariants in 41 ms returned sat
[2020-05-12 03:37:47] [INFO ] [Real]Absence check using 53 positive and 20 generalized place invariants in 7 ms returned sat
[2020-05-12 03:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:47] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-05-12 03:37:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-05-12 03:37:47] [INFO ] [Real]Added 12 Read/Feed constraints in 4 ms returned sat
[2020-05-12 03:37:48] [INFO ] Deduced a trap composed of 5 places in 767 ms
[2020-05-12 03:37:48] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2020-05-12 03:37:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 836 ms
[2020-05-12 03:37:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:37:48] [INFO ] [Nat]Absence check using 53 positive place invariants in 51 ms returned sat
[2020-05-12 03:37:48] [INFO ] [Nat]Absence check using 53 positive and 20 generalized place invariants in 5 ms returned sat
[2020-05-12 03:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:48] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2020-05-12 03:37:48] [INFO ] [Nat]Added 12 Read/Feed constraints in 33 ms returned sat
[2020-05-12 03:37:48] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2020-05-12 03:37:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2020-05-12 03:37:48] [INFO ] Computed and/alt/rep : 155/2242/155 causal constraints in 83 ms.
[2020-05-12 03:37:49] [INFO ] Added : 65 causal constraints over 13 iterations in 503 ms. Result :unsat
[2020-05-12 03:37:49] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned sat
[2020-05-12 03:37:49] [INFO ] [Real]Absence check using 53 positive and 20 generalized place invariants in 6 ms returned sat
[2020-05-12 03:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:49] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-05-12 03:37:49] [INFO ] [Real]Added 12 Read/Feed constraints in 5 ms returned sat
[2020-05-12 03:37:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:37:49] [INFO ] [Nat]Absence check using 53 positive place invariants in 30 ms returned sat
[2020-05-12 03:37:49] [INFO ] [Nat]Absence check using 53 positive and 20 generalized place invariants in 9 ms returned sat
[2020-05-12 03:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:37:49] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-05-12 03:37:49] [INFO ] [Nat]Added 12 Read/Feed constraints in 14 ms returned sat
[2020-05-12 03:37:49] [INFO ] Deduced a trap composed of 5 places in 129 ms
[2020-05-12 03:37:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 137 ms
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1589254671494

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-13"
export BK_EXAMINATION="ReachabilityFireability"
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-13, examination is ReachabilityFireability"
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-158897699200551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;