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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:46 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.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 189K 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-19-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589258881859

[2020-05-12 04:48:04] [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 04:48:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:48:04] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2020-05-12 04:48:04] [INFO ] Transformed 772 places.
[2020-05-12 04:48:04] [INFO ] Transformed 685 transitions.
[2020-05-12 04:48:04] [INFO ] Found NUPN structural information;
[2020-05-12 04:48:04] [INFO ] Parsed PT model containing 772 places and 685 transitions in 346 ms.
Deduced a syphon composed of 15 places in 24 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 85 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 55 resets, run finished after 108 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 670 rows 757 cols
[2020-05-12 04:48:04] [INFO ] Computed 125 place invariants in 26 ms
[2020-05-12 04:48:05] [INFO ] [Real]Absence check using 78 positive place invariants in 201 ms returned sat
[2020-05-12 04:48:05] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 77 ms returned sat
[2020-05-12 04:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:07] [INFO ] [Real]Absence check using state equation in 1666 ms returned sat
[2020-05-12 04:48:08] [INFO ] Deduced a trap composed of 8 places in 535 ms
[2020-05-12 04:48:08] [INFO ] Deduced a trap composed of 17 places in 257 ms
[2020-05-12 04:48:08] [INFO ] Deduced a trap composed of 11 places in 417 ms
[2020-05-12 04:48:09] [INFO ] Deduced a trap composed of 24 places in 361 ms
[2020-05-12 04:48:10] [INFO ] Deduced a trap composed of 15 places in 739 ms
[2020-05-12 04:48:12] [INFO ] Deduced a trap composed of 6 places in 2343 ms
[2020-05-12 04:48: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 s3 s4 s295) 0)") while checking expression at index 0
[2020-05-12 04:48:12] [INFO ] [Real]Absence check using 78 positive place invariants in 33 ms returned unsat
[2020-05-12 04:48:12] [INFO ] [Real]Absence check using 78 positive place invariants in 68 ms returned unsat
[2020-05-12 04:48:12] [INFO ] [Real]Absence check using 78 positive place invariants in 54 ms returned sat
[2020-05-12 04:48:13] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 35 ms returned sat
[2020-05-12 04:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:14] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2020-05-12 04:48:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:48:14] [INFO ] [Nat]Absence check using 78 positive place invariants in 82 ms returned sat
[2020-05-12 04:48:14] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 31 ms returned sat
[2020-05-12 04:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:15] [INFO ] [Nat]Absence check using state equation in 1091 ms returned sat
[2020-05-12 04:48:15] [INFO ] Deduced a trap composed of 11 places in 337 ms
[2020-05-12 04:48:16] [INFO ] Deduced a trap composed of 8 places in 214 ms
[2020-05-12 04:48:16] [INFO ] Deduced a trap composed of 15 places in 216 ms
[2020-05-12 04:48:16] [INFO ] Deduced a trap composed of 13 places in 162 ms
[2020-05-12 04:48:16] [INFO ] Deduced a trap composed of 33 places in 177 ms
[2020-05-12 04:48:16] [INFO ] Deduced a trap composed of 26 places in 151 ms
[2020-05-12 04:48:17] [INFO ] Deduced a trap composed of 17 places in 163 ms
[2020-05-12 04:48:17] [INFO ] Deduced a trap composed of 22 places in 204 ms
[2020-05-12 04:48:17] [INFO ] Deduced a trap composed of 19 places in 298 ms
[2020-05-12 04:48:18] [INFO ] Deduced a trap composed of 16 places in 298 ms
[2020-05-12 04:48:18] [INFO ] Deduced a trap composed of 30 places in 302 ms
[2020-05-12 04:48:18] [INFO ] Deduced a trap composed of 24 places in 244 ms
[2020-05-12 04:48:19] [INFO ] Deduced a trap composed of 25 places in 776 ms
[2020-05-12 04:48:19] [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 s42 s43 s300 s303 s345 s350 s374 s375 s376 s379 s380 s381 s390 s400 s405 s586 s587 s593 s594 s718 s719 s726) 0)") while checking expression at index 3
[2020-05-12 04:48:19] [INFO ] [Real]Absence check using 78 positive place invariants in 107 ms returned sat
[2020-05-12 04:48:19] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2020-05-12 04:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:20] [INFO ] [Real]Absence check using state equation in 733 ms returned unsat
[2020-05-12 04:48:20] [INFO ] [Real]Absence check using 78 positive place invariants in 90 ms returned sat
[2020-05-12 04:48:20] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 55 ms returned sat
[2020-05-12 04:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:23] [INFO ] [Real]Absence check using state equation in 2238 ms returned sat
[2020-05-12 04:48:23] [INFO ] Deduced a trap composed of 11 places in 171 ms
[2020-05-12 04:48:23] [INFO ] Deduced a trap composed of 16 places in 158 ms
[2020-05-12 04:48:23] [INFO ] Deduced a trap composed of 31 places in 261 ms
[2020-05-12 04:48:23] [INFO ] Deduced a trap composed of 8 places in 139 ms
[2020-05-12 04:48:24] [INFO ] Deduced a trap composed of 21 places in 148 ms
[2020-05-12 04:48:25] [INFO ] Deduced a trap composed of 21 places in 1482 ms
[2020-05-12 04:48:25] [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 s37 s38 s39 s42 s43 s82 s83 s87 s300 s303 s350 s390 s399 s400 s401 s405 s718 s719) 0)") while checking expression at index 5
[2020-05-12 04:48:25] [INFO ] [Real]Absence check using 78 positive place invariants in 226 ms returned sat
[2020-05-12 04:48:25] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 64 ms returned sat
[2020-05-12 04:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:27] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2020-05-12 04:48:27] [INFO ] Deduced a trap composed of 20 places in 347 ms
[2020-05-12 04:48:27] [INFO ] Deduced a trap composed of 13 places in 297 ms
[2020-05-12 04:48:28] [INFO ] Deduced a trap composed of 8 places in 321 ms
[2020-05-12 04:48:28] [INFO ] Deduced a trap composed of 16 places in 317 ms
[2020-05-12 04:48:28] [INFO ] Deduced a trap composed of 11 places in 266 ms
[2020-05-12 04:48:29] [INFO ] Deduced a trap composed of 34 places in 266 ms
[2020-05-12 04:48:29] [INFO ] Deduced a trap composed of 16 places in 250 ms
[2020-05-12 04:48:29] [INFO ] Deduced a trap composed of 18 places in 257 ms
[2020-05-12 04:48:29] [INFO ] Deduced a trap composed of 26 places in 245 ms
[2020-05-12 04:48:30] [INFO ] Deduced a trap composed of 28 places in 195 ms
[2020-05-12 04:48:30] [INFO ] Deduced a trap composed of 30 places in 427 ms
[2020-05-12 04:48: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 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s446 s447 s448 s450 s452 s453 s454 s617 s618) 0)") while checking expression at index 6
[2020-05-12 04:48:31] [INFO ] [Real]Absence check using 78 positive place invariants in 302 ms returned sat
[2020-05-12 04:48:31] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 40 ms returned sat
[2020-05-12 04:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:34] [INFO ] [Real]Absence check using state equation in 3510 ms returned sat
[2020-05-12 04:48:35] [INFO ] Deduced a trap composed of 13 places in 466 ms
[2020-05-12 04:48:35] [INFO ] Deduced a trap composed of 8 places in 493 ms
[2020-05-12 04:48:36] [INFO ] Deduced a trap composed of 20 places in 602 ms
[2020-05-12 04:48: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 (> (+ s0 s1 s2 s290 s291 s292 s300 s303 s345 s350 s390 s399 s400 s401 s405 s565 s566 s593 s594 s726) 0)") while checking expression at index 7
[2020-05-12 04:48:37] [INFO ] [Real]Absence check using 78 positive place invariants in 526 ms returned sat
[2020-05-12 04:48:37] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 318 ms returned sat
[2020-05-12 04:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:40] [INFO ] [Real]Absence check using state equation in 3299 ms returned sat
[2020-05-12 04:48:41] [INFO ] Deduced a trap composed of 23 places in 573 ms
[2020-05-12 04:48: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 s11 s12 s13 s14 s15 s16 s17 s18 s216 s491 s492 s493) 0)") while checking expression at index 8
[2020-05-12 04:48:41] [INFO ] [Real]Absence check using 78 positive place invariants in 96 ms returned sat
[2020-05-12 04:48:41] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 78 ms returned sat
[2020-05-12 04:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:42] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2020-05-12 04:48:45] [INFO ] Deduced a trap composed of 11 places in 2784 ms
[2020-05-12 04:48:46] [INFO ] Deduced a trap composed of 16 places in 507 ms
[2020-05-12 04:48:47] [INFO ] Deduced a trap composed of 13 places in 787 ms
[2020-05-12 04:48:47] [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 s281 s394 s395 s396) 0)") while checking expression at index 9
[2020-05-12 04:48:47] [INFO ] [Real]Absence check using 78 positive place invariants in 206 ms returned sat
[2020-05-12 04:48:47] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 157 ms returned sat
[2020-05-12 04:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:48:52] [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: Broken pipe (= s601 (- t117 t118))") while checking expression at index 10
[2020-05-12 04:48:52] [INFO ] [Real]Absence check using 78 positive place invariants in 135 ms returned unsat
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 36 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.75 ms
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 748 transition count 553
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 233 place count 632 transition count 553
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 233 place count 632 transition count 397
Deduced a syphon composed of 156 places in 8 ms
Ensure Unique test removed 21 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 333 rules applied. Total rules applied 566 place count 455 transition count 397
Symmetric choice reduction at 2 with 93 rule applications. Total rules 659 place count 455 transition count 397
Deduced a syphon composed of 93 places in 2 ms
Reduce places removed 93 places and 93 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 845 place count 362 transition count 304
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 845 place count 362 transition count 297
Deduced a syphon composed of 7 places in 10 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 861 place count 353 transition count 297
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 1077 place count 244 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1079 place count 243 transition count 193
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1080 place count 243 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1081 place count 242 transition count 192
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 1086 place count 242 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1087 place count 241 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1088 place count 240 transition count 191
Applied a total of 1088 rules in 552 ms. Remains 240 /757 variables (removed 517) and now considering 191/670 (removed 479) transitions.
Finished structural reductions, in 1 iterations. Remains : 240/757 places, 191/670 transitions.
Incomplete random walk after 1000000 steps, including 52516 resets, run finished after 4191 ms. (steps per millisecond=238 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 13938 resets, run finished after 1094 ms. (steps per millisecond=914 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 13098 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties seen :[0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 12322 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 13569 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 191 rows 240 cols
[2020-05-12 04:49:01] [INFO ] Computed 91 place invariants in 45 ms
[2020-05-12 04:49:01] [INFO ] [Real]Absence check using 70 positive place invariants in 238 ms returned sat
[2020-05-12 04:49:01] [INFO ] [Real]Absence check using 70 positive and 21 generalized place invariants in 76 ms returned sat
[2020-05-12 04:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:49:02] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2020-05-12 04:49:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-12 04:49:03] [INFO ] [Real]Added 4 Read/Feed constraints in 40 ms returned sat
[2020-05-12 04:49:03] [INFO ] Computed and/alt/rep : 186/963/186 causal constraints in 31 ms.
[2020-05-12 04:49:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:49:03] [INFO ] [Nat]Absence check using 70 positive place invariants in 245 ms returned sat
[2020-05-12 04:49:03] [INFO ] [Nat]Absence check using 70 positive and 21 generalized place invariants in 86 ms returned sat
[2020-05-12 04:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:49:04] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2020-05-12 04:49:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 42 ms returned sat
[2020-05-12 04:49:04] [INFO ] Computed and/alt/rep : 186/963/186 causal constraints in 39 ms.
[2020-05-12 04:49:05] [INFO ] Added : 85 causal constraints over 18 iterations in 954 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-05-12 04:49:05] [INFO ] [Real]Absence check using 70 positive place invariants in 272 ms returned sat
[2020-05-12 04:49:05] [INFO ] [Real]Absence check using 70 positive and 21 generalized place invariants in 74 ms returned sat
[2020-05-12 04:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:49:06] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2020-05-12 04:49:06] [INFO ] [Real]Added 4 Read/Feed constraints in 41 ms returned sat
[2020-05-12 04:49:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:49:06] [INFO ] [Nat]Absence check using 70 positive place invariants in 123 ms returned sat
[2020-05-12 04:49:06] [INFO ] [Nat]Absence check using 70 positive and 21 generalized place invariants in 42 ms returned sat
[2020-05-12 04:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:49:08] [INFO ] [Nat]Absence check using state equation in 1222 ms returned sat
[2020-05-12 04:49:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 107 ms returned sat
[2020-05-12 04:49:08] [INFO ] Computed and/alt/rep : 186/963/186 causal constraints in 14 ms.
[2020-05-12 04:49:08] [INFO ] Added : 71 causal constraints over 15 iterations in 664 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-05-12 04:49:09] [INFO ] [Real]Absence check using 70 positive place invariants in 363 ms returned sat
[2020-05-12 04:49:09] [INFO ] [Real]Absence check using 70 positive and 21 generalized place invariants in 39 ms returned sat
[2020-05-12 04:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:49:10] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2020-05-12 04:49:10] [INFO ] [Real]Added 4 Read/Feed constraints in 13 ms returned sat
[2020-05-12 04:49:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:49:10] [INFO ] [Nat]Absence check using 70 positive place invariants in 242 ms returned sat
[2020-05-12 04:49:10] [INFO ] [Nat]Absence check using 70 positive and 21 generalized place invariants in 42 ms returned sat
[2020-05-12 04:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:49:11] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2020-05-12 04:49:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 40 ms returned sat
[2020-05-12 04:49:13] [INFO ] Deduced a trap composed of 55 places in 1620 ms
[2020-05-12 04:49:14] [INFO ] Deduced a trap composed of 61 places in 1407 ms
[2020-05-12 04:49:14] [INFO ] Deduced a trap composed of 55 places in 185 ms
[2020-05-12 04:49:15] [INFO ] Deduced a trap composed of 50 places in 154 ms
[2020-05-12 04:49:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3540 ms
[2020-05-12 04:49:15] [INFO ] Computed and/alt/rep : 186/963/186 causal constraints in 10 ms.
[2020-05-12 04:49:15] [INFO ] Added : 98 causal constraints over 20 iterations in 703 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-12 04:49:16] [INFO ] [Real]Absence check using 70 positive place invariants in 87 ms returned sat
[2020-05-12 04:49:16] [INFO ] [Real]Absence check using 70 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-12 04:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:49:16] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-05-12 04:49:16] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-05-12 04:49:16] [INFO ] Deduced a trap composed of 59 places in 81 ms
[2020-05-12 04:49:17] [INFO ] Deduced a trap composed of 56 places in 1103 ms
[2020-05-12 04:49:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1225 ms
[2020-05-12 04:49:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:49:17] [INFO ] [Nat]Absence check using 70 positive place invariants in 38 ms returned sat
[2020-05-12 04:49:17] [INFO ] [Nat]Absence check using 70 positive and 21 generalized place invariants in 7 ms returned sat
[2020-05-12 04:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:49:17] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2020-05-12 04:49:17] [INFO ] [Nat]Added 4 Read/Feed constraints in 9 ms returned sat
[2020-05-12 04:49:17] [INFO ] Deduced a trap composed of 56 places in 87 ms
[2020-05-12 04:49:17] [INFO ] Deduced a trap composed of 55 places in 73 ms
[2020-05-12 04:49:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2020-05-12 04:49:18] [INFO ] Computed and/alt/rep : 186/963/186 causal constraints in 10 ms.
[2020-05-12 04:49:18] [INFO ] Added : 83 causal constraints over 19 iterations in 627 ms. Result :sat
[2020-05-12 04:49:18] [INFO ] Deduced a trap composed of 53 places in 56 ms
[2020-05-12 04:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
Incomplete Parikh walk after 11800 steps, including 829 resets, run finished after 31 ms. (steps per millisecond=380 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 17300 steps, including 1000 resets, run finished after 71 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8900 steps, including 737 resets, run finished after 36 ms. (steps per millisecond=247 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 15300 steps, including 990 resets, run finished after 61 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 17 out of 240 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 240/240 places, 191/191 transitions.
Graph (trivial) has 23 edges and 240 vertex of which 4 / 240 are part of one of the 1 SCC in 33 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 237 transition count 180
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 18 place count 231 transition count 180
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 231 transition count 177
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 226 transition count 177
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 226 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 225 transition count 176
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 215 transition count 166
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 215 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 214 transition count 165
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 214 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 213 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 212 transition count 163
Applied a total of 55 rules in 83 ms. Remains 212 /240 variables (removed 28) and now considering 163/191 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/240 places, 163/191 transitions.
Incomplete random walk after 1000000 steps, including 36515 resets, run finished after 2224 ms. (steps per millisecond=449 ) properties seen :[1, 0, 1, 1]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 3779 steps, including 43 resets, run visited all 1 properties in 7 ms. (steps per millisecond=539 )
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589258961684

--------------------
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-19"
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-19, 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-158897699300599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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