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-162038143800414.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-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800414
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 146K 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-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620545596024

Running Version 0
[2021-05-09 07:33:17] [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]
[2021-05-09 07:33:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:33:17] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-09 07:33:17] [INFO ] Transformed 586 places.
[2021-05-09 07:33:17] [INFO ] Transformed 525 transitions.
[2021-05-09 07:33:17] [INFO ] Found NUPN structural information;
[2021-05-09 07:33:17] [INFO ] Parsed PT model containing 586 places and 525 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 71 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :5
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 521 rows 582 cols
[2021-05-09 07:33:17] [INFO ] Computed 98 place invariants in 24 ms
[2021-05-09 07:33:18] [INFO ] [Real]Absence check using 55 positive place invariants in 19 ms returned sat
[2021-05-09 07:33:18] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:18] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-09 07:33:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:33:18] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2021-05-09 07:33:18] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:18] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-09 07:33:18] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 2 ms to minimize.
[2021-05-09 07:33:19] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2021-05-09 07:33:19] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:33:19] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:33:19] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:33:19] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:33:19] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:33:20] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 1 ms to minimize.
[2021-05-09 07:33:20] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 0 ms to minimize.
[2021-05-09 07:33:20] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:33:20] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:33:20] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:33:20] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:33:20] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 50 places in 27 ms of which 1 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Deduced a trap composed of 44 places in 25 ms of which 1 ms to minimize.
[2021-05-09 07:33:21] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3078 ms
[2021-05-09 07:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:33:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 43 ms returned sat
[2021-05-09 07:33:22] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 17 ms returned sat
[2021-05-09 07:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:22] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-09 07:33:22] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2021-05-09 07:33:22] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2021-05-09 07:33:22] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2021-05-09 07:33:23] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 0 ms to minimize.
[2021-05-09 07:33:23] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 0 ms to minimize.
[2021-05-09 07:33:23] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 1 ms to minimize.
[2021-05-09 07:33:23] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 5 ms to minimize.
[2021-05-09 07:33:23] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2021-05-09 07:33:23] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:33:24] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2696 ms
[2021-05-09 07:33:25] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 49 ms.
[2021-05-09 07:33:26] [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:33:27] [INFO ] [Real]Absence check using 55 positive place invariants in 28 ms returned sat
[2021-05-09 07:33:27] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2021-05-09 07:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:27] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-09 07:33:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:33:27] [INFO ] [Nat]Absence check using 55 positive place invariants in 42 ms returned sat
[2021-05-09 07:33:27] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2021-05-09 07:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:27] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-09 07:33:27] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2021-05-09 07:33:28] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
[2021-05-09 07:33:28] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 1 ms to minimize.
[2021-05-09 07:33:28] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:33:28] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:33:28] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:33:28] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:33:28] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:33:29] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:33:29] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:33:29] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 0 ms to minimize.
[2021-05-09 07:33:29] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:33:29] [INFO ] Deduced a trap composed of 132 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:33:29] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:33:29] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:33:30] [INFO ] Deduced a trap composed of 148 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:33:30] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 0 ms to minimize.
[2021-05-09 07:33:30] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:33:30] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:33:30] [INFO ] Deduced a trap composed of 130 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:33:30] [INFO ] Deduced a trap composed of 136 places in 96 ms of which 10 ms to minimize.
[2021-05-09 07:33:30] [INFO ] Deduced a trap composed of 143 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:33:31] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:33:31] [INFO ] Deduced a trap composed of 142 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:33:31] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:33:31] [INFO ] Deduced a trap composed of 143 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:33:31] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:33:31] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:33:31] [INFO ] Deduced a trap composed of 136 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:33:32] [INFO ] Deduced a trap composed of 142 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:33:32] [INFO ] Deduced a trap composed of 129 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:33:32] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:33:32] [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 2
[2021-05-09 07:33:32] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-09 07:33:32] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:33] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2021-05-09 07:33:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:33:33] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-09 07:33:33] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 07:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:33] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-09 07:33:33] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2021-05-09 07:33:33] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:33:33] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 0 ms to minimize.
[2021-05-09 07:33:34] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:33:34] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 0 ms to minimize.
[2021-05-09 07:33:34] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:33:34] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:33:34] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:33:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:33:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:33:34] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:33:35] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:33:35] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:33:35] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:33:35] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:33:35] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:33:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2078 ms
[2021-05-09 07:33:35] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 39 ms.
[2021-05-09 07:33:37] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:33:37] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:33:37] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 0 ms to minimize.
[2021-05-09 07:33:38] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:33: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 3
[2021-05-09 07:33:38] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-09 07:33:38] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 07:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:38] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-09 07:33:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:33:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2021-05-09 07:33:38] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2021-05-09 07:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:33:38] [INFO ] [Nat]Absence check using state equation in 165 ms returned unsat
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Support contains 9 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 320 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 572 transition count 390
Reduce places removed 122 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 123 rules applied. Total rules applied 247 place count 450 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 248 place count 449 transition count 389
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 248 place count 449 transition count 300
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 193 rules applied. Total rules applied 441 place count 345 transition count 300
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 511 place count 275 transition count 230
Iterating global reduction 3 with 70 rules applied. Total rules applied 581 place count 275 transition count 230
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 581 place count 275 transition count 224
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 594 place count 268 transition count 224
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 771 place count 178 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 773 place count 177 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 775 place count 177 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 777 place count 175 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 778 place count 175 transition count 139
Applied a total of 778 rules in 211 ms. Remains 175 /582 variables (removed 407) and now considering 139/521 (removed 382) transitions.
Finished structural reductions, in 1 iterations. Remains : 175/582 places, 139/521 transitions.
[2021-05-09 07:33:39] [INFO ] Flatten gal took : 84 ms
[2021-05-09 07:33:39] [INFO ] Flatten gal took : 16 ms
[2021-05-09 07:33:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8046340709786452932.gal : 11 ms
[2021-05-09 07:33:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality338002147265820890.prop : 0 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/ReachabilityCardinality8046340709786452932.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality338002147265820890.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/ReachabilityCardinality8046340709786452932.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality338002147265820890.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality338002147265820890.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 27
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :27 after 85
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :85 after 313
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :477 after 565
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-11 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-03 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :565 after 2465
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2465 after 6045
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,6077,0.182104,9480,2,4001,17,16611,7,0,851,9321,0
Total reachable state count : 6077

Verifying 3 reachability properties.
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-01 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-12-ReachabilityCardinality-01,8,0.186041,9480,2,193,17,16611,7,0,863,9321,0
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-03 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-12-ReachabilityCardinality-03,1,0.187643,9744,2,176,17,16611,8,0,868,9321,0
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-11 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-12-ReachabilityCardinality-11,10,0.188943,9744,2,255,17,16611,9,0,875,9321,0
All properties solved without resorting to model-checking.

BK_STOP 1620545620288

--------------------
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-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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-12, 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 r026-tajo-162038143800414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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