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-165251936100161.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-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.5K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 00:04 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.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 00:05 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 156K 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-14-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083272829

Running Version 0
[2022-06-13 01:21:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:21:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:21:14] [INFO ] Load time of PNML (sax parser for PT used): 545 ms
[2022-06-13 01:21:14] [INFO ] Transformed 624 places.
[2022-06-13 01:21:14] [INFO ] Transformed 564 transitions.
[2022-06-13 01:21:14] [INFO ] Found NUPN structural information;
[2022-06-13 01:21:14] [INFO ] Parsed PT model containing 624 places and 564 transitions in 593 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 556 rows 616 cols
[2022-06-13 01:21:15] [INFO ] Computed 99 place invariants in 50 ms
[2022-06-13 01:21:15] [INFO ] [Real]Absence check using 60 positive place invariants in 32 ms returned sat
[2022-06-13 01:21:15] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2022-06-13 01:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:15] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-06-13 01:21:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:16] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2022-06-13 01:21:16] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 15 ms returned sat
[2022-06-13 01:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:16] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-06-13 01:21:16] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 6 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:21:17] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 143 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:21:18] [INFO ] Deduced a trap composed of 140 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:21:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2632 ms
[2022-06-13 01:21:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:19] [INFO ] [Nat]Absence check using 60 positive place invariants in 29 ms returned sat
[2022-06-13 01:21:19] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 14 ms returned sat
[2022-06-13 01:21:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:19] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-06-13 01:21:19] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:21:19] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2022-06-13 01:21:19] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:21:20] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:21:20] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:21:20] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:21:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1031 ms
[2022-06-13 01:21:20] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 32 ms.
[2022-06-13 01:21:21] [INFO ] Added : 178 causal constraints over 36 iterations in 1342 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-13 01:21:21] [INFO ] [Real]Absence check using 60 positive place invariants in 32 ms returned sat
[2022-06-13 01:21:21] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2022-06-13 01:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:22] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2022-06-13 01:21:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:22] [INFO ] [Nat]Absence check using 60 positive place invariants in 31 ms returned sat
[2022-06-13 01:21:23] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2022-06-13 01:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:23] [INFO ] [Nat]Absence check using state equation in 777 ms returned unsat
[2022-06-13 01:21:23] [INFO ] [Real]Absence check using 60 positive place invariants in 21 ms returned sat
[2022-06-13 01:21:23] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-06-13 01:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:24] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-06-13 01:21:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:24] [INFO ] [Real]Absence check using 60 positive place invariants in 21 ms returned sat
[2022-06-13 01:21:24] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-06-13 01:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:24] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2022-06-13 01:21:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:24] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-06-13 01:21:25] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-06-13 01:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:25] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 5 ms to minimize.
[2022-06-13 01:21:25] [INFO ] Deduced a trap composed of 157 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:21:26] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 137 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 147 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 141 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:21:27] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 5 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:21:28] [INFO ] Deduced a trap composed of 139 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 144 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 144 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 151 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 152 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 148 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:21:29] [INFO ] Deduced a trap composed of 139 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:21:29] [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 4
[2022-06-13 01:21:30] [INFO ] [Real]Absence check using 60 positive place invariants in 31 ms returned sat
[2022-06-13 01:21:30] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2022-06-13 01:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:30] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2022-06-13 01:21:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:30] [INFO ] [Nat]Absence check using 60 positive place invariants in 16 ms returned unsat
[2022-06-13 01:21:31] [INFO ] [Real]Absence check using 60 positive place invariants in 30 ms returned sat
[2022-06-13 01:21:31] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2022-06-13 01:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:31] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2022-06-13 01:21:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:31] [INFO ] [Real]Absence check using 60 positive place invariants in 13 ms returned unsat
[2022-06-13 01:21:31] [INFO ] [Real]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-06-13 01:21:31] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-06-13 01:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:32] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2022-06-13 01:21:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:32] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-06-13 01:21:32] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-06-13 01:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:32] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2022-06-13 01:21:32] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:21:32] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:21:33] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:21:33] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:21:33] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:21:33] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:21:33] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:21:33] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:21:34] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:21:34] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:21:34] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:21:34] [INFO ] Deduced a trap composed of 144 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:21:34] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:21:34] [INFO ] Deduced a trap composed of 130 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:21:34] [INFO ] Deduced a trap composed of 127 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:21:35] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:21:35] [INFO ] Deduced a trap composed of 127 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:21:35] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:21:35] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:21:35] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:21:35] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:21:35] [INFO ] Deduced a trap composed of 141 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:21:36] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:21:36] [INFO ] Deduced a trap composed of 152 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:21:36] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:21:36] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:21:36] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:21:36] [INFO ] Deduced a trap composed of 133 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:21:36] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:21:37] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:21:37] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:21:37] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2022-06-13 01:21:37] [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:21:37] [INFO ] [Real]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-06-13 01:21:37] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2022-06-13 01:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:37] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2022-06-13 01:21:37] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:21:38] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:21:38] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2022-06-13 01:21:38] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:21:38] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 0 ms to minimize.
[2022-06-13 01:21:38] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:21:38] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:21:39] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 0 ms to minimize.
[2022-06-13 01:21:39] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:21:39] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:21:39] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:21:39] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:21:39] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:21:39] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2022-06-13 01:21:40] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:21:40] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2379 ms
[2022-06-13 01:21:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:21:40] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-06-13 01:21:40] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2022-06-13 01:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:21:40] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2022-06-13 01:21:40] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2022-06-13 01:21:40] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:21:40] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:21:41] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 0 ms to minimize.
[2022-06-13 01:21:41] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:21:41] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:21:41] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:21:41] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 3 ms to minimize.
[2022-06-13 01:21:42] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:21:42] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:21:42] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 0 ms to minimize.
[2022-06-13 01:21:42] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:21:42] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 0 ms to minimize.
[2022-06-13 01:21:42] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:21:43] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:21:43] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:21:43] [INFO ] Deduced a trap composed of 141 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:21:43] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:21:43] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:21:43] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:21:44] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:21:44] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:21:44] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:21:44] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:21:44] [INFO ] Deduced a trap composed of 139 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:21:44] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:21:44] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:21:45] [INFO ] Deduced a trap composed of 144 places in 99 ms of which 1 ms to minimize.
[2022-06-13 01:21:45] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:21: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 close... while checking expression at index 9
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 16100 steps, including 100 resets, run finished after 57 ms. (steps per millisecond=282 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 351 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 604 transition count 409
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 279 place count 466 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 465 transition count 408
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 280 place count 465 transition count 321
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 469 place count 363 transition count 321
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 551 place count 281 transition count 239
Iterating global reduction 3 with 82 rules applied. Total rules applied 633 place count 281 transition count 239
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 633 place count 281 transition count 229
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 656 place count 268 transition count 229
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 844 place count 173 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 846 place count 172 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 848 place count 172 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 850 place count 170 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 851 place count 170 transition count 138
Applied a total of 851 rules in 158 ms. Remains 170 /616 variables (removed 446) and now considering 138/556 (removed 418) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/616 places, 138/556 transitions.
[2022-06-13 01:21:45] [INFO ] Flatten gal took : 57 ms
[2022-06-13 01:21:45] [INFO ] Flatten gal took : 20 ms
[2022-06-13 01:21:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9518166736198158184.gal : 13 ms
[2022-06-13 01:21:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2702930739358227394.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/ReachabilityCardinality9518166736198158184.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2702930739358227394.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/ReachabilityCardinality9518166736198158184.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2702930739358227394.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2702930739358227394.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 21
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :21 after 61
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-15 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :61 after 201
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-13 does not hold.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :201 after 237
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :237 after 245
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :245 after 313
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :313 after 437
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :437 after 1041
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1041 after 1993
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-07 does not hold.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 FALSE 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 513 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,5073,0.224804,10308,2,3961,19,18074,6,0,818,14235,0
Total reachable state count : 5073

Verifying 3 reachability properties.
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-07 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-14-ReachabilityCardinality-07,4,0.225835,10572,2,184,19,18074,7,0,824,14235,0
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-13 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-14-ReachabilityCardinality-13,1,0.226534,10572,2,171,19,18074,8,0,829,14235,0
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-15 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-14-ReachabilityCardinality-15,1,0.226952,10572,2,171,19,18074,9,0,831,14235,0
All properties solved without resorting to model-checking.

BK_STOP 1655083309514

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-14"
export BK_EXAMINATION="ReachabilityCardinality"
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-14, 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 r028-tall-165251936100161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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