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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 4.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.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.1K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 159K 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-16-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589256276579

[2020-05-12 04:04:38] [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:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:04:38] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2020-05-12 04:04:38] [INFO ] Transformed 638 places.
[2020-05-12 04:04:38] [INFO ] Transformed 578 transitions.
[2020-05-12 04:04:38] [INFO ] Found NUPN structural information;
[2020-05-12 04:04:38] [INFO ] Parsed PT model containing 638 places and 578 transitions in 118 ms.
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 67 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[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 15 ms. (steps per millisecond=666 ) properties seen :[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 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 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]
Incomplete Best-First random walk after 10001 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]
// Phase 1: matrix 570 rows 630 cols
[2020-05-12 04:04:38] [INFO ] Computed 100 place invariants in 20 ms
[2020-05-12 04:04:39] [INFO ] [Real]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-05-12 04:04:39] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2020-05-12 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:40] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2020-05-12 04:04:40] [INFO ] Deduced a trap composed of 16 places in 233 ms
[2020-05-12 04:04:40] [INFO ] Deduced a trap composed of 12 places in 190 ms
[2020-05-12 04:04:40] [INFO ] Deduced a trap composed of 13 places in 174 ms
[2020-05-12 04:04:41] [INFO ] Deduced a trap composed of 118 places in 200 ms
[2020-05-12 04:04:41] [INFO ] Deduced a trap composed of 8 places in 242 ms
[2020-05-12 04:04:41] [INFO ] Deduced a trap composed of 15 places in 189 ms
[2020-05-12 04:04:41] [INFO ] Deduced a trap composed of 16 places in 167 ms
[2020-05-12 04:04:42] [INFO ] Deduced a trap composed of 36 places in 158 ms
[2020-05-12 04:04:42] [INFO ] Deduced a trap composed of 48 places in 156 ms
[2020-05-12 04:04:42] [INFO ] Deduced a trap composed of 22 places in 163 ms
[2020-05-12 04:04:42] [INFO ] Deduced a trap composed of 25 places in 61 ms
[2020-05-12 04:04:42] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2020-05-12 04:04:42] [INFO ] Deduced a trap composed of 44 places in 38 ms
[2020-05-12 04:04:42] [INFO ] Deduced a trap composed of 51 places in 75 ms
[2020-05-12 04:04:42] [INFO ] Deduced a trap composed of 59 places in 71 ms
[2020-05-12 04:04:43] [INFO ] Deduced a trap composed of 19 places in 73 ms
[2020-05-12 04:04:43] [INFO ] Deduced a trap composed of 60 places in 70 ms
[2020-05-12 04:04:43] [INFO ] Deduced a trap composed of 32 places in 67 ms
[2020-05-12 04:04:43] [INFO ] Deduced a trap composed of 59 places in 66 ms
[2020-05-12 04:04:43] [INFO ] Deduced a trap composed of 67 places in 65 ms
[2020-05-12 04:04:43] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3161 ms
[2020-05-12 04:04:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:04:43] [INFO ] [Nat]Absence check using 62 positive place invariants in 67 ms returned sat
[2020-05-12 04:04:43] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 26 ms returned sat
[2020-05-12 04:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:44] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2020-05-12 04:04:44] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-05-12 04:04:44] [INFO ] Deduced a trap composed of 25 places in 132 ms
[2020-05-12 04:04:44] [INFO ] Deduced a trap composed of 18 places in 148 ms
[2020-05-12 04:04:45] [INFO ] Deduced a trap composed of 15 places in 146 ms
[2020-05-12 04:04:45] [INFO ] Deduced a trap composed of 8 places in 138 ms
[2020-05-12 04:04:45] [INFO ] Deduced a trap composed of 17 places in 142 ms
[2020-05-12 04:04:45] [INFO ] Deduced a trap composed of 15 places in 108 ms
[2020-05-12 04:04:45] [INFO ] Deduced a trap composed of 21 places in 92 ms
[2020-05-12 04:04:45] [INFO ] Deduced a trap composed of 14 places in 94 ms
[2020-05-12 04:04:45] [INFO ] Deduced a trap composed of 19 places in 87 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 54 places in 84 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 41 places in 98 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 35 places in 94 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 44 places in 103 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 28 places in 82 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 24 places in 71 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 43 places in 79 ms
[2020-05-12 04:04:46] [INFO ] Deduced a trap composed of 40 places in 71 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 39 places in 74 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 61 places in 79 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 45 places in 76 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 53 places in 75 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 50 places in 78 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 52 places in 77 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 61 places in 75 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 55 places in 80 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 60 places in 76 ms
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 68 places in 75 ms
[2020-05-12 04:04:48] [INFO ] Deduced a trap composed of 64 places in 75 ms
[2020-05-12 04:04:48] [INFO ] Deduced a trap composed of 52 places in 69 ms
[2020-05-12 04:04:48] [INFO ] Deduced a trap composed of 69 places in 66 ms
[2020-05-12 04:04:48] [INFO ] Deduced a trap composed of 57 places in 66 ms
[2020-05-12 04:04:48] [INFO ] Deduced a trap composed of 66 places in 77 ms
[2020-05-12 04:04:48] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-05-12 04:04:48] [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 s242) 0)") while checking expression at index 0
[2020-05-12 04:04:48] [INFO ] [Real]Absence check using 62 positive place invariants in 44 ms returned sat
[2020-05-12 04:04:48] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 04:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:49] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2020-05-12 04:04:49] [INFO ] Deduced a trap composed of 8 places in 149 ms
[2020-05-12 04:04:50] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-05-12 04:04:50] [INFO ] Deduced a trap composed of 14 places in 135 ms
[2020-05-12 04:04:50] [INFO ] Deduced a trap composed of 22 places in 130 ms
[2020-05-12 04:04:50] [INFO ] Deduced a trap composed of 46 places in 127 ms
[2020-05-12 04:04:50] [INFO ] Deduced a trap composed of 39 places in 127 ms
[2020-05-12 04:04:50] [INFO ] Deduced a trap composed of 28 places in 121 ms
[2020-05-12 04:04:51] [INFO ] Deduced a trap composed of 15 places in 124 ms
[2020-05-12 04:04:51] [INFO ] Deduced a trap composed of 46 places in 108 ms
[2020-05-12 04:04:51] [INFO ] Deduced a trap composed of 23 places in 105 ms
[2020-05-12 04:04:51] [INFO ] Deduced a trap composed of 38 places in 102 ms
[2020-05-12 04:04:51] [INFO ] Deduced a trap composed of 47 places in 118 ms
[2020-05-12 04:04:51] [INFO ] Deduced a trap composed of 39 places in 126 ms
[2020-05-12 04:04:51] [INFO ] Deduced a trap composed of 38 places in 115 ms
[2020-05-12 04:04:51] [INFO ] Deduced a trap composed of 41 places in 103 ms
[2020-05-12 04:04:52] [INFO ] Deduced a trap composed of 38 places in 103 ms
[2020-05-12 04:04:52] [INFO ] Deduced a trap composed of 44 places in 103 ms
[2020-05-12 04:04:52] [INFO ] Deduced a trap composed of 60 places in 93 ms
[2020-05-12 04:04:52] [INFO ] Deduced a trap composed of 54 places in 99 ms
[2020-05-12 04:04:52] [INFO ] Deduced a trap composed of 27 places in 47 ms
[2020-05-12 04:04:52] [INFO ] Deduced a trap composed of 45 places in 44 ms
[2020-05-12 04:04:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2906 ms
[2020-05-12 04:04:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:04:52] [INFO ] [Nat]Absence check using 62 positive place invariants in 68 ms returned sat
[2020-05-12 04:04:52] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 24 ms returned sat
[2020-05-12 04:04:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:53] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2020-05-12 04:04:53] [INFO ] Deduced a trap composed of 8 places in 213 ms
[2020-05-12 04:04:54] [INFO ] Deduced a trap composed of 18 places in 214 ms
[2020-05-12 04:04:54] [INFO ] Deduced a trap composed of 8 places in 194 ms
[2020-05-12 04:04:54] [INFO ] Deduced a trap composed of 15 places in 126 ms
[2020-05-12 04:04:54] [INFO ] Deduced a trap composed of 23 places in 112 ms
[2020-05-12 04:04:54] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-05-12 04:04:54] [INFO ] Deduced a trap composed of 36 places in 95 ms
[2020-05-12 04:04:54] [INFO ] Deduced a trap composed of 40 places in 93 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 43 places in 91 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 54 places in 86 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 42 places in 82 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 42 places in 77 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 53 places in 82 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 35 places in 247 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 42 places in 85 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 48 places in 78 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 54 places in 76 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 63 places in 87 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 54 places in 86 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 62 places in 87 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 30 places in 55 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 52 places in 54 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 27 places in 56 ms
[2020-05-12 04:04:56] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2020-05-12 04:04:56] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3207 ms
[2020-05-12 04:04:56] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 34 ms.
[2020-05-12 04:04:57] [INFO ] Added : 110 causal constraints over 22 iterations in 882 ms. Result :(error "Failed to check-sat")
[2020-05-12 04:04:57] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned unsat
[2020-05-12 04:04:57] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-05-12 04:04:57] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 04:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:58] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2020-05-12 04:04:58] [INFO ] Deduced a trap composed of 133 places in 187 ms
[2020-05-12 04:04:59] [INFO ] Deduced a trap composed of 8 places in 215 ms
[2020-05-12 04:04:59] [INFO ] Deduced a trap composed of 14 places in 207 ms
[2020-05-12 04:04:59] [INFO ] Deduced a trap composed of 16 places in 190 ms
[2020-05-12 04:04:59] [INFO ] Deduced a trap composed of 14 places in 206 ms
[2020-05-12 04:05:00] [INFO ] Deduced a trap composed of 11 places in 182 ms
[2020-05-12 04:05:00] [INFO ] Deduced a trap composed of 20 places in 171 ms
[2020-05-12 04:05:00] [INFO ] Deduced a trap composed of 18 places in 174 ms
[2020-05-12 04:05:00] [INFO ] Deduced a trap composed of 31 places in 172 ms
[2020-05-12 04:05:00] [INFO ] Deduced a trap composed of 159 places in 168 ms
[2020-05-12 04:05:01] [INFO ] Deduced a trap composed of 24 places in 185 ms
[2020-05-12 04:05:01] [INFO ] Deduced a trap composed of 25 places in 167 ms
[2020-05-12 04:05:01] [INFO ] Deduced a trap composed of 156 places in 169 ms
[2020-05-12 04:05:01] [INFO ] Deduced a trap composed of 143 places in 145 ms
[2020-05-12 04:05:01] [INFO ] Deduced a trap composed of 34 places in 152 ms
[2020-05-12 04:05:01] [INFO ] Deduced a trap composed of 138 places in 146 ms
[2020-05-12 04:05:02] [INFO ] Deduced a trap composed of 155 places in 139 ms
[2020-05-12 04:05:02] [INFO ] Deduced a trap composed of 149 places in 138 ms
[2020-05-12 04:05:02] [INFO ] Deduced a trap composed of 150 places in 156 ms
[2020-05-12 04:05:02] [INFO ] Deduced a trap composed of 144 places in 158 ms
[2020-05-12 04:05:02] [INFO ] Deduced a trap composed of 23 places in 158 ms
[2020-05-12 04:05:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s117 s392 s393 s394) 0)") while checking expression at index 3
[2020-05-12 04:05:02] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-05-12 04:05:03] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 04:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:03] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2020-05-12 04:05:03] [INFO ] Deduced a trap composed of 22 places in 115 ms
[2020-05-12 04:05:04] [INFO ] Deduced a trap composed of 8 places in 110 ms
[2020-05-12 04:05:04] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-05-12 04:05:04] [INFO ] Deduced a trap composed of 15 places in 99 ms
[2020-05-12 04:05:04] [INFO ] Deduced a trap composed of 29 places in 95 ms
[2020-05-12 04:05:04] [INFO ] Deduced a trap composed of 26 places in 95 ms
[2020-05-12 04:05:04] [INFO ] Deduced a trap composed of 40 places in 98 ms
[2020-05-12 04:05:04] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2020-05-12 04:05:04] [INFO ] Deduced a trap composed of 84 places in 97 ms
[2020-05-12 04:05:05] [INFO ] Deduced a trap composed of 19 places in 93 ms
[2020-05-12 04:05:05] [INFO ] Deduced a trap composed of 14 places in 89 ms
[2020-05-12 04:05:05] [INFO ] Deduced a trap composed of 36 places in 88 ms
[2020-05-12 04:05:05] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2020-05-12 04:05:05] [INFO ] Deduced a trap composed of 44 places in 58 ms
[2020-05-12 04:05:05] [INFO ] Deduced a trap composed of 50 places in 57 ms
[2020-05-12 04:05:05] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1749 ms
[2020-05-12 04:05:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:05:05] [INFO ] [Nat]Absence check using 62 positive place invariants in 64 ms returned sat
[2020-05-12 04:05:05] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 04:05:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:06] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2020-05-12 04:05:06] [INFO ] Deduced a trap composed of 15 places in 217 ms
[2020-05-12 04:05:06] [INFO ] Deduced a trap composed of 39 places in 208 ms
[2020-05-12 04:05:07] [INFO ] Deduced a trap composed of 39 places in 207 ms
[2020-05-12 04:05:07] [INFO ] Deduced a trap composed of 8 places in 215 ms
[2020-05-12 04:05:07] [INFO ] Deduced a trap composed of 12 places in 203 ms
[2020-05-12 04:05:07] [INFO ] Deduced a trap composed of 16 places in 206 ms
[2020-05-12 04:05:08] [INFO ] Deduced a trap composed of 38 places in 184 ms
[2020-05-12 04:05:08] [INFO ] Deduced a trap composed of 48 places in 181 ms
[2020-05-12 04:05:08] [INFO ] Deduced a trap composed of 40 places in 180 ms
[2020-05-12 04:05:08] [INFO ] Deduced a trap composed of 23 places in 182 ms
[2020-05-12 04:05:08] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2020-05-12 04:05:09] [INFO ] Deduced a trap composed of 39 places in 181 ms
[2020-05-12 04:05:09] [INFO ] Deduced a trap composed of 46 places in 177 ms
[2020-05-12 04:05:09] [INFO ] Deduced a trap composed of 55 places in 98 ms
[2020-05-12 04:05:09] [INFO ] Deduced a trap composed of 36 places in 42 ms
[2020-05-12 04:05:09] [INFO ] Deduced a trap composed of 49 places in 42 ms
[2020-05-12 04:05:09] [INFO ] Deduced a trap composed of 44 places in 48 ms
[2020-05-12 04:05:09] [INFO ] Deduced a trap composed of 42 places in 41 ms
[2020-05-12 04:05:09] [INFO ] Deduced a trap composed of 51 places in 36 ms
[2020-05-12 04:05:09] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3326 ms
[2020-05-12 04:05:09] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 31 ms.
[2020-05-12 04:05:10] [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 (=> (> t198 0) (and (> t197 0) (< o197 o198)))") while checking expression at index 4
[2020-05-12 04:05:10] [INFO ] [Real]Absence check using 62 positive place invariants in 70 ms returned sat
[2020-05-12 04:05:10] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 5 ms returned unsat
[2020-05-12 04:05:10] [INFO ] [Real]Absence check using 62 positive place invariants in 51 ms returned sat
[2020-05-12 04:05:10] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 26 ms returned sat
[2020-05-12 04:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:11] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2020-05-12 04:05:13] [INFO ] Deduced a trap composed of 12 places in 1885 ms
[2020-05-12 04:05:13] [INFO ] Deduced a trap composed of 19 places in 139 ms
[2020-05-12 04:05:13] [INFO ] Deduced a trap composed of 15 places in 97 ms
[2020-05-12 04:05:14] [INFO ] Deduced a trap composed of 38 places in 101 ms
[2020-05-12 04:05:14] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-05-12 04:05:14] [INFO ] Deduced a trap composed of 17 places in 98 ms
[2020-05-12 04:05:14] [INFO ] Deduced a trap composed of 35 places in 100 ms
[2020-05-12 04:05:14] [INFO ] Deduced a trap composed of 41 places in 215 ms
[2020-05-12 04:05:14] [INFO ] Deduced a trap composed of 44 places in 210 ms
[2020-05-12 04:05:14] [INFO ] Deduced a trap composed of 36 places in 97 ms
[2020-05-12 04:05:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3324 ms
[2020-05-12 04:05:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:05:15] [INFO ] [Nat]Absence check using 62 positive place invariants in 54 ms returned sat
[2020-05-12 04:05:15] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 32 ms returned sat
[2020-05-12 04:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:15] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2020-05-12 04:05:16] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2020-05-12 04:05:16] [INFO ] Deduced a trap composed of 11 places in 103 ms
[2020-05-12 04:05:16] [INFO ] Deduced a trap composed of 15 places in 113 ms
[2020-05-12 04:05:16] [INFO ] Deduced a trap composed of 14 places in 101 ms
[2020-05-12 04:05:16] [INFO ] Deduced a trap composed of 15 places in 88 ms
[2020-05-12 04:05:16] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-05-12 04:05:16] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-05-12 04:05:17] [INFO ] Deduced a trap composed of 18 places in 100 ms
[2020-05-12 04:05:17] [INFO ] Deduced a trap composed of 24 places in 91 ms
[2020-05-12 04:05:17] [INFO ] Deduced a trap composed of 19 places in 81 ms
[2020-05-12 04:05:17] [INFO ] Deduced a trap composed of 33 places in 76 ms
[2020-05-12 04:05:17] [INFO ] Deduced a trap composed of 34 places in 71 ms
[2020-05-12 04:05:17] [INFO ] Deduced a trap composed of 46 places in 70 ms
[2020-05-12 04:05:17] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2020-05-12 04:05:17] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2020-05-12 04:05:17] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1709 ms
[2020-05-12 04:05:17] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 33 ms.
[2020-05-12 04:05:20] [INFO ] Added : 280 causal constraints over 56 iterations in 2325 ms. Result :unknown
[2020-05-12 04:05:20] [INFO ] [Real]Absence check using 62 positive place invariants in 47 ms returned sat
[2020-05-12 04:05:20] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 24 ms returned sat
[2020-05-12 04:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:20] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2020-05-12 04:05:21] [INFO ] Deduced a trap composed of 137 places in 261 ms
[2020-05-12 04:05:21] [INFO ] Deduced a trap composed of 127 places in 197 ms
[2020-05-12 04:05:21] [INFO ] Deduced a trap composed of 16 places in 217 ms
[2020-05-12 04:05:21] [INFO ] Deduced a trap composed of 12 places in 218 ms
[2020-05-12 04:05:22] [INFO ] Deduced a trap composed of 8 places in 168 ms
[2020-05-12 04:05:22] [INFO ] Deduced a trap composed of 14 places in 173 ms
[2020-05-12 04:05:22] [INFO ] Deduced a trap composed of 23 places in 191 ms
[2020-05-12 04:05:22] [INFO ] Deduced a trap composed of 30 places in 175 ms
[2020-05-12 04:05:22] [INFO ] Deduced a trap composed of 29 places in 197 ms
[2020-05-12 04:05:23] [INFO ] Deduced a trap composed of 42 places in 175 ms
[2020-05-12 04:05:23] [INFO ] Deduced a trap composed of 46 places in 185 ms
[2020-05-12 04:05:23] [INFO ] Deduced a trap composed of 19 places in 208 ms
[2020-05-12 04:05:23] [INFO ] Deduced a trap composed of 46 places in 171 ms
[2020-05-12 04:05:24] [INFO ] Deduced a trap composed of 133 places in 167 ms
[2020-05-12 04:05:24] [INFO ] Deduced a trap composed of 22 places in 185 ms
[2020-05-12 04:05:24] [INFO ] Deduced a trap composed of 22 places in 170 ms
[2020-05-12 04:05:24] [INFO ] Deduced a trap composed of 36 places in 172 ms
[2020-05-12 04:05:24] [INFO ] Deduced a trap composed of 45 places in 168 ms
[2020-05-12 04:05:25] [INFO ] Deduced a trap composed of 24 places in 180 ms
[2020-05-12 04:05:25] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-05-12 04:05: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 s3 s4 s242) 0)") while checking expression at index 7
[2020-05-12 04:05:25] [INFO ] [Real]Absence check using 62 positive place invariants in 270 ms returned sat
[2020-05-12 04:05:25] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned unsat
[2020-05-12 04:05:25] [INFO ] [Real]Absence check using 62 positive place invariants in 42 ms returned sat
[2020-05-12 04:05:25] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned unsat
[2020-05-12 04:05:25] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned unsat
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 38400 steps, including 272 resets, run finished after 111 ms. (steps per millisecond=345 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 26 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 624 transition count 469
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 201 place count 524 transition count 469
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 201 place count 524 transition count 347
Deduced a syphon composed of 122 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 460 place count 387 transition count 347
Symmetric choice reduction at 2 with 83 rule applications. Total rules 543 place count 387 transition count 347
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 83 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 709 place count 304 transition count 264
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 709 place count 304 transition count 255
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 730 place count 292 transition count 255
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 904 place count 205 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 905 place count 205 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 907 place count 204 transition count 171
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 912 place count 204 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 913 place count 203 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 914 place count 202 transition count 170
Applied a total of 914 rules in 107 ms. Remains 202 /630 variables (removed 428) and now considering 170/570 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/630 places, 170/570 transitions.
Incomplete random walk after 1000000 steps, including 74126 resets, run finished after 1711 ms. (steps per millisecond=584 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 19151 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 19092 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19252 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19186 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19046 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 170 rows 202 cols
[2020-05-12 04:05:32] [INFO ] Computed 76 place invariants in 8 ms
[2020-05-12 04:05:32] [INFO ] [Real]Absence check using 54 positive place invariants in 33 ms returned sat
[2020-05-12 04:05:32] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 14 ms returned sat
[2020-05-12 04:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:33] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2020-05-12 04:05:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-12 04:05:33] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2020-05-12 04:05:33] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2020-05-12 04:05:33] [INFO ] Deduced a trap composed of 10 places in 27 ms
[2020-05-12 04:05:33] [INFO ] Deduced a trap composed of 8 places in 26 ms
[2020-05-12 04:05:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 115 ms
[2020-05-12 04:05:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:05:33] [INFO ] [Nat]Absence check using 54 positive place invariants in 22 ms returned sat
[2020-05-12 04:05:33] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 7 ms returned sat
[2020-05-12 04:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:33] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-05-12 04:05:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2020-05-12 04:05:33] [INFO ] Computed and/alt/rep : 167/807/167 causal constraints in 21 ms.
[2020-05-12 04:05:33] [INFO ] Added : 85 causal constraints over 18 iterations in 416 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-12 04:05:33] [INFO ] [Real]Absence check using 54 positive place invariants in 27 ms returned sat
[2020-05-12 04:05:33] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 16 ms returned sat
[2020-05-12 04:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:34] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-05-12 04:05:34] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2020-05-12 04:05:34] [INFO ] Deduced a trap composed of 17 places in 60 ms
[2020-05-12 04:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2020-05-12 04:05:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:05:34] [INFO ] [Nat]Absence check using 54 positive place invariants in 34 ms returned sat
[2020-05-12 04:05:34] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 6 ms returned sat
[2020-05-12 04:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:34] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-05-12 04:05:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 18 ms returned sat
[2020-05-12 04:05:34] [INFO ] Deduced a trap composed of 41 places in 85 ms
[2020-05-12 04:05:34] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2020-05-12 04:05:34] [INFO ] Deduced a trap composed of 40 places in 46 ms
[2020-05-12 04:05:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2020-05-12 04:05:34] [INFO ] Computed and/alt/rep : 167/807/167 causal constraints in 9 ms.
[2020-05-12 04:05:35] [INFO ] Added : 82 causal constraints over 18 iterations in 409 ms. Result :sat
[2020-05-12 04:05:35] [INFO ] Deduced a trap composed of 42 places in 56 ms
[2020-05-12 04:05:35] [INFO ] Deduced a trap composed of 43 places in 37 ms
[2020-05-12 04:05:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-12 04:05:35] [INFO ] [Real]Absence check using 54 positive place invariants in 23 ms returned sat
[2020-05-12 04:05:35] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 9 ms returned sat
[2020-05-12 04:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:35] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2020-05-12 04:05:35] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2020-05-12 04:05:35] [INFO ] Deduced a trap composed of 5 places in 111 ms
[2020-05-12 04:05:35] [INFO ] Deduced a trap composed of 44 places in 54 ms
[2020-05-12 04:05:35] [INFO ] Deduced a trap composed of 43 places in 54 ms
[2020-05-12 04:05:35] [INFO ] Deduced a trap composed of 44 places in 38 ms
[2020-05-12 04:05:35] [INFO ] Deduced a trap composed of 42 places in 35 ms
[2020-05-12 04:05:35] [INFO ] Deduced a trap composed of 44 places in 54 ms
[2020-05-12 04:05:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 436 ms
[2020-05-12 04:05:35] [INFO ] [Real]Absence check using 54 positive place invariants in 14 ms returned sat
[2020-05-12 04:05:35] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 5 ms returned sat
[2020-05-12 04:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:36] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2020-05-12 04:05:36] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2020-05-12 04:05:36] [INFO ] Deduced a trap composed of 46 places in 50 ms
[2020-05-12 04:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2020-05-12 04:05:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:05:36] [INFO ] [Nat]Absence check using 54 positive place invariants in 15 ms returned sat
[2020-05-12 04:05:36] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 6 ms returned sat
[2020-05-12 04:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:36] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2020-05-12 04:05:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 21 ms returned sat
[2020-05-12 04:05:36] [INFO ] Deduced a trap composed of 42 places in 50 ms
[2020-05-12 04:05:37] [INFO ] Deduced a trap composed of 8 places in 749 ms
[2020-05-12 04:05:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 831 ms
[2020-05-12 04:05:37] [INFO ] Computed and/alt/rep : 167/807/167 causal constraints in 11 ms.
[2020-05-12 04:05:37] [INFO ] Added : 98 causal constraints over 21 iterations in 471 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-12 04:05:37] [INFO ] [Real]Absence check using 54 positive place invariants in 18 ms returned sat
[2020-05-12 04:05:37] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 19 ms returned sat
[2020-05-12 04:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:37] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-05-12 04:05:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:05:37] [INFO ] [Nat]Absence check using 54 positive place invariants in 36 ms returned sat
[2020-05-12 04:05:37] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 8 ms returned sat
[2020-05-12 04:05:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:05:38] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2020-05-12 04:05:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 23 ms returned sat
[2020-05-12 04:05:38] [INFO ] Deduced a trap composed of 10 places in 149 ms
[2020-05-12 04:05:38] [INFO ] Deduced a trap composed of 17 places in 23 ms
[2020-05-12 04:05:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2020-05-12 04:05:38] [INFO ] Computed and/alt/rep : 167/807/167 causal constraints in 21 ms.
[2020-05-12 04:05:38] [INFO ] Added : 78 causal constraints over 17 iterations in 716 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 8400 steps, including 129 resets, run finished after 16 ms. (steps per millisecond=525 ) properties seen :[0, 0, 1, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14600 steps, including 968 resets, run finished after 24 ms. (steps per millisecond=608 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 9200 steps, including 609 resets, run finished after 15 ms. (steps per millisecond=613 ) properties seen :[0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10200 steps, including 685 resets, run finished after 17 ms. (steps per millisecond=600 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 170/170 transitions.
Graph (trivial) has 25 edges and 202 vertex of which 2 / 202 are part of one of the 1 SCC in 10 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 201 transition count 164
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 197 transition count 164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 197 transition count 161
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 194 transition count 161
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 194 transition count 161
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 4 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 191 transition count 157
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 52 place count 177 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 54 place count 176 transition count 145
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 176 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 174 transition count 143
Applied a total of 58 rules in 73 ms. Remains 174 /202 variables (removed 28) and now considering 143/170 (removed 27) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/202 places, 143/170 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589256339914

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

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