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

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620545177002

Running Version 0
[2021-05-09 07:26:18] [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:26:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:26:18] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-09 07:26:18] [INFO ] Transformed 567 places.
[2021-05-09 07:26:18] [INFO ] Transformed 508 transitions.
[2021-05-09 07:26:18] [INFO ] Found NUPN structural information;
[2021-05-09 07:26:18] [INFO ] Parsed PT model containing 567 places and 508 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 74 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 501 rows 560 cols
[2021-05-09 07:26:19] [INFO ] Computed 95 place invariants in 42 ms
[2021-05-09 07:26:19] [INFO ] [Real]Absence check using 53 positive place invariants in 28 ms returned sat
[2021-05-09 07:26:19] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 14 ms returned sat
[2021-05-09 07:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:19] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-09 07:26:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:19] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2021-05-09 07:26:19] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2021-05-09 07:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:20] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 4 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2021-05-09 07:26:20] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 2 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 2 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:26:21] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:26:22] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:26:22] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:26:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2089 ms
[2021-05-09 07:26:22] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 41 ms.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 123 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:26:23] [INFO ] Deduced a trap composed of 124 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 117 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:26:24] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:26:25] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2021-05-09 07:26:25] [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:25] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-09 07:26:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using 53 positive place invariants in 23 ms returned sat
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2021-05-09 07:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:25] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2021-05-09 07:26:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:25] [INFO ] [Nat]Absence check using 53 positive place invariants in 23 ms returned sat
[2021-05-09 07:26:26] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:26] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2021-05-09 07:26:26] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 117 places in 233 ms of which 1 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2021-05-09 07:26:27] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 5 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 0 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 7 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:26:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2567 ms
[2021-05-09 07:26:28] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 39 ms.
[2021-05-09 07:26:30] [INFO ] Added : 243 causal constraints over 50 iterations in 1781 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-09 07:26:30] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned sat
[2021-05-09 07:26:30] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 07:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:30] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:26:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:31] [INFO ] [Nat]Absence check using 53 positive place invariants in 24 ms returned sat
[2021-05-09 07:26:31] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 16 ms returned sat
[2021-05-09 07:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:31] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2021-05-09 07:26:31] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:26:32] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 110 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:26:33] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 0 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 120 places in 152 ms of which 0 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 23 ms to minimize.
[2021-05-09 07:26:34] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3348 ms
[2021-05-09 07:26:34] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 51 ms.
[2021-05-09 07:26:35] [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:26:36] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2021-05-09 07:26:36] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:36] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-09 07:26:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:36] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2021-05-09 07:26:36] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2021-05-09 07:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:36] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2021-05-09 07:26:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:36] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2021-05-09 07:26:36] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 4 ms returned unsat
[2021-05-09 07:26:37] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-09 07:26:37] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 07:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:37] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:26:37] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:26:38] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:26:39] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2816 ms
[2021-05-09 07:26:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:40] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2021-05-09 07:26:40] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 07:26:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:40] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:26:40] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:26:41] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:26:42] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:26:43] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3069 ms
[2021-05-09 07:26:43] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 30 ms.
[2021-05-09 07:26:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-09 07:26:45] [INFO ] [Real]Absence check using 53 positive place invariants in 37 ms returned sat
[2021-05-09 07:26:45] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:45] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2021-05-09 07:26:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:45] [INFO ] [Real]Absence check using 53 positive place invariants in 24 ms returned sat
[2021-05-09 07:26:45] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 32 ms returned sat
[2021-05-09 07:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:45] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:26:46] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 1 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 1 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:26:47] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:26:48] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3231 ms
[2021-05-09 07:26:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:49] [INFO ] [Nat]Absence check using 53 positive place invariants in 24 ms returned sat
[2021-05-09 07:26:49] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2021-05-09 07:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:49] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2021-05-09 07:26:49] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 0 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 1 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:26:50] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:26:51] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:26:52] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3386 ms
[2021-05-09 07:26:52] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 30 ms.
[2021-05-09 07:26:54] [INFO ] Added : 235 causal constraints over 47 iterations in 1249 ms. Result :unknown
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 26300 steps, including 222 resets, run finished after 78 ms. (steps per millisecond=337 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29100 steps, including 238 resets, run finished after 72 ms. (steps per millisecond=404 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 9 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 305 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 549 transition count 375
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 432 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 431 transition count 374
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 238 place count 431 transition count 287
Deduced a syphon composed of 87 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 429 place count 327 transition count 287
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 493 place count 263 transition count 223
Iterating global reduction 3 with 64 rules applied. Total rules applied 557 place count 263 transition count 223
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 557 place count 263 transition count 219
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 565 place count 259 transition count 219
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 175 rules applied. Total rules applied 740 place count 170 transition count 133
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 742 place count 169 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 744 place count 169 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 746 place count 167 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 751 place count 167 transition count 135
Applied a total of 751 rules in 175 ms. Remains 167 /560 variables (removed 393) and now considering 135/501 (removed 366) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/560 places, 135/501 transitions.
[2021-05-09 07:26:54] [INFO ] Flatten gal took : 60 ms
[2021-05-09 07:26:54] [INFO ] Flatten gal took : 24 ms
[2021-05-09 07:26:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1267089097584735168.gal : 11 ms
[2021-05-09 07:26:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14384970507733860356.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/ReachabilityCardinality1267089097584735168.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14384970507733860356.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/ReachabilityCardinality1267089097584735168.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14384970507733860356.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14384970507733860356.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 75
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :75 after 133
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :133 after 345
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-02 does not hold.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :345 after 1033
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1809 after 2209
Reachability property BusinessProcesses-PT-11-ReachabilityCardinality-15 is true.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-11-ReachabilityCardinality-12 is true.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-06 does not hold.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-05 does not hold.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 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,18829,0.174781,9708,2,3846,19,17244,6,0,805,7938,0
Total reachable state count : 18829

Verifying 5 reachability properties.
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-02 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-11-ReachabilityCardinality-02,2,0.175848,9708,2,171,19,17244,7,0,811,7938,0
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-05 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-11-ReachabilityCardinality-05,1,0.1769,9972,2,168,19,17244,8,0,816,7938,0
Invariant property BusinessProcesses-PT-11-ReachabilityCardinality-06 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-11-ReachabilityCardinality-06,2,0.177583,9972,2,171,19,17244,9,0,821,7938,0
Reachability property BusinessProcesses-PT-11-ReachabilityCardinality-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-11-ReachabilityCardinality-12,12,0.178184,9972,2,220,19,17244,10,0,823,7938,0
Reachability property BusinessProcesses-PT-11-ReachabilityCardinality-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-11-ReachabilityCardinality-15,1,0.179094,9972,2,168,19,17244,11,0,828,7938,0
All properties solved without resorting to model-checking.

BK_STOP 1620545215167

--------------------
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-11"
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-11, 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-162038143800406"
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 [ "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 ;