Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000200.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000200
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 131K May 5 16:51 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-10-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620937429936

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:23:51] [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, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:23:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:23:51] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2021-05-13 20:23:51] [INFO ] Transformed 518 places.
[2021-05-13 20:23:51] [INFO ] Transformed 471 transitions.
[2021-05-13 20:23:51] [INFO ] Found NUPN structural information;
[2021-05-13 20:23:51] [INFO ] Parsed PT model containing 518 places and 471 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 83 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 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 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 17 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 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 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 17 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 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 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 10000 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 471 rows 518 cols
[2021-05-13 20:23:52] [INFO ] Computed 85 place invariants in 27 ms
[2021-05-13 20:23:52] [INFO ] [Real]Absence check using 48 positive place invariants in 50 ms returned sat
[2021-05-13 20:23:52] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned unsat
[2021-05-13 20:23:52] [INFO ] [Real]Absence check using 48 positive place invariants in 35 ms returned sat
[2021-05-13 20:23:52] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 26 ms returned sat
[2021-05-13 20:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:23:53] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2021-05-13 20:23:53] [INFO ] Deduced a trap composed of 20 places in 311 ms
[2021-05-13 20:23:53] [INFO ] Deduced a trap composed of 12 places in 210 ms
[2021-05-13 20:23:54] [INFO ] Deduced a trap composed of 13 places in 249 ms
[2021-05-13 20:23:54] [INFO ] Deduced a trap composed of 15 places in 205 ms
[2021-05-13 20:23:54] [INFO ] Deduced a trap composed of 118 places in 169 ms
[2021-05-13 20:23:54] [INFO ] Deduced a trap composed of 119 places in 168 ms
[2021-05-13 20:23:55] [INFO ] Deduced a trap composed of 125 places in 227 ms
[2021-05-13 20:23:55] [INFO ] Deduced a trap composed of 14 places in 180 ms
[2021-05-13 20:23:55] [INFO ] Deduced a trap composed of 127 places in 207 ms
[2021-05-13 20:23:55] [INFO ] Deduced a trap composed of 136 places in 170 ms
[2021-05-13 20:23:55] [INFO ] Deduced a trap composed of 16 places in 228 ms
[2021-05-13 20:23:56] [INFO ] Deduced a trap composed of 119 places in 163 ms
[2021-05-13 20:23:56] [INFO ] Deduced a trap composed of 25 places in 167 ms
[2021-05-13 20:23:56] [INFO ] Deduced a trap composed of 121 places in 193 ms
[2021-05-13 20:23:56] [INFO ] Deduced a trap composed of 126 places in 164 ms
[2021-05-13 20:23:57] [INFO ] Deduced a trap composed of 115 places in 188 ms
[2021-05-13 20:23:57] [INFO ] Deduced a trap composed of 118 places in 340 ms
[2021-05-13 20:23:57] [INFO ] Deduced a trap composed of 120 places in 248 ms
[2021-05-13 20:23:57] [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 s3 s4 s5 s28 s29 s34 s35 s36 s37 s38 s64 s65 s68 s69 s141 s142 s143 s147 s148 s149 s150 s153 s154 s159 s160 s161 s164 s165 s166 s167 s180 s181 s182 s212 s238 s247 s249 s262 s263 s264 s267 s268 s269 s277 s278 s279 s282 s284 s288 s302 s303 s304 s312 s313 s314 s323 s328 s338 s342 s343 s344 s353 s356 s358 s359 s360 s362 s363 s364 s365 s366 s367 s368 s371 s372 s373 s374 s375 s376 s383 s384 s387 s404 s405 s419 s420 s421 s422 s426 s427 s430 s431 s432 s433 s440 s441 s442 s443 s444 s445 s455 s458 s459 s460 s461 s471 s472 s475 s476 s479 s490 s494 s506 s507 s508 s515 s516 s517) 0)") while checking expression at index 1
[2021-05-13 20:23:57] [INFO ] [Real]Absence check using 48 positive place invariants in 63 ms returned sat
[2021-05-13 20:23:57] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 32 ms returned sat
[2021-05-13 20:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:23:58] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2021-05-13 20:23:58] [INFO ] Deduced a trap composed of 126 places in 269 ms
[2021-05-13 20:23:58] [INFO ] Deduced a trap composed of 13 places in 225 ms
[2021-05-13 20:23:59] [INFO ] Deduced a trap composed of 8 places in 218 ms
[2021-05-13 20:23:59] [INFO ] Deduced a trap composed of 116 places in 226 ms
[2021-05-13 20:23:59] [INFO ] Deduced a trap composed of 117 places in 234 ms
[2021-05-13 20:23:59] [INFO ] Deduced a trap composed of 126 places in 226 ms
[2021-05-13 20:24:00] [INFO ] Deduced a trap composed of 126 places in 221 ms
[2021-05-13 20:24:00] [INFO ] Deduced a trap composed of 126 places in 197 ms
[2021-05-13 20:24:00] [INFO ] Deduced a trap composed of 8 places in 220 ms
[2021-05-13 20:24:00] [INFO ] Deduced a trap composed of 16 places in 202 ms
[2021-05-13 20:24:01] [INFO ] Deduced a trap composed of 24 places in 212 ms
[2021-05-13 20:24:01] [INFO ] Deduced a trap composed of 123 places in 197 ms
[2021-05-13 20:24:01] [INFO ] Deduced a trap composed of 24 places in 201 ms
[2021-05-13 20:24:01] [INFO ] Deduced a trap composed of 32 places in 191 ms
[2021-05-13 20:24:02] [INFO ] Deduced a trap composed of 18 places in 223 ms
[2021-05-13 20:24:02] [INFO ] Deduced a trap composed of 21 places in 135 ms
[2021-05-13 20:24:02] [INFO ] Deduced a trap composed of 15 places in 159 ms
[2021-05-13 20:24:02] [INFO ] Deduced a trap composed of 37 places in 74 ms
[2021-05-13 20:24:02] [INFO ] Deduced a trap composed of 31 places in 80 ms
[2021-05-13 20:24:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:24:02] [INFO ] Deduced a trap composed of 9 places in 273 ms
[2021-05-13 20:24: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 s212 s213 s351 s352 s353 s354 s355) 0)") while checking expression at index 2
[2021-05-13 20:24:03] [INFO ] [Real]Absence check using 48 positive place invariants in 39 ms returned sat
[2021-05-13 20:24:03] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 26 ms returned sat
[2021-05-13 20:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:03] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2021-05-13 20:24:03] [INFO ] Deduced a trap composed of 8 places in 152 ms
[2021-05-13 20:24:04] [INFO ] Deduced a trap composed of 15 places in 166 ms
[2021-05-13 20:24:04] [INFO ] Deduced a trap composed of 31 places in 145 ms
[2021-05-13 20:24:04] [INFO ] Deduced a trap composed of 15 places in 148 ms
[2021-05-13 20:24:04] [INFO ] Deduced a trap composed of 14 places in 161 ms
[2021-05-13 20:24:04] [INFO ] Deduced a trap composed of 13 places in 109 ms
[2021-05-13 20:24:04] [INFO ] Deduced a trap composed of 43 places in 148 ms
[2021-05-13 20:24:05] [INFO ] Deduced a trap composed of 16 places in 115 ms
[2021-05-13 20:24:05] [INFO ] Deduced a trap composed of 25 places in 132 ms
[2021-05-13 20:24:05] [INFO ] Deduced a trap composed of 34 places in 115 ms
[2021-05-13 20:24:05] [INFO ] Deduced a trap composed of 29 places in 109 ms
[2021-05-13 20:24:05] [INFO ] Deduced a trap composed of 28 places in 87 ms
[2021-05-13 20:24:05] [INFO ] Deduced a trap composed of 25 places in 86 ms
[2021-05-13 20:24:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1981 ms
[2021-05-13 20:24:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:24:05] [INFO ] [Nat]Absence check using 48 positive place invariants in 68 ms returned sat
[2021-05-13 20:24:05] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 28 ms returned sat
[2021-05-13 20:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:06] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2021-05-13 20:24:06] [INFO ] Deduced a trap composed of 9 places in 159 ms
[2021-05-13 20:24:06] [INFO ] Deduced a trap composed of 14 places in 144 ms
[2021-05-13 20:24:07] [INFO ] Deduced a trap composed of 21 places in 157 ms
[2021-05-13 20:24:07] [INFO ] Deduced a trap composed of 25 places in 148 ms
[2021-05-13 20:24:07] [INFO ] Deduced a trap composed of 13 places in 165 ms
[2021-05-13 20:24:07] [INFO ] Deduced a trap composed of 55 places in 134 ms
[2021-05-13 20:24:07] [INFO ] Deduced a trap composed of 11 places in 154 ms
[2021-05-13 20:24:07] [INFO ] Deduced a trap composed of 32 places in 124 ms
[2021-05-13 20:24:08] [INFO ] Deduced a trap composed of 18 places in 143 ms
[2021-05-13 20:24:08] [INFO ] Deduced a trap composed of 17 places in 140 ms
[2021-05-13 20:24:08] [INFO ] Deduced a trap composed of 35 places in 157 ms
[2021-05-13 20:24:08] [INFO ] Deduced a trap composed of 33 places in 143 ms
[2021-05-13 20:24:08] [INFO ] Deduced a trap composed of 39 places in 208 ms
[2021-05-13 20:24:09] [INFO ] Deduced a trap composed of 67 places in 158 ms
[2021-05-13 20:24:09] [INFO ] Deduced a trap composed of 70 places in 130 ms
[2021-05-13 20:24:09] [INFO ] Deduced a trap composed of 32 places in 129 ms
[2021-05-13 20:24:09] [INFO ] Deduced a trap composed of 37 places in 149 ms
[2021-05-13 20:24:09] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2971 ms
[2021-05-13 20:24:09] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 39 ms.
[2021-05-13 20:24:10] [INFO ] Added : 110 causal constraints over 22 iterations in 1125 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-13 20:24:10] [INFO ] [Real]Absence check using 48 positive place invariants in 41 ms returned unsat
[2021-05-13 20:24:10] [INFO ] [Real]Absence check using 48 positive place invariants in 42 ms returned sat
[2021-05-13 20:24:11] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 26 ms returned sat
[2021-05-13 20:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:11] [INFO ] [Real]Absence check using state equation in 676 ms returned unsat
[2021-05-13 20:24:11] [INFO ] [Real]Absence check using 48 positive place invariants in 41 ms returned sat
[2021-05-13 20:24:11] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 25 ms returned sat
[2021-05-13 20:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:12] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2021-05-13 20:24:12] [INFO ] Deduced a trap composed of 10 places in 256 ms
[2021-05-13 20:24:13] [INFO ] Deduced a trap composed of 16 places in 260 ms
[2021-05-13 20:24:13] [INFO ] Deduced a trap composed of 33 places in 239 ms
[2021-05-13 20:24:13] [INFO ] Deduced a trap composed of 118 places in 243 ms
[2021-05-13 20:24:13] [INFO ] Deduced a trap composed of 15 places in 168 ms
[2021-05-13 20:24:14] [INFO ] Deduced a trap composed of 28 places in 167 ms
[2021-05-13 20:24:14] [INFO ] Deduced a trap composed of 22 places in 155 ms
[2021-05-13 20:24:14] [INFO ] Deduced a trap composed of 28 places in 153 ms
[2021-05-13 20:24:14] [INFO ] Deduced a trap composed of 129 places in 152 ms
[2021-05-13 20:24:14] [INFO ] Deduced a trap composed of 25 places in 152 ms
[2021-05-13 20:24:14] [INFO ] Deduced a trap composed of 23 places in 59 ms
[2021-05-13 20:24:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2222 ms
[2021-05-13 20:24:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:24:14] [INFO ] [Nat]Absence check using 48 positive place invariants in 41 ms returned sat
[2021-05-13 20:24:14] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 16 ms returned sat
[2021-05-13 20:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:15] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2021-05-13 20:24:15] [INFO ] Deduced a trap composed of 33 places in 200 ms
[2021-05-13 20:24:15] [INFO ] Deduced a trap composed of 23 places in 269 ms
[2021-05-13 20:24:16] [INFO ] Deduced a trap composed of 121 places in 249 ms
[2021-05-13 20:24:16] [INFO ] Deduced a trap composed of 123 places in 228 ms
[2021-05-13 20:24:16] [INFO ] Deduced a trap composed of 127 places in 222 ms
[2021-05-13 20:24:16] [INFO ] Deduced a trap composed of 126 places in 230 ms
[2021-05-13 20:24:17] [INFO ] Deduced a trap composed of 9 places in 218 ms
[2021-05-13 20:24:17] [INFO ] Deduced a trap composed of 15 places in 190 ms
[2021-05-13 20:24:17] [INFO ] Deduced a trap composed of 23 places in 171 ms
[2021-05-13 20:24:17] [INFO ] Deduced a trap composed of 129 places in 161 ms
[2021-05-13 20:24:17] [INFO ] Deduced a trap composed of 124 places in 143 ms
[2021-05-13 20:24:18] [INFO ] Deduced a trap composed of 125 places in 237 ms
[2021-05-13 20:24:18] [INFO ] Deduced a trap composed of 118 places in 144 ms
[2021-05-13 20:24:18] [INFO ] Deduced a trap composed of 22 places in 235 ms
[2021-05-13 20:24:18] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2021-05-13 20:24:18] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2021-05-13 20:24:18] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2021-05-13 20:24:18] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3356 ms
[2021-05-13 20:24:18] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 24 ms.
[2021-05-13 20:24:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t231 0) (and (> t367 0) (< o367 o231)))") while checking expression at index 6
[2021-05-13 20:24:19] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2021-05-13 20:24:19] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 23 ms returned sat
[2021-05-13 20:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:20] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2021-05-13 20:24:21] [INFO ] Deduced a trap composed of 11 places in 269 ms
[2021-05-13 20:24:21] [INFO ] Deduced a trap composed of 18 places in 239 ms
[2021-05-13 20:24:21] [INFO ] Deduced a trap composed of 17 places in 235 ms
[2021-05-13 20:24:21] [INFO ] Deduced a trap composed of 8 places in 265 ms
[2021-05-13 20:24:22] [INFO ] Deduced a trap composed of 16 places in 203 ms
[2021-05-13 20:24:22] [INFO ] Deduced a trap composed of 15 places in 250 ms
[2021-05-13 20:24:22] [INFO ] Deduced a trap composed of 28 places in 218 ms
[2021-05-13 20:24:22] [INFO ] Deduced a trap composed of 32 places in 167 ms
[2021-05-13 20:24:22] [INFO ] Deduced a trap composed of 38 places in 176 ms
[2021-05-13 20:24:23] [INFO ] Deduced a trap composed of 40 places in 204 ms
[2021-05-13 20:24:23] [INFO ] Deduced a trap composed of 112 places in 188 ms
[2021-05-13 20:24:23] [INFO ] Deduced a trap composed of 116 places in 157 ms
[2021-05-13 20:24:23] [INFO ] Deduced a trap composed of 125 places in 179 ms
[2021-05-13 20:24:23] [INFO ] Deduced a trap composed of 116 places in 152 ms
[2021-05-13 20:24:24] [INFO ] Deduced a trap composed of 109 places in 128 ms
[2021-05-13 20:24:24] [INFO ] Deduced a trap composed of 120 places in 152 ms
[2021-05-13 20:24:24] [INFO ] Deduced a trap composed of 116 places in 139 ms
[2021-05-13 20:24:24] [INFO ] Deduced a trap composed of 114 places in 208 ms
[2021-05-13 20:24:24] [INFO ] Deduced a trap composed of 131 places in 178 ms
[2021-05-13 20:24:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:24:25] [INFO ] Deduced a trap composed of 9 places in 268 ms
[2021-05-13 20:24: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 s212 s213 s351 s352 s353 s354 s355) 0)") while checking expression at index 7
[2021-05-13 20:24:25] [INFO ] [Real]Absence check using 48 positive place invariants in 40 ms returned sat
[2021-05-13 20:24:25] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 32 ms returned sat
[2021-05-13 20:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:25] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2021-05-13 20:24:26] [INFO ] Deduced a trap composed of 8 places in 182 ms
[2021-05-13 20:24:26] [INFO ] Deduced a trap composed of 19 places in 140 ms
[2021-05-13 20:24:26] [INFO ] Deduced a trap composed of 13 places in 158 ms
[2021-05-13 20:24:26] [INFO ] Deduced a trap composed of 16 places in 148 ms
[2021-05-13 20:24:26] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2021-05-13 20:24:27] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2021-05-13 20:24:27] [INFO ] Deduced a trap composed of 23 places in 133 ms
[2021-05-13 20:24:27] [INFO ] Deduced a trap composed of 24 places in 118 ms
[2021-05-13 20:24:27] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2021-05-13 20:24:27] [INFO ] Deduced a trap composed of 32 places in 130 ms
[2021-05-13 20:24:27] [INFO ] Deduced a trap composed of 22 places in 118 ms
[2021-05-13 20:24:27] [INFO ] Deduced a trap composed of 32 places in 129 ms
[2021-05-13 20:24:28] [INFO ] Deduced a trap composed of 28 places in 137 ms
[2021-05-13 20:24:28] [INFO ] Deduced a trap composed of 24 places in 127 ms
[2021-05-13 20:24:28] [INFO ] Deduced a trap composed of 31 places in 130 ms
[2021-05-13 20:24:28] [INFO ] Deduced a trap composed of 49 places in 160 ms
[2021-05-13 20:24:28] [INFO ] Deduced a trap composed of 40 places in 133 ms
[2021-05-13 20:24:28] [INFO ] Deduced a trap composed of 40 places in 127 ms
[2021-05-13 20:24:29] [INFO ] Deduced a trap composed of 39 places in 110 ms
[2021-05-13 20:24:29] [INFO ] Deduced a trap composed of 25 places in 110 ms
[2021-05-13 20:24:29] [INFO ] Deduced a trap composed of 37 places in 96 ms
[2021-05-13 20:24:29] [INFO ] Deduced a trap composed of 40 places in 120 ms
[2021-05-13 20:24:29] [INFO ] Deduced a trap composed of 25 places in 104 ms
[2021-05-13 20:24:29] [INFO ] Deduced a trap composed of 35 places in 98 ms
[2021-05-13 20:24:29] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2021-05-13 20:24:29] [INFO ] Deduced a trap composed of 34 places in 102 ms
[2021-05-13 20:24:30] [INFO ] Deduced a trap composed of 33 places in 82 ms
[2021-05-13 20:24:30] [INFO ] Deduced a trap composed of 25 places in 98 ms
[2021-05-13 20:24:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s54 s55 s56 s73 s82 s83 s120 s273 s277 s278 s279 s293 s436 s437) 0)") while checking expression at index 8
[2021-05-13 20:24:30] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned unsat
[2021-05-13 20:24:30] [INFO ] [Real]Absence check using 48 positive place invariants in 50 ms returned sat
[2021-05-13 20:24:30] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 28 ms returned sat
[2021-05-13 20:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:31] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2021-05-13 20:24:31] [INFO ] Deduced a trap composed of 8 places in 288 ms
[2021-05-13 20:24:31] [INFO ] Deduced a trap composed of 8 places in 209 ms
[2021-05-13 20:24:31] [INFO ] Deduced a trap composed of 19 places in 237 ms
[2021-05-13 20:24:32] [INFO ] Deduced a trap composed of 110 places in 259 ms
[2021-05-13 20:24:32] [INFO ] Deduced a trap composed of 12 places in 170 ms
[2021-05-13 20:24:32] [INFO ] Deduced a trap composed of 16 places in 188 ms
[2021-05-13 20:24:32] [INFO ] Deduced a trap composed of 15 places in 258 ms
[2021-05-13 20:24:33] [INFO ] Deduced a trap composed of 108 places in 158 ms
[2021-05-13 20:24:33] [INFO ] Deduced a trap composed of 119 places in 177 ms
[2021-05-13 20:24:33] [INFO ] Deduced a trap composed of 123 places in 162 ms
[2021-05-13 20:24:33] [INFO ] Deduced a trap composed of 113 places in 189 ms
[2021-05-13 20:24:33] [INFO ] Deduced a trap composed of 115 places in 132 ms
[2021-05-13 20:24:34] [INFO ] Deduced a trap composed of 36 places in 230 ms
[2021-05-13 20:24:34] [INFO ] Deduced a trap composed of 114 places in 201 ms
[2021-05-13 20:24:34] [INFO ] Deduced a trap composed of 109 places in 199 ms
[2021-05-13 20:24:34] [INFO ] Deduced a trap composed of 131 places in 235 ms
[2021-05-13 20:24:35] [INFO ] Deduced a trap composed of 119 places in 212 ms
[2021-05-13 20:24:35] [INFO ] Deduced a trap composed of 95 places in 203 ms
[2021-05-13 20:24:35] [INFO ] Deduced a trap composed of 110 places in 204 ms
[2021-05-13 20:24:35] [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 s28 s29 s34 s35 s36 s37 s38 s51 s52 s53 s57 s58 s59 s63 s66 s67 s73 s76 s77 s79 s80 s141 s142 s143 s154 s158 s164 s180 s192 s208 s211 s237 s238 s239 s247 s249 s252 s253 s254 s273 s277 s279 s283 s293 s307 s308 s309 s312 s314 s317 s318 s319 s322 s324 s328 s333 s343 s353 s362 s365 s366 s367 s368 s371 s372 s373 s374 s400 s401 s404 s405 s408 s409 s421 s422 s426 s427 s428 s429 s432 s433 s436 s437 s444 s445 s446 s447 s450 s451 s452 s453 s455 s459 s464 s468 s469 s470 s471 s472 s475 s476 s477 s478 s479 s490 s491 s506) 0)") while checking expression at index 10
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 42 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 1071 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 517 transition count 397
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 149 place count 443 transition count 397
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 149 place count 443 transition count 297
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 360 place count 332 transition count 297
Symmetric choice reduction at 2 with 61 rule applications. Total rules 421 place count 332 transition count 297
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 61 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 543 place count 271 transition count 236
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 543 place count 271 transition count 232
Deduced a syphon composed of 4 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 553 place count 265 transition count 232
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 688 place count 196 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 689 place count 196 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 691 place count 195 transition count 168
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 696 place count 195 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 697 place count 194 transition count 167
Applied a total of 697 rules in 141 ms. Remains 194 /518 variables (removed 324) and now considering 167/471 (removed 304) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/518 places, 167/471 transitions.
Incomplete random walk after 1000000 steps, including 44446 resets, run finished after 2097 ms. (steps per millisecond=476 ) properties seen :[1, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9515 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9394 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9555 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6673 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8714 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 167 rows 194 cols
[2021-05-13 20:24:41] [INFO ] Computed 68 place invariants in 4 ms
[2021-05-13 20:24:41] [INFO ] [Real]Absence check using 45 positive place invariants in 21 ms returned sat
[2021-05-13 20:24:41] [INFO ] [Real]Absence check using 45 positive and 23 generalized place invariants in 7 ms returned sat
[2021-05-13 20:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:41] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-13 20:24:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-13 20:24:41] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 20:24:41] [INFO ] Deduced a trap composed of 42 places in 65 ms
[2021-05-13 20:24:41] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2021-05-13 20:24:41] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2021-05-13 20:24:41] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2021-05-13 20:24:41] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2021-05-13 20:24:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 246 ms
[2021-05-13 20:24:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:24:41] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2021-05-13 20:24:41] [INFO ] [Nat]Absence check using 45 positive and 23 generalized place invariants in 7 ms returned sat
[2021-05-13 20:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:42] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-13 20:24:42] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-13 20:24:42] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2021-05-13 20:24:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2021-05-13 20:24:42] [INFO ] Computed and/alt/rep : 159/866/159 causal constraints in 10 ms.
[2021-05-13 20:24:42] [INFO ] Added : 78 causal constraints over 17 iterations in 400 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-13 20:24:42] [INFO ] [Real]Absence check using 45 positive place invariants in 29 ms returned sat
[2021-05-13 20:24:42] [INFO ] [Real]Absence check using 45 positive and 23 generalized place invariants in 11 ms returned sat
[2021-05-13 20:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:42] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-13 20:24:42] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 20:24:42] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 39 places in 94 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 42 places in 78 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 46 places in 84 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 47 places in 62 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 43 places in 71 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 44 places in 73 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 38 places in 67 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 50 places in 66 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 50 places in 66 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 43 places in 65 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 44 places in 109 ms
[2021-05-13 20:24:43] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 41 places in 269 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 42 places in 48 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 41 places in 48 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 41 places in 60 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 41 places in 183 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 40 places in 47 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 41 places in 56 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 42 places in 53 ms
[2021-05-13 20:24:44] [INFO ] Deduced a trap composed of 41 places in 44 ms
[2021-05-13 20:24:45] [INFO ] Deduced a trap composed of 42 places in 562 ms
[2021-05-13 20:24:45] [INFO ] Deduced a trap composed of 45 places in 69 ms
[2021-05-13 20:24:45] [INFO ] Deduced a trap composed of 44 places in 55 ms
[2021-05-13 20:24:45] [INFO ] Deduced a trap composed of 46 places in 55 ms
[2021-05-13 20:24:45] [INFO ] Deduced a trap composed of 8 places in 23 ms
[2021-05-13 20:24:45] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2893 ms
[2021-05-13 20:24:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:24:45] [INFO ] [Nat]Absence check using 45 positive place invariants in 21 ms returned sat
[2021-05-13 20:24:45] [INFO ] [Nat]Absence check using 45 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-13 20:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:45] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-13 20:24:45] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2021-05-13 20:24:45] [INFO ] Deduced a trap composed of 41 places in 46 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 40 places in 54 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 39 places in 62 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 44 places in 62 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 42 places in 58 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 46 places in 57 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 41 places in 57 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 39 places in 56 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 41 places in 57 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 42 places in 56 ms
[2021-05-13 20:24:46] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2021-05-13 20:24:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 746 ms
[2021-05-13 20:24:46] [INFO ] Computed and/alt/rep : 159/866/159 causal constraints in 9 ms.
[2021-05-13 20:24:47] [INFO ] Added : 75 causal constraints over 16 iterations in 369 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-13 20:24:47] [INFO ] [Real]Absence check using 45 positive place invariants in 35 ms returned sat
[2021-05-13 20:24:47] [INFO ] [Real]Absence check using 45 positive and 23 generalized place invariants in 11 ms returned sat
[2021-05-13 20:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:47] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-13 20:24:47] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 20:24:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:24:47] [INFO ] [Nat]Absence check using 45 positive place invariants in 29 ms returned sat
[2021-05-13 20:24:47] [INFO ] [Nat]Absence check using 45 positive and 23 generalized place invariants in 11 ms returned sat
[2021-05-13 20:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:47] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-13 20:24:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2021-05-13 20:24:47] [INFO ] Deduced a trap composed of 39 places in 84 ms
[2021-05-13 20:24:47] [INFO ] Deduced a trap composed of 47 places in 79 ms
[2021-05-13 20:24:47] [INFO ] Deduced a trap composed of 42 places in 79 ms
[2021-05-13 20:24:47] [INFO ] Deduced a trap composed of 43 places in 81 ms
[2021-05-13 20:24:47] [INFO ] Deduced a trap composed of 8 places in 80 ms
[2021-05-13 20:24:48] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2021-05-13 20:24:48] [INFO ] Deduced a trap composed of 43 places in 64 ms
[2021-05-13 20:24:48] [INFO ] Deduced a trap composed of 40 places in 81 ms
[2021-05-13 20:24:48] [INFO ] Deduced a trap composed of 44 places in 85 ms
[2021-05-13 20:24:48] [INFO ] Deduced a trap composed of 46 places in 73 ms
[2021-05-13 20:24:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 937 ms
[2021-05-13 20:24:48] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2021-05-13 20:24:48] [INFO ] [Real]Absence check using 45 positive and 23 generalized place invariants in 8 ms returned sat
[2021-05-13 20:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:48] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-13 20:24:48] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 20:24:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:24:48] [INFO ] [Nat]Absence check using 45 positive place invariants in 28 ms returned sat
[2021-05-13 20:24:48] [INFO ] [Nat]Absence check using 45 positive and 23 generalized place invariants in 10 ms returned sat
[2021-05-13 20:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:48] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-13 20:24:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2021-05-13 20:24:48] [INFO ] Deduced a trap composed of 27 places in 89 ms
[2021-05-13 20:24:49] [INFO ] Deduced a trap composed of 5 places in 418 ms
[2021-05-13 20:24:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 535 ms
[2021-05-13 20:24:49] [INFO ] Computed and/alt/rep : 159/866/159 causal constraints in 8 ms.
[2021-05-13 20:24:49] [INFO ] Added : 97 causal constraints over 20 iterations in 449 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-13 20:24:49] [INFO ] [Real]Absence check using 45 positive place invariants in 19 ms returned sat
[2021-05-13 20:24:49] [INFO ] [Real]Absence check using 45 positive and 23 generalized place invariants in 8 ms returned sat
[2021-05-13 20:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:24:50] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-13 20:24:50] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 20:24:50] [INFO ] Deduced a trap composed of 43 places in 54 ms
[2021-05-13 20:24:50] [INFO ] Deduced a trap composed of 40 places in 68 ms
[2021-05-13 20:24:50] [INFO ] Deduced a trap composed of 53 places in 47 ms
[2021-05-13 20:24:50] [INFO ] Deduced a trap composed of 44 places in 52 ms
[2021-05-13 20:24:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 252 ms
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 11600 steps, including 554 resets, run finished after 25 ms. (steps per millisecond=464 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 10200 steps, including 430 resets, run finished after 22 ms. (steps per millisecond=463 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9300 steps, including 399 resets, run finished after 24 ms. (steps per millisecond=387 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 22 out of 194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 194/194 places, 167/167 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 679 edges and 194 vertex of which 193 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 193 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 191 transition count 164
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 191 transition count 158
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 185 transition count 158
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 185 transition count 158
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 183 transition count 156
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 49 place count 170 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 169 transition count 142
Applied a total of 50 rules in 20 ms. Remains 169 /194 variables (removed 25) and now considering 142/167 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/194 places, 142/167 transitions.
Incomplete random walk after 1000000 steps, including 93167 resets, run finished after 2275 ms. (steps per millisecond=439 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 22612 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 22319 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19241 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties seen :[0, 0, 0]
Finished probabilistic random walk after 1022591 steps, run visited all 3 properties in 2389 ms. (steps per millisecond=428 )
Probabilistic random walk after 1022591 steps, saw 233114 distinct states, run finished after 2389 ms. (steps per millisecond=428 ) properties seen :[1, 1, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

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

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-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BusinessProcesses-PT-10, 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 r037-tajo-162038177000200"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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