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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 177K 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-18-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589257688274

[2020-05-12 04:28:09] [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:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:28:09] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2020-05-12 04:28:09] [INFO ] Transformed 717 places.
[2020-05-12 04:28:09] [INFO ] Transformed 642 transitions.
[2020-05-12 04:28:09] [INFO ] Found NUPN structural information;
[2020-05-12 04:28:09] [INFO ] Parsed PT model containing 717 places and 642 transitions in 119 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 52 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[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]
// Phase 1: matrix 627 rows 702 cols
[2020-05-12 04:28:09] [INFO ] Computed 114 place invariants in 24 ms
[2020-05-12 04:28:10] [INFO ] [Real]Absence check using 73 positive place invariants in 56 ms returned sat
[2020-05-12 04:28:10] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-05-12 04:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:11] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2020-05-12 04:28:11] [INFO ] Deduced a trap composed of 33 places in 260 ms
[2020-05-12 04:28:11] [INFO ] Deduced a trap composed of 17 places in 207 ms
[2020-05-12 04:28:11] [INFO ] Deduced a trap composed of 20 places in 222 ms
[2020-05-12 04:28:12] [INFO ] Deduced a trap composed of 16 places in 231 ms
[2020-05-12 04:28:12] [INFO ] Deduced a trap composed of 14 places in 203 ms
[2020-05-12 04:28:12] [INFO ] Deduced a trap composed of 22 places in 205 ms
[2020-05-12 04:28:12] [INFO ] Deduced a trap composed of 28 places in 209 ms
[2020-05-12 04:28:13] [INFO ] Deduced a trap composed of 33 places in 206 ms
[2020-05-12 04:28:13] [INFO ] Deduced a trap composed of 164 places in 207 ms
[2020-05-12 04:28:13] [INFO ] Deduced a trap composed of 22 places in 190 ms
[2020-05-12 04:28:13] [INFO ] Deduced a trap composed of 19 places in 196 ms
[2020-05-12 04:28:14] [INFO ] Deduced a trap composed of 27 places in 186 ms
[2020-05-12 04:28:14] [INFO ] Deduced a trap composed of 24 places in 196 ms
[2020-05-12 04:28:14] [INFO ] Deduced a trap composed of 25 places in 189 ms
[2020-05-12 04:28:14] [INFO ] Deduced a trap composed of 35 places in 277 ms
[2020-05-12 04:28:15] [INFO ] Deduced a trap composed of 41 places in 200 ms
[2020-05-12 04:28:15] [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 s204 s205 s213 s214 s224 s225 s226 s230 s231 s232 s233 s236 s237 s238 s441 s442 s443 s447 s452 s456 s457 s458 s462 s467 s472 s615 s616 s619) 0)") while checking expression at index 0
[2020-05-12 04:28:15] [INFO ] [Real]Absence check using 73 positive place invariants in 53 ms returned sat
[2020-05-12 04:28:15] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned unsat
[2020-05-12 04:28:15] [INFO ] [Real]Absence check using 73 positive place invariants in 47 ms returned sat
[2020-05-12 04:28:15] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 5 ms returned unsat
[2020-05-12 04:28:15] [INFO ] [Real]Absence check using 73 positive place invariants in 45 ms returned sat
[2020-05-12 04:28:15] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 04:28:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:16] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2020-05-12 04:28:16] [INFO ] Deduced a trap composed of 11 places in 181 ms
[2020-05-12 04:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2020-05-12 04:28:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:28:16] [INFO ] [Nat]Absence check using 73 positive place invariants in 62 ms returned sat
[2020-05-12 04:28:16] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-05-12 04:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:17] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2020-05-12 04:28:17] [INFO ] Deduced a trap composed of 11 places in 171 ms
[2020-05-12 04:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2020-05-12 04:28:17] [INFO ] Computed and/alt/rep : 626/2907/626 causal constraints in 33 ms.
[2020-05-12 04:28:19] [INFO ] Added : 230 causal constraints over 47 iterations in 1903 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-05-12 04:28:19] [INFO ] [Real]Absence check using 73 positive place invariants in 49 ms returned sat
[2020-05-12 04:28:19] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 25 ms returned sat
[2020-05-12 04:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:20] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2020-05-12 04:28:21] [INFO ] Deduced a trap composed of 14 places in 268 ms
[2020-05-12 04:28:21] [INFO ] Deduced a trap composed of 22 places in 212 ms
[2020-05-12 04:28:21] [INFO ] Deduced a trap composed of 24 places in 212 ms
[2020-05-12 04:28:21] [INFO ] Deduced a trap composed of 8 places in 212 ms
[2020-05-12 04:28:22] [INFO ] Deduced a trap composed of 34 places in 220 ms
[2020-05-12 04:28:22] [INFO ] Deduced a trap composed of 30 places in 204 ms
[2020-05-12 04:28:22] [INFO ] Deduced a trap composed of 28 places in 220 ms
[2020-05-12 04:28:22] [INFO ] Deduced a trap composed of 11 places in 218 ms
[2020-05-12 04:28:23] [INFO ] Deduced a trap composed of 32 places in 210 ms
[2020-05-12 04:28:23] [INFO ] Deduced a trap composed of 152 places in 211 ms
[2020-05-12 04:28:23] [INFO ] Deduced a trap composed of 28 places in 208 ms
[2020-05-12 04:28:23] [INFO ] Deduced a trap composed of 44 places in 198 ms
[2020-05-12 04:28:24] [INFO ] Deduced a trap composed of 150 places in 196 ms
[2020-05-12 04:28:24] [INFO ] Deduced a trap composed of 20 places in 185 ms
[2020-05-12 04:28:24] [INFO ] Deduced a trap composed of 53 places in 177 ms
[2020-05-12 04:28:24] [INFO ] Deduced a trap composed of 40 places in 189 ms
[2020-05-12 04:28:24] [INFO ] Deduced a trap composed of 33 places in 179 ms
[2020-05-12 04:28:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s80 s343 s344 s345) 0)") while checking expression at index 4
[2020-05-12 04:28:25] [INFO ] [Real]Absence check using 73 positive place invariants in 53 ms returned sat
[2020-05-12 04:28:25] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 31 ms returned sat
[2020-05-12 04:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:26] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2020-05-12 04:28:26] [INFO ] Deduced a trap composed of 18 places in 247 ms
[2020-05-12 04:28:26] [INFO ] Deduced a trap composed of 8 places in 245 ms
[2020-05-12 04:28:26] [INFO ] Deduced a trap composed of 122 places in 222 ms
[2020-05-12 04:28:27] [INFO ] Deduced a trap composed of 122 places in 223 ms
[2020-05-12 04:28:27] [INFO ] Deduced a trap composed of 122 places in 205 ms
[2020-05-12 04:28:27] [INFO ] Deduced a trap composed of 138 places in 198 ms
[2020-05-12 04:28:27] [INFO ] Deduced a trap composed of 135 places in 198 ms
[2020-05-12 04:28:28] [INFO ] Deduced a trap composed of 138 places in 198 ms
[2020-05-12 04:28:28] [INFO ] Deduced a trap composed of 133 places in 201 ms
[2020-05-12 04:28:28] [INFO ] Deduced a trap composed of 131 places in 257 ms
[2020-05-12 04:28:28] [INFO ] Deduced a trap composed of 37 places in 211 ms
[2020-05-12 04:28:29] [INFO ] Deduced a trap composed of 129 places in 213 ms
[2020-05-12 04:28:29] [INFO ] Deduced a trap composed of 127 places in 218 ms
[2020-05-12 04:28:29] [INFO ] Deduced a trap composed of 133 places in 212 ms
[2020-05-12 04:28:29] [INFO ] Deduced a trap composed of 123 places in 209 ms
[2020-05-12 04:28:30] [INFO ] Deduced a trap composed of 141 places in 207 ms
[2020-05-12 04:28: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 s42 s43 s44 s53 s54 s66 s67 s71 s72 s73 s83 s84 s85 s128 s130 s134 s140 s143 s146 s150 s159 s171 s183 s184 s185 s189 s190 s191 s204 s205 s213 s214 s242 s243 s244 s320 s324 s325 s326 s339 s344 s348 s352 s361 s362 s363 s367 s381 s383 s387 s391 s392 s393 s406 s407 s408 s411 s412 s413 s422 s431 s432 s433 s437 s442 s446 s447 s448 s461 s462 s463 s466 s467 s468 s476 s477 s478 s482 s486 s487 s488 s501 s502 s503 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s523 s524 s527 s528 s545 s546 s557 s558 s563 s564 s567 s568 s582 s585 s586 s587 s591 s592 s594 s595 s596 s597 s598 s599 s610 s611 s612 s613 s614 s622 s623 s632 s633 s654 s655 s656 s665 s666 s671 s672 s673 s693) 0)") while checking expression at index 5
[2020-05-12 04:28:30] [INFO ] [Real]Absence check using 73 positive place invariants in 47 ms returned sat
[2020-05-12 04:28:30] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-05-12 04:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:30] [INFO ] [Real]Absence check using state equation in 738 ms returned unsat
[2020-05-12 04:28:31] [INFO ] [Real]Absence check using 73 positive place invariants in 37 ms returned unsat
[2020-05-12 04:28:31] [INFO ] [Real]Absence check using 73 positive place invariants in 46 ms returned sat
[2020-05-12 04:28:31] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 04:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:32] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2020-05-12 04:28:32] [INFO ] Deduced a trap composed of 14 places in 186 ms
[2020-05-12 04:28:32] [INFO ] Deduced a trap composed of 28 places in 162 ms
[2020-05-12 04:28:32] [INFO ] Deduced a trap composed of 11 places in 350 ms
[2020-05-12 04:28:33] [INFO ] Deduced a trap composed of 14 places in 168 ms
[2020-05-12 04:28:33] [INFO ] Deduced a trap composed of 13 places in 172 ms
[2020-05-12 04:28:33] [INFO ] Deduced a trap composed of 19 places in 174 ms
[2020-05-12 04:28:33] [INFO ] Deduced a trap composed of 23 places in 167 ms
[2020-05-12 04:28:33] [INFO ] Deduced a trap composed of 26 places in 172 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 21 places in 91 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 22 places in 92 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 35 places in 97 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 39 places in 93 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 24 places in 102 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 34 places in 71 ms
[2020-05-12 04:28:34] [INFO ] Deduced a trap composed of 43 places in 74 ms
[2020-05-12 04:28:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2914 ms
[2020-05-12 04:28:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:28:35] [INFO ] [Nat]Absence check using 73 positive place invariants in 63 ms returned sat
[2020-05-12 04:28:35] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 24 ms returned sat
[2020-05-12 04:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:36] [INFO ] [Nat]Absence check using state equation in 947 ms returned sat
[2020-05-12 04:28:36] [INFO ] Deduced a trap composed of 19 places in 215 ms
[2020-05-12 04:28:36] [INFO ] Deduced a trap composed of 14 places in 205 ms
[2020-05-12 04:28:36] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2020-05-12 04:28:37] [INFO ] Deduced a trap composed of 22 places in 199 ms
[2020-05-12 04:28:37] [INFO ] Deduced a trap composed of 154 places in 201 ms
[2020-05-12 04:28:37] [INFO ] Deduced a trap composed of 24 places in 198 ms
[2020-05-12 04:28:37] [INFO ] Deduced a trap composed of 157 places in 177 ms
[2020-05-12 04:28:37] [INFO ] Deduced a trap composed of 12 places in 193 ms
[2020-05-12 04:28:38] [INFO ] Deduced a trap composed of 14 places in 183 ms
[2020-05-12 04:28:38] [INFO ] Deduced a trap composed of 145 places in 184 ms
[2020-05-12 04:28:38] [INFO ] Deduced a trap composed of 25 places in 177 ms
[2020-05-12 04:28:38] [INFO ] Deduced a trap composed of 34 places in 177 ms
[2020-05-12 04:28:38] [INFO ] Deduced a trap composed of 38 places in 175 ms
[2020-05-12 04:28:39] [INFO ] Deduced a trap composed of 144 places in 190 ms
[2020-05-12 04:28:39] [INFO ] Deduced a trap composed of 40 places in 175 ms
[2020-05-12 04:28:39] [INFO ] Deduced a trap composed of 146 places in 181 ms
[2020-05-12 04:28:39] [INFO ] Deduced a trap composed of 27 places in 170 ms
[2020-05-12 04:28:40] [INFO ] Deduced a trap composed of 44 places in 179 ms
[2020-05-12 04:28:40] [INFO ] Deduced a trap composed of 47 places in 170 ms
[2020-05-12 04:28:40] [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 s199 s202 s203 s204 s205 s230 s231 s232 s236 s237 s238 s265 s431 s432 s433 s446 s447 s448 s452 s457 s462 s467 s472 s477 s482 s492 s628 s629 s632 s633 s636 s637 s648 s649 s654 s655 s656 s669 s670) 0)") while checking expression at index 8
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 21000 steps, including 140 resets, run finished after 52 ms. (steps per millisecond=403 ) properties seen :[0, 1, 0, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 18 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 393 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 7 ms
Free SCC test removed 7 places
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Iterating post reduction 0 with 167 rules applied. Total rules applied 169 place count 686 transition count 459
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 326 place count 529 transition count 459
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 326 place count 529 transition count 360
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 544 place count 410 transition count 360
Symmetric choice reduction at 2 with 91 rule applications. Total rules 635 place count 410 transition count 360
Deduced a syphon composed of 91 places in 3 ms
Reduce places removed 91 places and 91 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 817 place count 319 transition count 269
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 817 place count 319 transition count 261
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 835 place count 309 transition count 261
Symmetric choice reduction at 2 with 1 rule applications. Total rules 836 place count 309 transition count 261
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 308 transition count 260
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 1042 place count 206 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1044 place count 205 transition count 161
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1045 place count 205 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1046 place count 204 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1047 place count 203 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1048 place count 202 transition count 159
Applied a total of 1048 rules in 116 ms. Remains 202 /702 variables (removed 500) and now considering 159/627 (removed 468) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/702 places, 159/627 transitions.
Incomplete random walk after 1000000 steps, including 39602 resets, run finished after 2178 ms. (steps per millisecond=459 ) properties seen :[1, 1, 0, 1]
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 17832 resets, run finished after 1425 ms. (steps per millisecond=701 ) properties seen :[0]
// Phase 1: matrix 159 rows 202 cols
[2020-05-12 04:28:43] [INFO ] Computed 83 place invariants in 2 ms
[2020-05-12 04:28:44] [INFO ] [Real]Absence check using 65 positive place invariants in 108 ms returned sat
[2020-05-12 04:28:44] [INFO ] [Real]Absence check using 65 positive and 18 generalized place invariants in 6 ms returned sat
[2020-05-12 04:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:28:44] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2020-05-12 04:28:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-12 04:28:44] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-05-12 04:28:44] [INFO ] Deduced a trap composed of 30 places in 62 ms
[2020-05-12 04:28:44] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2020-05-12 04:28:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 129 ms
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1589257724571

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

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