Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800407.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 141K May 5 16:51 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-11-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620545182044

Running Version 0
[2021-05-09 07:26:23] [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]
[2021-05-09 07:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:26:23] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-09 07:26:23] [INFO ] Transformed 567 places.
[2021-05-09 07:26:23] [INFO ] Transformed 508 transitions.
[2021-05-09 07:26:23] [INFO ] Found NUPN structural information;
[2021-05-09 07:26:23] [INFO ] Parsed PT model containing 567 places and 508 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 7 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 501 rows 560 cols
[2021-05-09 07:26:24] [INFO ] Computed 95 place invariants in 32 ms
[2021-05-09 07:26:24] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2021-05-09 07:26:24] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:24] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 6 ms to minimize.
[2021-05-09 07:26:25] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 2 ms to minimize.
[2021-05-09 07:26:25] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:26:25] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 6 ms to minimize.
[2021-05-09 07:26:25] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2021-05-09 07:26:25] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:26:25] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:26:25] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 127 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3530 ms
[2021-05-09 07:26:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:28] [INFO ] [Nat]Absence check using 53 positive place invariants in 24 ms returned sat
[2021-05-09 07:26:28] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:28] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 4 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 0 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 1 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2021-05-09 07:26:29] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:26:30] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 11 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3395 ms
[2021-05-09 07:26:31] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 36 ms.
[2021-05-09 07:26:33] [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
[2021-05-09 07:26:33] [INFO ] [Real]Absence check using 53 positive place invariants in 23 ms returned sat
[2021-05-09 07:26:33] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:33] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2021-05-09 07:26:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:33] [INFO ] [Nat]Absence check using 53 positive place invariants in 23 ms returned sat
[2021-05-09 07:26:33] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:33] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 0 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 1 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:26:35] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 130 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:26:36] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 125 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 139 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 132 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 129 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [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
[2021-05-09 07:26:38] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-09 07:26:38] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:39] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2021-05-09 07:26:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:39] [INFO ] [Nat]Absence check using 53 positive place invariants in 14 ms returned unsat
[2021-05-09 07:26:39] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2021-05-09 07:26:39] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:39] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-09 07:26:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:39] [INFO ] [Nat]Absence check using 53 positive place invariants in 22 ms returned sat
[2021-05-09 07:26:39] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:39] [INFO ] [Nat]Absence check using state equation in 143 ms returned unsat
[2021-05-09 07:26:39] [INFO ] [Real]Absence check using 53 positive place invariants in 43 ms returned sat
[2021-05-09 07:26:39] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:40] [INFO ] [Real]Absence check using state equation in 135 ms returned unsat
[2021-05-09 07:26:40] [INFO ] [Real]Absence check using 53 positive place invariants in 14 ms returned sat
[2021-05-09 07:26:40] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 07:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:40] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2049 ms
[2021-05-09 07:26:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:42] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2021-05-09 07:26:42] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 07:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:42] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 120 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:26:44] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:26:45] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [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 5
[2021-05-09 07:26:47] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2021-05-09 07:26:47] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:47] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 118 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 121 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 40 places in 19 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [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 6
[2021-05-09 07:26:52] [INFO ] [Real]Absence check using 53 positive place invariants in 12 ms returned unsat
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Support contains 15 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 297 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 549 transition count 382
Reduce places removed 110 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 115 rules applied. Total rules applied 227 place count 439 transition count 377
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 232 place count 434 transition count 377
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 232 place count 434 transition count 290
Deduced a syphon composed of 87 places in 4 ms
Ensure Unique test removed 16 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 422 place count 331 transition count 290
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 484 place count 269 transition count 228
Iterating global reduction 3 with 62 rules applied. Total rules applied 546 place count 269 transition count 228
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 546 place count 269 transition count 225
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 552 place count 266 transition count 225
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 173 rules applied. Total rules applied 725 place count 178 transition count 140
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 727 place count 177 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 729 place count 177 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 731 place count 175 transition count 142
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 736 place count 175 transition count 142
Applied a total of 736 rules in 143 ms. Remains 175 /560 variables (removed 385) and now considering 142/501 (removed 359) transitions.
Finished structural reductions, in 1 iterations. Remains : 175/560 places, 142/501 transitions.
[2021-05-09 07:26:53] [INFO ] Flatten gal took : 148 ms
[2021-05-09 07:26:53] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:26:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality535526388060512848.gal : 9 ms
[2021-05-09 07:26:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9139342104877166247.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/ReachabilityCardinality535526388060512848.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9139342104877166247.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/ReachabilityCardinality535526388060512848.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9139342104877166247.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9139342104877166247.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :17 after 45
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :45 after 113
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :113 after 897
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1737 after 2709
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-13 is true.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-05 is true.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2709 after 5973
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-14 is true.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5973 after 6739
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-03 is true.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 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 257 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,23553,0.211048,13160,2,5122,19,28890,6,0,844,14663,0
Total reachable state count : 23553

Verifying 4 reachability properties.
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-03 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-11-ReachabilityFireability-03,1,0.212319,13424,2,176,19,28890,7,0,855,14663,0
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-05 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-11-ReachabilityFireability-05,1,0.213331,13424,2,176,19,28890,8,0,870,14663,0
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-13 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-11-ReachabilityFireability-13,1,0.213967,13424,2,176,19,28890,9,0,874,14663,0
Reachability property BusinessProcesses-PT-11-ReachabilityFireability-14 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-11-ReachabilityFireability-14,2,0.214633,13424,2,186,19,28890,10,0,876,14663,0
All properties solved without resorting to model-checking.

BK_STOP 1620545213812

--------------------
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-11"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 itstools"
echo " Input is BusinessProcesses-PT-11, 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 r026-tajo-162038143800407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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