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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 157K 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-15-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589255760245

[2020-05-12 03:56:02] [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 03:56:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:56:02] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2020-05-12 03:56:02] [INFO ] Transformed 630 places.
[2020-05-12 03:56:02] [INFO ] Transformed 566 transitions.
[2020-05-12 03:56:02] [INFO ] Found NUPN structural information;
[2020-05-12 03:56:02] [INFO ] Parsed PT model containing 630 places and 566 transitions in 130 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 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, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 562 rows 626 cols
[2020-05-12 03:56:02] [INFO ] Computed 102 place invariants in 27 ms
[2020-05-12 03:56:02] [INFO ] [Real]Absence check using 61 positive place invariants in 51 ms returned sat
[2020-05-12 03:56:02] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 27 ms returned sat
[2020-05-12 03:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:03] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2020-05-12 03:56:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:56:03] [INFO ] [Nat]Absence check using 61 positive place invariants in 47 ms returned sat
[2020-05-12 03:56:03] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:04] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2020-05-12 03:56:04] [INFO ] Deduced a trap composed of 18 places in 224 ms
[2020-05-12 03:56:05] [INFO ] Deduced a trap composed of 13 places in 204 ms
[2020-05-12 03:56:05] [INFO ] Deduced a trap composed of 12 places in 186 ms
[2020-05-12 03:56:05] [INFO ] Deduced a trap composed of 17 places in 188 ms
[2020-05-12 03:56:05] [INFO ] Deduced a trap composed of 18 places in 225 ms
[2020-05-12 03:56:06] [INFO ] Deduced a trap composed of 12 places in 191 ms
[2020-05-12 03:56:06] [INFO ] Deduced a trap composed of 25 places in 176 ms
[2020-05-12 03:56:06] [INFO ] Deduced a trap composed of 123 places in 171 ms
[2020-05-12 03:56:06] [INFO ] Deduced a trap composed of 24 places in 230 ms
[2020-05-12 03:56:06] [INFO ] Deduced a trap composed of 28 places in 180 ms
[2020-05-12 03:56:07] [INFO ] Deduced a trap composed of 26 places in 193 ms
[2020-05-12 03:56:07] [INFO ] Deduced a trap composed of 30 places in 186 ms
[2020-05-12 03:56:07] [INFO ] Deduced a trap composed of 38 places in 189 ms
[2020-05-12 03:56:07] [INFO ] Deduced a trap composed of 138 places in 165 ms
[2020-05-12 03:56:08] [INFO ] Deduced a trap composed of 39 places in 166 ms
[2020-05-12 03:56:08] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-05-12 03:56:08] [INFO ] Deduced a trap composed of 143 places in 170 ms
[2020-05-12 03:56:08] [INFO ] Deduced a trap composed of 139 places in 135 ms
[2020-05-12 03:56:08] [INFO ] Deduced a trap composed of 20 places in 161 ms
[2020-05-12 03:56:08] [INFO ] Deduced a trap composed of 35 places in 154 ms
[2020-05-12 03:56:08] [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 s218 s219 s220 s238 s239 s240 s318 s406 s407 s408 s412 s416 s417 s418 s422 s427 s432 s437 s478 s479 s482 s565 s566 s573 s574 s577 s578 s587 s588) 0)") while checking expression at index 0
[2020-05-12 03:56:09] [INFO ] [Real]Absence check using 61 positive place invariants in 42 ms returned sat
[2020-05-12 03:56:09] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2020-05-12 03:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:09] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2020-05-12 03:56:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:56:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 43 ms returned sat
[2020-05-12 03:56:10] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:10] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2020-05-12 03:56:11] [INFO ] Deduced a trap composed of 20 places in 238 ms
[2020-05-12 03:56:11] [INFO ] Deduced a trap composed of 131 places in 226 ms
[2020-05-12 03:56:11] [INFO ] Deduced a trap composed of 20 places in 249 ms
[2020-05-12 03:56:11] [INFO ] Deduced a trap composed of 138 places in 217 ms
[2020-05-12 03:56:12] [INFO ] Deduced a trap composed of 136 places in 215 ms
[2020-05-12 03:56:12] [INFO ] Deduced a trap composed of 122 places in 207 ms
[2020-05-12 03:56:12] [INFO ] Deduced a trap composed of 137 places in 280 ms
[2020-05-12 03:56:12] [INFO ] Deduced a trap composed of 121 places in 257 ms
[2020-05-12 03:56:13] [INFO ] Deduced a trap composed of 124 places in 218 ms
[2020-05-12 03:56:13] [INFO ] Deduced a trap composed of 144 places in 246 ms
[2020-05-12 03:56:13] [INFO ] Deduced a trap composed of 23 places in 228 ms
[2020-05-12 03:56:14] [INFO ] Deduced a trap composed of 123 places in 231 ms
[2020-05-12 03:56:14] [INFO ] Deduced a trap composed of 129 places in 220 ms
[2020-05-12 03:56:14] [INFO ] Deduced a trap composed of 113 places in 329 ms
[2020-05-12 03:56:14] [INFO ] Deduced a trap composed of 137 places in 226 ms
[2020-05-12 03:56:15] [INFO ] Deduced a trap composed of 123 places in 229 ms
[2020-05-12 03:56:15] [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 s41 s42 s43 s44 s45 s54 s55 s143 s144 s145 s168 s173 s174 s206 s207 s208 s221 s243 s244 s245 s292 s293 s294 s297 s299 s302 s303 s304 s308 s313 s318 s336 s337 s338 s341 s343 s356 s358 s361 s362 s363 s367 s372 s377 s382 s387 s392 s402 s407 s417 s426 s427 s428 s442 s446 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s476 s477 s478 s479 s482 s485 s486 s487 s488 s489 s490 s497 s498 s499 s500 s501 s502 s526 s527 s528 s529 s534 s535 s538 s539 s540 s541 s546 s547 s550 s551 s557 s558 s565 s566 s569 s570 s571 s572 s573 s574 s581 s582 s583 s584 s585 s586 s591 s623) 0)") while checking expression at index 1
[2020-05-12 03:56:15] [INFO ] [Real]Absence check using 61 positive place invariants in 41 ms returned sat
[2020-05-12 03:56:15] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 32 ms returned sat
[2020-05-12 03:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:16] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2020-05-12 03:56:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:56:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 46 ms returned sat
[2020-05-12 03:56:16] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 28 ms returned sat
[2020-05-12 03:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:16] [INFO ] [Nat]Absence check using state equation in 785 ms returned sat
[2020-05-12 03:56:17] [INFO ] Deduced a trap composed of 18 places in 244 ms
[2020-05-12 03:56:17] [INFO ] Deduced a trap composed of 15 places in 228 ms
[2020-05-12 03:56:17] [INFO ] Deduced a trap composed of 27 places in 211 ms
[2020-05-12 03:56:17] [INFO ] Deduced a trap composed of 122 places in 214 ms
[2020-05-12 03:56:18] [INFO ] Deduced a trap composed of 16 places in 262 ms
[2020-05-12 03:56:18] [INFO ] Deduced a trap composed of 142 places in 211 ms
[2020-05-12 03:56:18] [INFO ] Deduced a trap composed of 30 places in 179 ms
[2020-05-12 03:56:18] [INFO ] Deduced a trap composed of 22 places in 266 ms
[2020-05-12 03:56:19] [INFO ] Deduced a trap composed of 12 places in 250 ms
[2020-05-12 03:56:19] [INFO ] Deduced a trap composed of 128 places in 167 ms
[2020-05-12 03:56:19] [INFO ] Deduced a trap composed of 20 places in 199 ms
[2020-05-12 03:56:19] [INFO ] Deduced a trap composed of 27 places in 197 ms
[2020-05-12 03:56:20] [INFO ] Deduced a trap composed of 17 places in 171 ms
[2020-05-12 03:56:20] [INFO ] Deduced a trap composed of 33 places in 203 ms
[2020-05-12 03:56:20] [INFO ] Deduced a trap composed of 12 places in 166 ms
[2020-05-12 03:56:20] [INFO ] Deduced a trap composed of 32 places in 172 ms
[2020-05-12 03:56:20] [INFO ] Deduced a trap composed of 39 places in 156 ms
[2020-05-12 03:56:21] [INFO ] Deduced a trap composed of 122 places in 145 ms
[2020-05-12 03:56:21] [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 s30 s31 s34 s35 s41 s42 s54 s55 s56 s57 s58 s65 s66 s69 s70 s71 s72 s73 s74 s75 s76 s83 s84 s85 s168 s173 s174 s195 s196 s197 s243 s244 s245 s251 s254 s288 s307 s308 s309 s318 s337 s342 s357 s361 s363 s376 s377 s378 s387 s392 s406 s408 s411 s412 s413 s422 s427 s437 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s463 s464 s470 s471 s487 s488 s501 s502 s522 s523 s524 s525 s528 s529 s538 s539 s540 s541 s546 s547 s550 s551 s554 s555 s556 s563 s564 s565 s566 s567 s568 s569 s570 s573 s574 s577 s578 s581 s582 s583 s584 s589 s590 s591 s621 s622) 0)") while checking expression at index 2
[2020-05-12 03:56:21] [INFO ] [Real]Absence check using 61 positive place invariants in 36 ms returned sat
[2020-05-12 03:56:21] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:22] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2020-05-12 03:56:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:56:22] [INFO ] [Nat]Absence check using 61 positive place invariants in 58 ms returned sat
[2020-05-12 03:56:22] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2020-05-12 03:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:22] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2020-05-12 03:56:23] [INFO ] Deduced a trap composed of 13 places in 207 ms
[2020-05-12 03:56:23] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2020-05-12 03:56:23] [INFO ] Deduced a trap composed of 12 places in 184 ms
[2020-05-12 03:56:23] [INFO ] Deduced a trap composed of 19 places in 180 ms
[2020-05-12 03:56:24] [INFO ] Deduced a trap composed of 16 places in 206 ms
[2020-05-12 03:56:24] [INFO ] Deduced a trap composed of 18 places in 193 ms
[2020-05-12 03:56:24] [INFO ] Deduced a trap composed of 37 places in 207 ms
[2020-05-12 03:56:24] [INFO ] Deduced a trap composed of 118 places in 234 ms
[2020-05-12 03:56:24] [INFO ] Deduced a trap composed of 125 places in 198 ms
[2020-05-12 03:56:25] [INFO ] Deduced a trap composed of 117 places in 183 ms
[2020-05-12 03:56:25] [INFO ] Deduced a trap composed of 27 places in 195 ms
[2020-05-12 03:56:25] [INFO ] Deduced a trap composed of 31 places in 169 ms
[2020-05-12 03:56:25] [INFO ] Deduced a trap composed of 16 places in 177 ms
[2020-05-12 03:56:26] [INFO ] Deduced a trap composed of 24 places in 170 ms
[2020-05-12 03:56:26] [INFO ] Deduced a trap composed of 31 places in 160 ms
[2020-05-12 03:56:26] [INFO ] Deduced a trap composed of 35 places in 163 ms
[2020-05-12 03:56:26] [INFO ] Deduced a trap composed of 112 places in 161 ms
[2020-05-12 03:56:26] [INFO ] Deduced a trap composed of 24 places in 170 ms
[2020-05-12 03:56:26] [INFO ] Deduced a trap composed of 124 places in 157 ms
[2020-05-12 03:56:27] [INFO ] Deduced a trap composed of 28 places in 160 ms
[2020-05-12 03:56:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 03:56:27] [INFO ] Deduced a trap composed of 6 places in 330 ms
[2020-05-12 03:56:27] [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 s246) 0)") while checking expression at index 3
[2020-05-12 03:56:27] [INFO ] [Real]Absence check using 61 positive place invariants in 36 ms returned sat
[2020-05-12 03:56:27] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 33 ms returned sat
[2020-05-12 03:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:28] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2020-05-12 03:56:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:56:28] [INFO ] [Nat]Absence check using 61 positive place invariants in 109 ms returned sat
[2020-05-12 03:56:28] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2020-05-12 03:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:29] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2020-05-12 03:56:29] [INFO ] Deduced a trap composed of 19 places in 196 ms
[2020-05-12 03:56:29] [INFO ] Deduced a trap composed of 23 places in 166 ms
[2020-05-12 03:56:29] [INFO ] Deduced a trap composed of 12 places in 217 ms
[2020-05-12 03:56:30] [INFO ] Deduced a trap composed of 23 places in 161 ms
[2020-05-12 03:56:30] [INFO ] Deduced a trap composed of 155 places in 179 ms
[2020-05-12 03:56:30] [INFO ] Deduced a trap composed of 13 places in 172 ms
[2020-05-12 03:56:30] [INFO ] Deduced a trap composed of 20 places in 217 ms
[2020-05-12 03:56:30] [INFO ] Deduced a trap composed of 12 places in 104 ms
[2020-05-12 03:56:31] [INFO ] Deduced a trap composed of 22 places in 121 ms
[2020-05-12 03:56:31] [INFO ] Deduced a trap composed of 11 places in 118 ms
[2020-05-12 03:56:31] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2020-05-12 03:56:31] [INFO ] Deduced a trap composed of 26 places in 119 ms
[2020-05-12 03:56:31] [INFO ] Deduced a trap composed of 21 places in 115 ms
[2020-05-12 03:56:31] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2020-05-12 03:56:31] [INFO ] Deduced a trap composed of 17 places in 132 ms
[2020-05-12 03:56:32] [INFO ] Deduced a trap composed of 24 places in 114 ms
[2020-05-12 03:56:32] [INFO ] Deduced a trap composed of 22 places in 105 ms
[2020-05-12 03:56:32] [INFO ] Deduced a trap composed of 22 places in 163 ms
[2020-05-12 03:56:32] [INFO ] Deduced a trap composed of 18 places in 128 ms
[2020-05-12 03:56:32] [INFO ] Deduced a trap composed of 21 places in 115 ms
[2020-05-12 03:56:32] [INFO ] Deduced a trap composed of 29 places in 108 ms
[2020-05-12 03:56:32] [INFO ] Deduced a trap composed of 24 places in 119 ms
[2020-05-12 03:56:33] [INFO ] Deduced a trap composed of 33 places in 136 ms
[2020-05-12 03:56:33] [INFO ] Deduced a trap composed of 31 places in 133 ms
[2020-05-12 03:56:33] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4021 ms
[2020-05-12 03:56:33] [INFO ] Computed and/alt/rep : 561/2502/561 causal constraints in 27 ms.
[2020-05-12 03:56:33] [INFO ] Added : 5 causal constraints over 1 iterations in 100 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-12 03:56:33] [INFO ] [Real]Absence check using 61 positive place invariants in 53 ms returned sat
[2020-05-12 03:56:33] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 42 ms returned sat
[2020-05-12 03:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:34] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2020-05-12 03:56:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:56:34] [INFO ] [Nat]Absence check using 61 positive place invariants in 63 ms returned sat
[2020-05-12 03:56:34] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 29 ms returned sat
[2020-05-12 03:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:35] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2020-05-12 03:56:35] [INFO ] Deduced a trap composed of 23 places in 144 ms
[2020-05-12 03:56:35] [INFO ] Deduced a trap composed of 16 places in 138 ms
[2020-05-12 03:56:35] [INFO ] Deduced a trap composed of 12 places in 133 ms
[2020-05-12 03:56:36] [INFO ] Deduced a trap composed of 17 places in 135 ms
[2020-05-12 03:56:36] [INFO ] Deduced a trap composed of 21 places in 143 ms
[2020-05-12 03:56:36] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-05-12 03:56:36] [INFO ] Deduced a trap composed of 18 places in 131 ms
[2020-05-12 03:56:36] [INFO ] Deduced a trap composed of 32 places in 125 ms
[2020-05-12 03:56:36] [INFO ] Deduced a trap composed of 26 places in 137 ms
[2020-05-12 03:56:36] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-05-12 03:56:37] [INFO ] Deduced a trap composed of 17 places in 122 ms
[2020-05-12 03:56:37] [INFO ] Deduced a trap composed of 22 places in 140 ms
[2020-05-12 03:56:37] [INFO ] Deduced a trap composed of 24 places in 128 ms
[2020-05-12 03:56:37] [INFO ] Deduced a trap composed of 34 places in 136 ms
[2020-05-12 03:56:37] [INFO ] Deduced a trap composed of 25 places in 129 ms
[2020-05-12 03:56:37] [INFO ] Deduced a trap composed of 28 places in 127 ms
[2020-05-12 03:56:38] [INFO ] Deduced a trap composed of 32 places in 124 ms
[2020-05-12 03:56:38] [INFO ] Deduced a trap composed of 37 places in 125 ms
[2020-05-12 03:56:38] [INFO ] Deduced a trap composed of 28 places in 124 ms
[2020-05-12 03:56:38] [INFO ] Deduced a trap composed of 32 places in 124 ms
[2020-05-12 03:56:38] [INFO ] Deduced a trap composed of 21 places in 154 ms
[2020-05-12 03:56:38] [INFO ] Deduced a trap composed of 47 places in 103 ms
[2020-05-12 03:56:38] [INFO ] Deduced a trap composed of 46 places in 115 ms
[2020-05-12 03:56:39] [INFO ] Deduced a trap composed of 53 places in 96 ms
[2020-05-12 03:56:39] [INFO ] Deduced a trap composed of 31 places in 96 ms
[2020-05-12 03:56:39] [INFO ] Deduced a trap composed of 36 places in 92 ms
[2020-05-12 03:56:39] [INFO ] Deduced a trap composed of 99 places in 95 ms
[2020-05-12 03:56:39] [INFO ] Deduced a trap composed of 32 places in 91 ms
[2020-05-12 03:56:39] [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 s49 s52 s53 s212 s213 s214 s224 s225 s226 s238 s239 s251 s254 s412 s416 s417 s418 s422 s427 s432 s437 s442 s478 s479 s482 s577 s578 s587 s588) 0)") while checking expression at index 5
[2020-05-12 03:56:39] [INFO ] [Real]Absence check using 61 positive place invariants in 36 ms returned sat
[2020-05-12 03:56:39] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2020-05-12 03:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:40] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2020-05-12 03:56:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:56:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 40 ms returned sat
[2020-05-12 03:56:40] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 26 ms returned sat
[2020-05-12 03:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:41] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2020-05-12 03:56:41] [INFO ] Deduced a trap composed of 12 places in 209 ms
[2020-05-12 03:56:41] [INFO ] Deduced a trap composed of 21 places in 199 ms
[2020-05-12 03:56:42] [INFO ] Deduced a trap composed of 19 places in 197 ms
[2020-05-12 03:56:42] [INFO ] Deduced a trap composed of 118 places in 200 ms
[2020-05-12 03:56:42] [INFO ] Deduced a trap composed of 39 places in 228 ms
[2020-05-12 03:56:42] [INFO ] Deduced a trap composed of 34 places in 193 ms
[2020-05-12 03:56:43] [INFO ] Deduced a trap composed of 25 places in 204 ms
[2020-05-12 03:56:43] [INFO ] Deduced a trap composed of 35 places in 210 ms
[2020-05-12 03:56:43] [INFO ] Deduced a trap composed of 31 places in 229 ms
[2020-05-12 03:56:43] [INFO ] Deduced a trap composed of 20 places in 172 ms
[2020-05-12 03:56:43] [INFO ] Deduced a trap composed of 20 places in 226 ms
[2020-05-12 03:56:44] [INFO ] Deduced a trap composed of 21 places in 205 ms
[2020-05-12 03:56:44] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2020-05-12 03:56:44] [INFO ] Deduced a trap composed of 18 places in 188 ms
[2020-05-12 03:56:44] [INFO ] Deduced a trap composed of 41 places in 191 ms
[2020-05-12 03:56:44] [INFO ] Deduced a trap composed of 38 places in 171 ms
[2020-05-12 03:56:45] [INFO ] Deduced a trap composed of 31 places in 200 ms
[2020-05-12 03:56:45] [INFO ] Deduced a trap composed of 29 places in 281 ms
[2020-05-12 03:56:45] [INFO ] Deduced a trap composed of 125 places in 222 ms
[2020-05-12 03:56:45] [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 s30 s31 s34 s35 s50 s51 s54 s55 s59 s60 s61 s65 s66 s67 s68 s69 s70 s75 s76 s149 s150 s151 s152 s155 s156 s184 s185 s186 s190 s191 s192 s212 s213 s214 s238 s239 s243 s244 s245 s251 s254 s287 s289 s303 s327 s332 s341 s342 s343 s346 s347 s348 s351 s352 s353 s356 s357 s358 s361 s362 s363 s367 s371 s373 s381 s382 s383 s386 s387 s388 s392 s432 s437 s446 s449 s450 s451 s452 s456 s457 s458 s463 s464 s474 s475 s476 s477 s480 s481 s491 s492 s524 s525 s534 s535 s542 s543 s546 s547 s552 s553 s561 s562 s563 s564 s567 s568 s569 s570 s571 s572 s573 s574 s575 s576 s577 s578 s579 s580 s589 s590 s591) 0)") while checking expression at index 6
Support contains 23 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 339 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1267 edges and 620 vertex of which 618 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 618 transition count 421
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 276 place count 485 transition count 421
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 276 place count 485 transition count 331
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 473 place count 378 transition count 331
Symmetric choice reduction at 2 with 71 rule applications. Total rules 544 place count 378 transition count 331
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 71 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 686 place count 307 transition count 260
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 686 place count 307 transition count 253
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 702 place count 298 transition count 253
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 886 place count 205 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 888 place count 204 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 890 place count 204 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 892 place count 202 transition count 164
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 897 place count 202 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 898 place count 201 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 899 place count 200 transition count 163
Applied a total of 899 rules in 124 ms. Remains 200 /626 variables (removed 426) and now considering 163/562 (removed 399) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/626 places, 163/562 transitions.
Incomplete random walk after 1000000 steps, including 18818 resets, run finished after 1907 ms. (steps per millisecond=524 ) properties seen :[0, 1, 1, 1, 1, 0, 1]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 8115 resets, run finished after 1168 ms. (steps per millisecond=856 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6119 resets, run finished after 1190 ms. (steps per millisecond=840 ) properties seen :[0, 1]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 163 rows 200 cols
[2020-05-12 03:56:50] [INFO ] Computed 78 place invariants in 13 ms
[2020-05-12 03:56:50] [INFO ] [Real]Absence check using 59 positive place invariants in 296 ms returned sat
[2020-05-12 03:56:50] [INFO ] [Real]Absence check using 59 positive and 19 generalized place invariants in 13 ms returned sat
[2020-05-12 03:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:51] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2020-05-12 03:56:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:56:51] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2020-05-12 03:56:51] [INFO ] [Nat]Absence check using 59 positive and 19 generalized place invariants in 13 ms returned sat
[2020-05-12 03:56:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:56:51] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2020-05-12 03:56:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-05-12 03:56:51] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2020-05-12 03:56:51] [INFO ] Deduced a trap composed of 43 places in 57 ms
[2020-05-12 03:56:51] [INFO ] Deduced a trap composed of 43 places in 51 ms
[2020-05-12 03:56:51] [INFO ] Deduced a trap composed of 45 places in 61 ms
[2020-05-12 03:56:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2020-05-12 03:56:51] [INFO ] Computed and/alt/rep : 159/605/159 causal constraints in 9 ms.
[2020-05-12 03:56:52] [INFO ] Added : 81 causal constraints over 17 iterations in 402 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
Incomplete Parikh walk after 10900 steps, including 789 resets, run finished after 24 ms. (steps per millisecond=454 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 163/163 transitions.
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 670 edges and 200 vertex of which 198 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 198 transition count 157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 193 transition count 157
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 193 transition count 153
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 22 place count 186 transition count 153
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 186 transition count 153
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 184 transition count 151
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 170 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 169 transition count 136
Applied a total of 57 rules in 24 ms. Remains 169 /200 variables (removed 31) and now considering 136/163 (removed 27) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/200 places, 136/163 transitions.
Incomplete random walk after 1000000 steps, including 28347 resets, run finished after 1851 ms. (steps per millisecond=540 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 17396 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties seen :[0]
Finished probabilistic random walk after 309 steps, run visited all 1 properties in 7 ms. (steps per millisecond=44 )
Probabilistic random walk after 309 steps, saw 137 distinct states, run finished after 7 ms. (steps per millisecond=44 ) properties seen :[1]
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589255815655

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

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