fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r028-tall-165251936100165
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for BusinessProcesses-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
332.340 40452.00 58100.00 789.20 TTTTTTTTFFTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100165.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is BusinessProcesses-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 23:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 29 23:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 29 23:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 29 23:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 157K May 10 09:33 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-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083320155

Running Version 0
[2022-06-13 01:22:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:22:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:22:03] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2022-06-13 01:22:03] [INFO ] Transformed 630 places.
[2022-06-13 01:22:03] [INFO ] Transformed 566 transitions.
[2022-06-13 01:22:03] [INFO ] Found NUPN structural information;
[2022-06-13 01:22:03] [INFO ] Parsed PT model containing 630 places and 566 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 562 rows 626 cols
[2022-06-13 01:22:03] [INFO ] Computed 102 place invariants in 45 ms
[2022-06-13 01:22:03] [INFO ] [Real]Absence check using 61 positive place invariants in 32 ms returned sat
[2022-06-13 01:22:03] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2022-06-13 01:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:04] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-06-13 01:22:04] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 4 ms to minimize.
[2022-06-13 01:22:04] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2022-06-13 01:22:04] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2022-06-13 01:22:04] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2022-06-13 01:22:04] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2022-06-13 01:22:04] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2022-06-13 01:22:04] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:22:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1815 ms
[2022-06-13 01:22:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:06] [INFO ] [Nat]Absence check using 61 positive place invariants in 35 ms returned sat
[2022-06-13 01:22:06] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2022-06-13 01:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:06] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:22:08] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2022-06-13 01:22:08] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1842 ms
[2022-06-13 01:22:08] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 40 ms.
[2022-06-13 01:22:11] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2022-06-13 01:22:11] [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 close... while checking expression at index 0
[2022-06-13 01:22:11] [INFO ] [Real]Absence check using 61 positive place invariants in 28 ms returned sat
[2022-06-13 01:22:11] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2022-06-13 01:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:11] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2022-06-13 01:22:11] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:22:11] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:22:11] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:22:12] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:22:12] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:22:12] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:22:12] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:22:12] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:22:12] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 145 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 10 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 140 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 141 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 142 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 138 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:22:16] [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 close... while checking expression at index 1
[2022-06-13 01:22:16] [INFO ] [Real]Absence check using 61 positive place invariants in 35 ms returned sat
[2022-06-13 01:22:16] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 36 ms returned sat
[2022-06-13 01:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:17] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2022-06-13 01:22:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:17] [INFO ] [Nat]Absence check using 61 positive place invariants in 30 ms returned unsat
[2022-06-13 01:22:17] [INFO ] [Real]Absence check using 61 positive place invariants in 34 ms returned sat
[2022-06-13 01:22:18] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 27 ms returned sat
[2022-06-13 01:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:18] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2022-06-13 01:22:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:18] [INFO ] [Nat]Absence check using 61 positive place invariants in 13 ms returned unsat
[2022-06-13 01:22:18] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2022-06-13 01:22:19] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-06-13 01:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:19] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:20] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:20] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:22:20] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:22:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1040 ms
[2022-06-13 01:22:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:20] [INFO ] [Nat]Absence check using 61 positive place invariants in 25 ms returned sat
[2022-06-13 01:22:20] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-06-13 01:22:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:20] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-06-13 01:22:20] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2022-06-13 01:22:20] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:20] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 11 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1020 ms
[2022-06-13 01:22:21] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 33 ms.
[2022-06-13 01:22:24] [INFO ] Added : 337 causal constraints over 68 iterations in 2704 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-13 01:22:24] [INFO ] [Real]Absence check using 61 positive place invariants in 43 ms returned sat
[2022-06-13 01:22:24] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 20 ms returned sat
[2022-06-13 01:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:24] [INFO ] [Real]Absence check using state equation in 195 ms returned unsat
[2022-06-13 01:22:24] [INFO ] [Real]Absence check using 61 positive place invariants in 30 ms returned sat
[2022-06-13 01:22:24] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 27 ms returned sat
[2022-06-13 01:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:25] [INFO ] [Real]Absence check using state equation in 449 ms returned unsat
[2022-06-13 01:22:25] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2022-06-13 01:22:25] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2022-06-13 01:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:25] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2022-06-13 01:22:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:25] [INFO ] [Nat]Absence check using 61 positive place invariants in 11 ms returned unsat
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using 61 positive place invariants in 27 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 19 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2022-06-13 01:22:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:26] [INFO ] [Nat]Absence check using 61 positive place invariants in 27 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 19 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:27] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2022-06-13 01:22:27] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:22:27] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2022-06-13 01:22:27] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 152 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 145 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:22:31] [INFO ] Deduced a trap composed of 139 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:22:31] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:22:31] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:22:31] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:22:31] [INFO ] Deduced a trap composed of 151 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:22:31] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2022-06-13 01:22: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 close... while checking expression at index 8
[2022-06-13 01:22:32] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2022-06-13 01:22:32] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2022-06-13 01:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:32] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2022-06-13 01:22:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:32] [INFO ] [Nat]Absence check using 61 positive place invariants in 24 ms returned sat
[2022-06-13 01:22:32] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2022-06-13 01:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:32] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2022-06-13 01:22:32] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2022-06-13 01:22:32] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1241 ms
[2022-06-13 01:22:34] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 31 ms.
[2022-06-13 01:22:36] [INFO ] Added : 325 causal constraints over 65 iterations in 2609 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 31000 steps, including 217 resets, run finished after 80 ms. (steps per millisecond=387 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29900 steps, including 221 resets, run finished after 77 ms. (steps per millisecond=388 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 35 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 622 transition count 471
Reduce places removed 90 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 95 rules applied. Total rules applied 186 place count 532 transition count 466
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 191 place count 527 transition count 466
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 191 place count 527 transition count 344
Deduced a syphon composed of 122 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 452 place count 388 transition count 344
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 527 place count 313 transition count 269
Iterating global reduction 3 with 75 rules applied. Total rules applied 602 place count 313 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 602 place count 313 transition count 262
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 3 with 16 rules applied. Total rules applied 618 place count 304 transition count 262
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 796 place count 214 transition count 174
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 797 place count 214 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 798 place count 214 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 799 place count 213 transition count 172
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 805 place count 213 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 806 place count 212 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 807 place count 211 transition count 171
Applied a total of 807 rules in 192 ms. Remains 211 /626 variables (removed 415) and now considering 171/562 (removed 391) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/626 places, 171/562 transitions.
[2022-06-13 01:22:37] [INFO ] Flatten gal took : 79 ms
[2022-06-13 01:22:37] [INFO ] Flatten gal took : 20 ms
[2022-06-13 01:22:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1061523450423214433.gal : 11 ms
[2022-06-13 01:22:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality764559136152792152.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1061523450423214433.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality764559136152792152.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1061523450423214433.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality764559136152792152.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality764559136152792152.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :6 after 8
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8 after 38
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :38 after 112
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :112 after 428
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :428 after 828
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :828 after 3256
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :5048 after 45364
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-15 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-07 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-02 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :45364 after 229396
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-12 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-01 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,442084,1.58201,36312,2,17738,22,79136,6,0,1014,65860,0
Total reachable state count : 442084

Verifying 5 reachability properties.
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-01,6144,1.58484,36312,2,1297,22,79136,7,0,1017,65860,0
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-02,2,1.58779,36312,2,212,22,79136,8,0,1019,65860,0
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-07,1,1.59147,36312,2,212,22,79136,9,0,1028,65860,0
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-12,384,2.06766,36312,2,372,22,79136,10,0,1066,65860,0
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-15,192,2.08921,36312,2,413,22,79136,11,0,1105,65860,0
All properties solved without resorting to model-checking.

BK_STOP 1655083360607

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is BusinessProcesses-PT-15, 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 r028-tall-165251936100165"
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 [ "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 ;