fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699100487
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15719.590 21061.00 36474.00 75.90 FTTFFTTTFFTTFFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 85K 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-05-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589250857503

[2020-05-12 02:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:34:19] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2020-05-12 02:34:19] [INFO ] Transformed 368 places.
[2020-05-12 02:34:19] [INFO ] Transformed 319 transitions.
[2020-05-12 02:34:19] [INFO ] Found NUPN structural information;
[2020-05-12 02:34:19] [INFO ] Parsed PT model containing 368 places and 319 transitions in 118 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 94 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2020-05-12 02:34:19] [INFO ] Computed 57 place invariants in 12 ms
[2020-05-12 02:34:19] [INFO ] [Real]Absence check using 41 positive place invariants in 39 ms returned sat
[2020-05-12 02:34:19] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:20] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 15 places in 131 ms
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 8 places in 145 ms
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 21 places in 62 ms
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 31 places in 49 ms
[2020-05-12 02:34:20] [INFO ] Deduced a trap composed of 23 places in 47 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 33 places in 55 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 18 places in 58 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 26 places in 58 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 45 places in 44 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 22 places in 31 ms
[2020-05-12 02:34:21] [INFO ] Deduced a trap composed of 35 places in 43 ms
[2020-05-12 02:34:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1408 ms
[2020-05-12 02:34:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:34:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 64 ms returned sat
[2020-05-12 02:34:21] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:22] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2020-05-12 02:34:22] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2020-05-12 02:34:22] [INFO ] Deduced a trap composed of 8 places in 138 ms
[2020-05-12 02:34:22] [INFO ] Deduced a trap composed of 11 places in 560 ms
[2020-05-12 02:34:23] [INFO ] Deduced a trap composed of 18 places in 739 ms
[2020-05-12 02:34:23] [INFO ] Deduced a trap composed of 21 places in 87 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 18 places in 325 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 23 places in 64 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 26 places in 122 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 45 places in 49 ms
[2020-05-12 02:34:24] [INFO ] Deduced a trap composed of 22 places in 124 ms
[2020-05-12 02:34:25] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2020-05-12 02:34:25] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3023 ms
[2020-05-12 02:34:25] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 11 ms.
[2020-05-12 02:34:25] [INFO ] Added : 173 causal constraints over 35 iterations in 893 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-12 02:34:26] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned sat
[2020-05-12 02:34:26] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:26] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2020-05-12 02:34:26] [INFO ] Deduced a trap composed of 8 places in 200 ms
[2020-05-12 02:34:26] [INFO ] Deduced a trap composed of 18 places in 75 ms
[2020-05-12 02:34:26] [INFO ] Deduced a trap composed of 85 places in 78 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 11 places in 95 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 18 places in 75 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 19 places in 129 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 15 places in 74 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 91 places in 76 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 89 places in 77 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 93 places in 76 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 15 places in 85 ms
[2020-05-12 02:34:27] [INFO ] Deduced a trap composed of 40 places in 68 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 33 places in 62 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 44 places in 65 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 47 places in 93 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 96 places in 87 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 94 places in 74 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 94 places in 75 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 88 places in 62 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 35 places in 96 ms
[2020-05-12 02:34:28] [INFO ] Deduced a trap composed of 93 places in 97 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 31 places in 98 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 92 places in 70 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 93 places in 65 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 99 places in 67 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 23 places in 74 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 90 places in 76 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 92 places in 76 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 27 places in 67 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 96 places in 60 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 97 places in 68 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 97 places in 54 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 93 places in 69 ms
[2020-05-12 02:34:29] [INFO ] Deduced a trap composed of 17 places in 55 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 92 places in 102 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 90 places in 63 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 96 places in 79 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 93 places in 57 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 53 places in 56 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 91 places in 70 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 96 places in 60 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 89 places in 73 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 98 places in 73 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 99 places in 62 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 96 places in 82 ms
[2020-05-12 02:34:30] [INFO ] Deduced a trap composed of 94 places in 55 ms
[2020-05-12 02:34:31] [INFO ] Deduced a trap composed of 94 places in 123 ms
[2020-05-12 02:34:31] [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 s33 s34 s37 s44 s45 s47 s48 s51 s52 s73 s74 s75 s88 s89 s100 s101 s102 s124 s125 s126 s135 s167 s168 s169 s173 s178 s182 s183 s184 s188 s192 s194 s198 s218 s223 s232 s233 s234 s243 s248 s257 s259 s261 s263 s264 s265 s267 s268 s269 s270 s271 s272 s273 s274 s277 s278 s279 s280 s281 s282 s285 s286 s307 s308 s309 s310 s313 s314 s315 s316 s319 s322 s323 s328 s329 s330 s331 s332 s333 s340 s341 s342 s343 s344 s345 s350 s351 s358 s359 s364 s365 s366) 0)") while checking expression at index 1
[2020-05-12 02:34:31] [INFO ] [Real]Absence check using 41 positive place invariants in 28 ms returned unsat
[2020-05-12 02:34:31] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned unsat
[2020-05-12 02:34:31] [INFO ] [Real]Absence check using 41 positive place invariants in 17 ms returned unsat
[2020-05-12 02:34:31] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2020-05-12 02:34:31] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:31] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2020-05-12 02:34:31] [INFO ] Deduced a trap composed of 12 places in 94 ms
[2020-05-12 02:34:31] [INFO ] Deduced a trap composed of 11 places in 91 ms
[2020-05-12 02:34:32] [INFO ] Deduced a trap composed of 17 places in 440 ms
[2020-05-12 02:34:32] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-05-12 02:34:32] [INFO ] Deduced a trap composed of 14 places in 72 ms
[2020-05-12 02:34:32] [INFO ] Deduced a trap composed of 23 places in 82 ms
[2020-05-12 02:34:32] [INFO ] Deduced a trap composed of 19 places in 73 ms
[2020-05-12 02:34:32] [INFO ] Deduced a trap composed of 39 places in 106 ms
[2020-05-12 02:34:32] [INFO ] Deduced a trap composed of 37 places in 69 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 96 places in 80 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 97 places in 78 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 48 places in 69 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 44 places in 64 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 25 places in 200 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 88 places in 95 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 94 places in 79 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 25 places in 82 ms
[2020-05-12 02:34:33] [INFO ] Deduced a trap composed of 8 places in 78 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 29 places in 85 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 93 places in 80 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 25 places in 96 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 30 places in 84 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 34 places in 70 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 28 places in 75 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 90 places in 113 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 28 places in 105 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 33 places in 64 ms
[2020-05-12 02:34:34] [INFO ] Deduced a trap composed of 85 places in 101 ms
[2020-05-12 02:34:35] [INFO ] Deduced a trap composed of 26 places in 95 ms
[2020-05-12 02:34:35] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3414 ms
[2020-05-12 02:34:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:34:35] [INFO ] [Nat]Absence check using 41 positive place invariants in 58 ms returned sat
[2020-05-12 02:34:35] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:34:35] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2020-05-12 02:34:35] [INFO ] Deduced a trap composed of 14 places in 85 ms
[2020-05-12 02:34:35] [INFO ] Deduced a trap composed of 8 places in 89 ms
[2020-05-12 02:34:35] [INFO ] Deduced a trap composed of 11 places in 89 ms
[2020-05-12 02:34:35] [INFO ] Deduced a trap composed of 18 places in 113 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 28 places in 95 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 12 places in 72 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 19 places in 98 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 91 places in 89 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 86 places in 89 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 14 places in 79 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 23 places in 71 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 36 places in 83 ms
[2020-05-12 02:34:36] [INFO ] Deduced a trap composed of 28 places in 88 ms
[2020-05-12 02:34:37] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-05-12 02:34:37] [INFO ] Deduced a trap composed of 25 places in 83 ms
[2020-05-12 02:34:37] [INFO ] Deduced a trap composed of 36 places in 81 ms
[2020-05-12 02:34:37] [INFO ] Deduced a trap composed of 91 places in 66 ms
[2020-05-12 02:34:37] [INFO ] Deduced a trap composed of 26 places in 63 ms
[2020-05-12 02:34:37] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1956 ms
[2020-05-12 02:34:37] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 23 ms.
[2020-05-12 02:34:38] [INFO ] Added : 153 causal constraints over 31 iterations in 752 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 146 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=73 )
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589250878564

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

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