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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 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.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:37 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 91K 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-08-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589251577533

[2020-05-12 02:46:18] [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 02:46:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:46:18] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-05-12 02:46:18] [INFO ] Transformed 393 places.
[2020-05-12 02:46:18] [INFO ] Transformed 344 transitions.
[2020-05-12 02:46:18] [INFO ] Found NUPN structural information;
[2020-05-12 02:46:18] [INFO ] Parsed PT model containing 393 places and 344 transitions in 93 ms.
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 80 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1]
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 331 rows 380 cols
[2020-05-12 02:46:19] [INFO ] Computed 58 place invariants in 12 ms
[2020-05-12 02:46:19] [INFO ] [Real]Absence check using 44 positive place invariants in 32 ms returned sat
[2020-05-12 02:46:19] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-12 02:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:19] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-05-12 02:46:19] [INFO ] Deduced a trap composed of 28 places in 112 ms
[2020-05-12 02:46:19] [INFO ] Deduced a trap composed of 12 places in 76 ms
[2020-05-12 02:46:19] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2020-05-12 02:46:19] [INFO ] Deduced a trap composed of 35 places in 52 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 21 places in 53 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 53 places in 56 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 55 places in 44 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 33 places in 49 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 53 places in 50 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 52 places in 60 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 54 places in 47 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 58 places in 56 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 31 places in 46 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 34 places in 60 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 57 places in 336 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 57 places in 63 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 44 places in 58 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 63 places in 57 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 70 places in 57 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 50 places in 41 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 46 places in 46 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 53 places in 50 ms
[2020-05-12 02:46:21] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2075 ms
[2020-05-12 02:46:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:21] [INFO ] [Nat]Absence check using 44 positive place invariants in 60 ms returned sat
[2020-05-12 02:46:21] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-12 02:46:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:22] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2020-05-12 02:46:22] [INFO ] Deduced a trap composed of 12 places in 96 ms
[2020-05-12 02:46:22] [INFO ] Deduced a trap composed of 26 places in 268 ms
[2020-05-12 02:46:23] [INFO ] Deduced a trap composed of 26 places in 744 ms
[2020-05-12 02:46:23] [INFO ] Deduced a trap composed of 25 places in 368 ms
[2020-05-12 02:46:23] [INFO ] Deduced a trap composed of 33 places in 52 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 16 places in 54 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 40 places in 72 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 19 places in 50 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 58 places in 68 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 58 places in 47 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 52 places in 43 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 38 places in 63 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 19 places in 51 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 44 places in 50 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 24 places in 47 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 47 places in 47 ms
[2020-05-12 02:46:25] [INFO ] Deduced a trap composed of 50 places in 46 ms
[2020-05-12 02:46:25] [INFO ] Deduced a trap composed of 60 places in 46 ms
[2020-05-12 02:46:25] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2737 ms
[2020-05-12 02:46:25] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 19 ms.
[2020-05-12 02:46:26] [INFO ] Added : 266 causal constraints over 54 iterations in 1596 ms. Result :unknown
[2020-05-12 02:46:26] [INFO ] [Real]Absence check using 44 positive place invariants in 31 ms returned sat
[2020-05-12 02:46:26] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-12 02:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:27] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2020-05-12 02:46:27] [INFO ] Deduced a trap composed of 15 places in 85 ms
[2020-05-12 02:46:27] [INFO ] Deduced a trap composed of 8 places in 65 ms
[2020-05-12 02:46:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 174 ms
[2020-05-12 02:46:27] [INFO ] [Real]Absence check using 44 positive place invariants in 24 ms returned sat
[2020-05-12 02:46:27] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-12 02:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:27] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2020-05-12 02:46:27] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-05-12 02:46:27] [INFO ] Deduced a trap composed of 11 places in 73 ms
[2020-05-12 02:46:27] [INFO ] Deduced a trap composed of 29 places in 66 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 23 places in 71 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 19 places in 70 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 26 places in 68 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 32 places in 31 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 19 places in 30 ms
[2020-05-12 02:46:28] [INFO ] Deduced a trap composed of 34 places in 30 ms
[2020-05-12 02:46:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 942 ms
[2020-05-12 02:46:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:28] [INFO ] [Nat]Absence check using 44 positive place invariants in 32 ms returned sat
[2020-05-12 02:46:28] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 11 ms returned sat
[2020-05-12 02:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:29] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2020-05-12 02:46:29] [INFO ] Deduced a trap composed of 20 places in 205 ms
[2020-05-12 02:46:29] [INFO ] Deduced a trap composed of 8 places in 236 ms
[2020-05-12 02:46:29] [INFO ] Deduced a trap composed of 11 places in 238 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 27 places in 238 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 17 places in 356 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 86 places in 84 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 45 places in 56 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 27 places in 52 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 32 places in 53 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 59 places in 55 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 42 places in 84 ms
[2020-05-12 02:46:31] [INFO ] Deduced a trap composed of 46 places in 49 ms
[2020-05-12 02:46:31] [INFO ] Deduced a trap composed of 35 places in 60 ms
[2020-05-12 02:46:31] [INFO ] Deduced a trap composed of 39 places in 60 ms
[2020-05-12 02:46:31] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2020-05-12 02:46:31] [INFO ] Deduced a trap composed of 38 places in 37 ms
[2020-05-12 02:46:31] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2020-05-12 02:46:31] [INFO ] Deduced a trap composed of 19 places in 21 ms
[2020-05-12 02:46:31] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2307 ms
[2020-05-12 02:46:31] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 23 ms.
[2020-05-12 02:46:32] [INFO ] Added : 219 causal constraints over 44 iterations in 1444 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-12 02:46:32] [INFO ] [Real]Absence check using 44 positive place invariants in 17 ms returned unsat
[2020-05-12 02:46:33] [INFO ] [Real]Absence check using 44 positive place invariants in 23 ms returned sat
[2020-05-12 02:46:33] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-12 02:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:33] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 12 places in 84 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 13 places in 89 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 14 places in 95 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 22 places in 99 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 16 places in 119 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 29 places in 79 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 20 places in 81 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 16 places in 79 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 24 places in 71 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 19 places in 72 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 86 places in 70 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 89 places in 68 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 44 places in 69 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 88 places in 77 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 90 places in 80 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 83 places in 65 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 83 places in 67 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 81 places in 65 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 33 places in 69 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 29 places in 67 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 88 places in 65 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 89 places in 69 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 91 places in 90 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 89 places in 66 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 58 places in 66 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 87 places in 72 ms
[2020-05-12 02:46:35] [INFO ] Deduced a trap composed of 85 places in 75 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 90 places in 75 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 90 places in 72 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 86 places in 68 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 44 places in 45 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 51 places in 48 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 43 places in 48 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 52 places in 42 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 29 places in 38 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 34 places in 44 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 27 places in 39 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 25 places in 38 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 45 places in 67 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 49 places in 76 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 53 places in 71 ms
[2020-05-12 02:46:37] [INFO ] Deduced a trap composed of 84 places in 80 ms
[2020-05-12 02:46:37] [INFO ] Deduced a trap composed of 85 places in 94 ms
[2020-05-12 02:46:37] [INFO ] Deduced a trap composed of 33 places in 63 ms
[2020-05-12 02:46:37] [INFO ] Deduced a trap composed of 88 places in 68 ms
[2020-05-12 02:46:37] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 3929 ms
[2020-05-12 02:46:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 31 ms returned sat
[2020-05-12 02:46:37] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-12 02:46:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:37] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2020-05-12 02:46:37] [INFO ] Deduced a trap composed of 16 places in 81 ms
[2020-05-12 02:46:37] [INFO ] Deduced a trap composed of 13 places in 78 ms
[2020-05-12 02:46:37] [INFO ] Deduced a trap composed of 14 places in 92 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 98 places in 83 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 87 places in 96 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 27 places in 168 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 96 places in 80 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 47 places in 218 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 11 places in 90 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 20 places in 89 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 20 places in 72 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 25 places in 87 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 19 places in 74 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 19 places in 80 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 26 places in 76 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 85 places in 82 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 92 places in 68 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 87 places in 76 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 30 places in 70 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 84 places in 68 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 41 places in 72 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 41 places in 72 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 84 places in 68 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 90 places in 97 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 89 places in 77 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 84 places in 71 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 89 places in 71 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 84 places in 71 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 91 places in 107 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 76 places in 88 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 86 places in 76 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 42 places in 89 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 86 places in 71 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 86 places in 76 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 87 places in 71 ms
[2020-05-12 02:46:41] [INFO ] Deduced a trap composed of 92 places in 77 ms
[2020-05-12 02:46:42] [INFO ] Deduced a trap composed of 32 places in 67 ms
[2020-05-12 02:46:42] [INFO ] Deduced a trap composed of 62 places in 67 ms
[2020-05-12 02:46:42] [INFO ] Deduced a trap composed of 56 places in 69 ms
[2020-05-12 02:46:42] [INFO ] Deduced a trap composed of 56 places in 65 ms
[2020-05-12 02:46:42] [INFO ] Deduced a trap composed of 50 places in 64 ms
[2020-05-12 02:46:42] [INFO ] Deduced a trap composed of 93 places in 68 ms
[2020-05-12 02:46:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s32 s33 s35 s36 s39 s40 s50 s51 s52 s53 s56 s61 s62 s63 s71 s72 s108 s109 s110 s118 s119 s123 s124 s125 s133 s136 s161 s162 s163 s167 s179 s184 s189 s194 s199 s204 s213 s215 s219 s229 s233 s234 s235 s239 s254 s259 s269 s274 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s290 s291 s294 s295 s296 s297 s298 s310 s311 s323 s324 s329 s330 s331 s332 s335 s336 s341 s342 s351 s352 s353 s354 s355 s356 s359 s360 s361 s362 s369 s370 s379) 0)") while checking expression at index 4
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 22200 steps, including 212 resets, run finished after 42 ms. (steps per millisecond=528 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 21800 steps, including 159 resets, run finished after 39 ms. (steps per millisecond=558 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 15 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 734 edges and 380 vertex of which 371 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 371 transition count 257
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 299 transition count 257
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 146 place count 299 transition count 190
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 290 place count 222 transition count 190
Symmetric choice reduction at 2 with 63 rule applications. Total rules 353 place count 222 transition count 190
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 63 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 479 place count 159 transition count 127
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 479 place count 159 transition count 122
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 491 place count 152 transition count 122
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 595 place count 100 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 596 place count 100 transition count 70
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 597 place count 100 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 598 place count 99 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 599 place count 98 transition count 68
Applied a total of 599 rules in 68 ms. Remains 98 /380 variables (removed 282) and now considering 68/331 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/380 places, 68/331 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties seen :[0, 0]
Finished probabilistic random walk after 5600 steps, run visited all 2 properties in 16 ms. (steps per millisecond=350 )
Probabilistic random walk after 5600 steps, saw 1498 distinct states, run finished after 16 ms. (steps per millisecond=350 ) properties seen :[1, 1]
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589251605546

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

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