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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.570 35420.00 60034.00 83.20 TFTFFTFFFTFFFFFF 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-158897699100510.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 91K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589251574495

[2020-05-12 02:46:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:46:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:46:17] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2020-05-12 02:46:17] [INFO ] Transformed 393 places.
[2020-05-12 02:46:17] [INFO ] Transformed 344 transitions.
[2020-05-12 02:46:17] [INFO ] Found NUPN structural information;
[2020-05-12 02:46:17] [INFO ] Parsed PT model containing 393 places and 344 transitions in 119 ms.
Deduced a syphon composed of 13 places in 9 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 86 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 17 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 16 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 14 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 16 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 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 331 rows 380 cols
[2020-05-12 02:46:17] [INFO ] Computed 58 place invariants in 12 ms
[2020-05-12 02:46:17] [INFO ] [Real]Absence check using 44 positive place invariants in 49 ms returned sat
[2020-05-12 02:46:17] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-12 02:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:18] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2020-05-12 02:46:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:18] [INFO ] [Nat]Absence check using 44 positive place invariants in 78 ms returned sat
[2020-05-12 02:46:18] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-12 02:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:19] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2020-05-12 02:46:19] [INFO ] Deduced a trap composed of 13 places in 200 ms
[2020-05-12 02:46:19] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-05-12 02:46:19] [INFO ] Deduced a trap composed of 76 places in 113 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 8 places in 141 ms
[2020-05-12 02:46:20] [INFO ] Deduced a trap composed of 43 places in 370 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 24 places in 901 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 11 places in 234 ms
[2020-05-12 02:46:21] [INFO ] Deduced a trap composed of 14 places in 269 ms
[2020-05-12 02:46:22] [INFO ] Deduced a trap composed of 29 places in 230 ms
[2020-05-12 02:46:22] [INFO ] Deduced a trap composed of 88 places in 233 ms
[2020-05-12 02:46:22] [INFO ] Deduced a trap composed of 42 places in 252 ms
[2020-05-12 02:46:22] [INFO ] Deduced a trap composed of 16 places in 128 ms
[2020-05-12 02:46:23] [INFO ] Deduced a trap composed of 91 places in 217 ms
[2020-05-12 02:46:23] [INFO ] Deduced a trap composed of 91 places in 138 ms
[2020-05-12 02:46:23] [INFO ] Deduced a trap composed of 82 places in 137 ms
[2020-05-12 02:46:24] [INFO ] Deduced a trap composed of 85 places in 674 ms
[2020-05-12 02:46:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s39 s40 s64 s69 s70 s91 s92 s118 s119 s161 s163 s167 s179 s189 s194 s199 s203 s204 s205 s218 s220 s224 s233 s234 s235 s239 s243 s244 s245 s254 s259 s268 s269 s270 s274 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s290 s291 s294 s297 s298 s299 s300 s301 s302 s305 s310 s311 s312 s313 s316 s317 s318 s319 s320 s325 s326 s327 s328 s329 s330 s333 s334 s349 s350 s359 s360 s363 s364 s369 s370 s375 s376 s379) 0)") while checking expression at index 0
[2020-05-12 02:46:24] [INFO ] [Real]Absence check using 44 positive place invariants in 59 ms returned sat
[2020-05-12 02:46:24] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 8 ms returned sat
[2020-05-12 02:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:24] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2020-05-12 02:46:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:25] [INFO ] [Nat]Absence check using 44 positive place invariants in 146 ms returned unsat
[2020-05-12 02:46:25] [INFO ] [Real]Absence check using 44 positive place invariants in 54 ms returned sat
[2020-05-12 02:46:25] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-12 02:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:25] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2020-05-12 02:46:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:25] [INFO ] [Nat]Absence check using 44 positive place invariants in 30 ms returned sat
[2020-05-12 02:46:25] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-12 02:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:26] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2020-05-12 02:46:26] [INFO ] Deduced a trap composed of 13 places in 272 ms
[2020-05-12 02:46:26] [INFO ] Deduced a trap composed of 97 places in 87 ms
[2020-05-12 02:46:26] [INFO ] Deduced a trap composed of 33 places in 92 ms
[2020-05-12 02:46:26] [INFO ] Deduced a trap composed of 19 places in 84 ms
[2020-05-12 02:46:26] [INFO ] Deduced a trap composed of 22 places in 82 ms
[2020-05-12 02:46:27] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-05-12 02:46:27] [INFO ] Deduced a trap composed of 28 places in 46 ms
[2020-05-12 02:46:27] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2020-05-12 02:46:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1012 ms
[2020-05-12 02:46:27] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 22 ms.
[2020-05-12 02:46:28] [INFO ] Added : 225 causal constraints over 46 iterations in 1803 ms. Result :sat
[2020-05-12 02:46:29] [INFO ] Deduced a trap composed of 95 places in 869 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 94 places in 183 ms
[2020-05-12 02:46:30] [INFO ] Deduced a trap composed of 90 places in 208 ms
[2020-05-12 02:46:31] [INFO ] Deduced a trap composed of 93 places in 1381 ms
[2020-05-12 02:46: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 s39 s40 s48 s49 s50 s51 s52 s53 s56 s57 s80 s81 s91 s92 s118 s119 s137 s138 s162 s167 s171 s184 s189 s204 s209 s234 s239 s249 s254 s259 s264 s267 s269 s270 s271 s274 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s294 s295 s296 s299 s300 s301 s302 s305 s308 s309 s310 s311 s323 s324 s325 s326 s331 s332 s333 s334 s335 s336 s337 s338 s343 s344 s347 s348 s349 s350 s355 s356 s359 s360 s361 s362 s363 s364 s375 s376 s379) 0)") while checking expression at index 2
[2020-05-12 02:46:31] [INFO ] [Real]Absence check using 44 positive place invariants in 21 ms returned sat
[2020-05-12 02:46:31] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-12 02:46:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:32] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2020-05-12 02:46:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:32] [INFO ] [Nat]Absence check using 44 positive place invariants in 274 ms returned sat
[2020-05-12 02:46:32] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 139 ms returned sat
[2020-05-12 02:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:33] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 13 places in 186 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 15 places in 192 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 12 places in 108 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 28 places in 88 ms
[2020-05-12 02:46:33] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 15 places in 86 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 19 places in 107 ms
[2020-05-12 02:46:34] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 20 places in 2112 ms
[2020-05-12 02:46:36] [INFO ] Deduced a trap composed of 24 places in 55 ms
[2020-05-12 02:46:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3589 ms
[2020-05-12 02:46:36] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 31 ms.
[2020-05-12 02:46:37] [INFO ] Added : 120 causal constraints over 24 iterations in 680 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-12 02:46:37] [INFO ] [Real]Absence check using 44 positive place invariants in 151 ms returned sat
[2020-05-12 02:46:37] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 32 ms returned sat
[2020-05-12 02:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:38] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2020-05-12 02:46:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:38] [INFO ] [Nat]Absence check using 44 positive place invariants in 45 ms returned sat
[2020-05-12 02:46:38] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-12 02:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:38] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 8 places in 104 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 98 places in 103 ms
[2020-05-12 02:46:38] [INFO ] Deduced a trap composed of 86 places in 101 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 35 places in 95 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 12 places in 82 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 16 places in 83 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 22 places in 81 ms
[2020-05-12 02:46:39] [INFO ] Deduced a trap composed of 25 places in 321 ms
[2020-05-12 02:46:40] [INFO ] Deduced a trap composed of 19 places in 729 ms
[2020-05-12 02:46:42] [INFO ] Deduced a trap composed of 15 places in 2188 ms
[2020-05-12 02:46:42] [INFO ] Deduced a trap composed of 24 places in 139 ms
[2020-05-12 02:46:43] [INFO ] Deduced a trap composed of 95 places in 855 ms
[2020-05-12 02:46:43] [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 s27 s28 s32 s33 s48 s49 s50 s51 s56 s57 s61 s62 s63 s91 s92 s118 s119 s133 s136 s161 s162 s163 s179 s184 s188 s190 s193 s194 s195 s198 s200 s203 s205 s209 s223 s224 s225 s229 s234 s244 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s292 s293 s303 s304 s305 s306 s307 s329 s330 s331 s332 s333 s334 s335 s336 s341 s342 s345 s346 s347 s348 s349 s350 s357 s358 s359 s360 s363 s364 s365 s366 s367 s368 s369 s370 s373 s374 s375 s376 s377 s378 s379) 0)") while checking expression at index 4
[2020-05-12 02:46:43] [INFO ] [Real]Absence check using 44 positive place invariants in 237 ms returned sat
[2020-05-12 02:46:43] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 14 ms returned sat
[2020-05-12 02:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:44] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2020-05-12 02:46:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:46:44] [INFO ] [Nat]Absence check using 44 positive place invariants in 53 ms returned sat
[2020-05-12 02:46:44] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-12 02:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:46:45] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2020-05-12 02:46:45] [INFO ] Deduced a trap composed of 16 places in 154 ms
[2020-05-12 02:46:45] [INFO ] Deduced a trap composed of 15 places in 124 ms
[2020-05-12 02:46:45] [INFO ] Deduced a trap composed of 16 places in 111 ms
[2020-05-12 02:46:48] [INFO ] Deduced a trap composed of 13 places in 2369 ms
[2020-05-12 02:46:48] [INFO ] Deduced a trap composed of 12 places in 104 ms
[2020-05-12 02:46:48] [INFO ] Deduced a trap composed of 22 places in 79 ms
[2020-05-12 02:46:48] [INFO ] Deduced a trap composed of 22 places in 56 ms
[2020-05-12 02:46:48] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2020-05-12 02:46:48] [INFO ] Deduced a trap composed of 44 places in 63 ms
[2020-05-12 02:46:48] [INFO ] Deduced a trap composed of 20 places in 48 ms
[2020-05-12 02:46:48] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2020-05-12 02:46:49] [INFO ] Deduced a trap composed of 27 places in 59 ms
[2020-05-12 02:46:49] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-05-12 02:46:49] [INFO ] Deduced a trap composed of 46 places in 67 ms
[2020-05-12 02:46:49] [INFO ] Deduced a trap composed of 34 places in 53 ms
[2020-05-12 02:46:49] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3822 ms
[2020-05-12 02:46:49] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 19 ms.
[2020-05-12 02:46:49] [INFO ] Added : 50 causal constraints over 10 iterations in 180 ms. Result :unknown
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 13000 steps, including 117 resets, run finished after 30 ms. (steps per millisecond=433 ) properties seen :[0, 1, 0, 1, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Graph (trivial) has 230 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 9 ms
Free SCC test removed 7 places
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 724 edges and 373 vertex of which 364 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.30 ms
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Iterating post reduction 0 with 100 rules applied. Total rules applied 102 place count 364 transition count 230
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 191 place count 275 transition count 230
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 191 place count 275 transition count 177
Deduced a syphon composed of 53 places in 15 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 308 place count 211 transition count 177
Symmetric choice reduction at 2 with 63 rule applications. Total rules 371 place count 211 transition count 177
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 63 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 497 place count 148 transition count 114
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 497 place count 148 transition count 110
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 506 place count 143 transition count 110
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 610 place count 91 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 611 place count 90 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 612 place count 89 transition count 57
Applied a total of 612 rules in 152 ms. Remains 89 /380 variables (removed 291) and now considering 57/331 (removed 274) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/380 places, 57/331 transitions.
Finished random walk after 565 steps, including 18 resets, run visited all 2 properties in 6 ms. (steps per millisecond=94 )
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589251609915

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-08, examination is ReachabilityCardinality"
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-158897699100510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-08.tgz
mv BusinessProcesses-PT-08 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;