fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143900463
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
320.411 47348.00 63634.00 48.30 TFTTTFTTFTTTFFTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K 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 70K 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.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 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 177K 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-18-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620548501300

Running Version 0
[2021-05-09 08:21:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 08:21:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:21:42] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2021-05-09 08:21:42] [INFO ] Transformed 717 places.
[2021-05-09 08:21:42] [INFO ] Transformed 642 transitions.
[2021-05-09 08:21:42] [INFO ] Found NUPN structural information;
[2021-05-09 08:21:42] [INFO ] Parsed PT model containing 717 places and 642 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 627 rows 702 cols
[2021-05-09 08:21:43] [INFO ] Computed 114 place invariants in 45 ms
[2021-05-09 08:21:43] [INFO ] [Real]Absence check using 73 positive place invariants in 29 ms returned sat
[2021-05-09 08:21:43] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:43] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2021-05-09 08:21:44] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 5 ms to minimize.
[2021-05-09 08:21:44] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:21:44] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:21:44] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:21:44] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:21:45] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:21:45] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:21:45] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:21:45] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:21:45] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:21:46] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 0 ms to minimize.
[2021-05-09 08:21:46] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:21:46] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2021-05-09 08:21:46] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:21:46] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:21:46] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:21:47] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:21:47] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 0 ms to minimize.
[2021-05-09 08:21:47] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:21:47] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:21:47] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2021-05-09 08:21:47] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2021-05-09 08:21:47] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2021-05-09 08:21:47] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2021-05-09 08:21:48] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2021-05-09 08:21:48] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2021-05-09 08:21:48] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4225 ms
[2021-05-09 08:21:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:48] [INFO ] [Nat]Absence check using 73 positive place invariants in 41 ms returned sat
[2021-05-09 08:21:48] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 14 ms returned sat
[2021-05-09 08:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:48] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2021-05-09 08:21:48] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:21:49] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:21:49] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:21:49] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 0 ms to minimize.
[2021-05-09 08:21:49] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 0 ms to minimize.
[2021-05-09 08:21:49] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:21:49] [INFO ] Deduced a trap composed of 168 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:21:50] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:21:50] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 4 ms to minimize.
[2021-05-09 08:21:50] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:21:50] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:21:50] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:21:50] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 154 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 146 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 170 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2021-05-09 08:21:51] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:21:52] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:21:52] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:21:52] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 1 ms to minimize.
[2021-05-09 08:21:52] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:21:52] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:21:52] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:21:53] [INFO ] Deduced a trap composed of 154 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:21:53] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:21:53] [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 08:21:53] [INFO ] [Real]Absence check using 73 positive place invariants in 29 ms returned sat
[2021-05-09 08:21:53] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 5 ms returned unsat
[2021-05-09 08:21:53] [INFO ] [Real]Absence check using 73 positive place invariants in 29 ms returned sat
[2021-05-09 08:21:53] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-09 08:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:54] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2021-05-09 08:21:54] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 13 ms to minimize.
[2021-05-09 08:21:54] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:21:54] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:21:54] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:21:54] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:21:54] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:21:54] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:21:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 962 ms
[2021-05-09 08:21:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:55] [INFO ] [Nat]Absence check using 73 positive place invariants in 23 ms returned sat
[2021-05-09 08:21:55] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:55] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2021-05-09 08:21:56] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:21:56] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2021-05-09 08:21:56] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 2 ms to minimize.
[2021-05-09 08:21:56] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:21:56] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2021-05-09 08:21:56] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 4 ms to minimize.
[2021-05-09 08:21:57] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2021-05-09 08:21:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1260 ms
[2021-05-09 08:21:57] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 40 ms.
[2021-05-09 08:21:59] [INFO ] Added : 204 causal constraints over 41 iterations in 1947 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-09 08:21:59] [INFO ] [Real]Absence check using 73 positive place invariants in 25 ms returned sat
[2021-05-09 08:21:59] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:21:59] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2021-05-09 08:21:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:21:59] [INFO ] [Nat]Absence check using 73 positive place invariants in 23 ms returned sat
[2021-05-09 08:21:59] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:21:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:00] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2021-05-09 08:22:00] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2021-05-09 08:22:00] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:22:00] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:22:00] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:22:00] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:22:00] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:22:00] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:22:01] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:22:01] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:22:01] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 3 ms to minimize.
[2021-05-09 08:22:01] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2021-05-09 08:22:01] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2021-05-09 08:22:01] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:22:01] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2021-05-09 08:22:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1291 ms
[2021-05-09 08:22:01] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 36 ms.
[2021-05-09 08:22:04] [INFO ] Added : 366 causal constraints over 74 iterations in 2928 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 08:22:04] [INFO ] [Real]Absence check using 73 positive place invariants in 43 ms returned sat
[2021-05-09 08:22:04] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 27 ms returned sat
[2021-05-09 08:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:05] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2021-05-09 08:22:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:22:05] [INFO ] [Nat]Absence check using 73 positive place invariants in 35 ms returned sat
[2021-05-09 08:22:05] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 14 ms returned sat
[2021-05-09 08:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:05] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2021-05-09 08:22:06] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:22:06] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:22:06] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:22:06] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:22:06] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:22:06] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:22:06] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:22:07] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:22:07] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:22:07] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:22:07] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:22:07] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2021-05-09 08:22:07] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:22:07] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:22:07] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:22:08] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:22:08] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:22:08] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:22:08] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:22:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 2458 ms
[2021-05-09 08:22:08] [INFO ] [Real]Absence check using 73 positive place invariants in 31 ms returned sat
[2021-05-09 08:22:08] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:08] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2021-05-09 08:22:08] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:22:09] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:22:09] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:22:09] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:22:09] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:22:09] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:22:09] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:22:09] [INFO ] Deduced a trap composed of 187 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:22:10] [INFO ] Deduced a trap composed of 173 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:22:10] [INFO ] Deduced a trap composed of 179 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:22:10] [INFO ] Deduced a trap composed of 186 places in 183 ms of which 0 ms to minimize.
[2021-05-09 08:22:10] [INFO ] Deduced a trap composed of 187 places in 190 ms of which 1 ms to minimize.
[2021-05-09 08:22:11] [INFO ] Deduced a trap composed of 180 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:22:11] [INFO ] Deduced a trap composed of 181 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:22:11] [INFO ] Deduced a trap composed of 193 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:22:11] [INFO ] Deduced a trap composed of 182 places in 195 ms of which 0 ms to minimize.
[2021-05-09 08:22:11] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:22:12] [INFO ] Deduced a trap composed of 181 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:22:12] [INFO ] Deduced a trap composed of 170 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:22:12] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2021-05-09 08:22:12] [INFO ] Deduced a trap composed of 175 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:22:12] [INFO ] Deduced a trap composed of 187 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:22:12] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 0 ms to minimize.
[2021-05-09 08:22:13] [INFO ] Deduced a trap composed of 183 places in 173 ms of which 0 ms to minimize.
[2021-05-09 08:22:13] [INFO ] Deduced a trap composed of 178 places in 159 ms of which 0 ms to minimize.
[2021-05-09 08:22:13] [INFO ] Deduced a trap composed of 154 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:22:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-09 08:22:13] [INFO ] [Real]Absence check using 73 positive place invariants in 9 ms returned unsat
[2021-05-09 08:22:13] [INFO ] [Real]Absence check using 73 positive place invariants in 32 ms returned sat
[2021-05-09 08:22:13] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 08:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:14] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2021-05-09 08:22:14] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:22:14] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:22:14] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:22:14] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:22:14] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2021-05-09 08:22:14] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:22:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 767 ms
[2021-05-09 08:22:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:22:15] [INFO ] [Nat]Absence check using 73 positive place invariants in 33 ms returned sat
[2021-05-09 08:22:15] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 08:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:15] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-09 08:22:15] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:22:15] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 0 ms to minimize.
[2021-05-09 08:22:15] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:22:15] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:22:16] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2021-05-09 08:22:16] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:22:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 959 ms
[2021-05-09 08:22:16] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 40 ms.
[2021-05-09 08:22:17] [INFO ] Added : 228 causal constraints over 47 iterations in 1531 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-09 08:22:17] [INFO ] [Real]Absence check using 73 positive place invariants in 29 ms returned sat
[2021-05-09 08:22:17] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-09 08:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:18] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-09 08:22:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:22:18] [INFO ] [Nat]Absence check using 73 positive place invariants in 32 ms returned sat
[2021-05-09 08:22:18] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-09 08:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:18] [INFO ] [Nat]Absence check using state equation in 210 ms returned unsat
[2021-05-09 08:22:18] [INFO ] [Real]Absence check using 73 positive place invariants in 23 ms returned unsat
[2021-05-09 08:22:18] [INFO ] [Real]Absence check using 73 positive place invariants in 31 ms returned sat
[2021-05-09 08:22:18] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 08:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:18] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-09 08:22:19] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2021-05-09 08:22:19] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:22:19] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:22:19] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:22:19] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:22:19] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:22:19] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2021-05-09 08:22:19] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2021-05-09 08:22:20] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:22:20] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:22:20] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:22:20] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:22:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1308 ms
[2021-05-09 08:22:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:22:20] [INFO ] [Nat]Absence check using 73 positive place invariants in 25 ms returned sat
[2021-05-09 08:22:20] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-09 08:22:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:22:20] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-09 08:22:20] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:22:20] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:22:21] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2021-05-09 08:22:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1331 ms
[2021-05-09 08:22:22] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 28 ms.
[2021-05-09 08:22:25] [INFO ] Added : 374 causal constraints over 75 iterations in 3058 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 17500 steps, including 116 resets, run finished after 65 ms. (steps per millisecond=269 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 32100 steps, including 116 resets, run finished after 140 ms. (steps per millisecond=229 ) properties (out of 5) seen :3 could not realise parikh vector
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 23000 steps, including 139 resets, run finished after 111 ms. (steps per millisecond=207 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 28700 steps, including 160 resets, run finished after 102 ms. (steps per millisecond=281 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 12 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 398 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 686 transition count 460
Reduce places removed 156 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 160 rules applied. Total rules applied 318 place count 530 transition count 456
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 322 place count 526 transition count 456
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 322 place count 526 transition count 360
Deduced a syphon composed of 96 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 535 place count 409 transition count 360
Discarding 91 places :
Symmetric choice reduction at 3 with 91 rule applications. Total rules 626 place count 318 transition count 269
Iterating global reduction 3 with 91 rules applied. Total rules applied 717 place count 318 transition count 269
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 717 place count 318 transition count 259
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 740 place count 305 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 741 place count 304 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 742 place count 304 transition count 258
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 956 place count 197 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 958 place count 196 transition count 154
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 959 place count 196 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 960 place count 195 transition count 153
Applied a total of 960 rules in 147 ms. Remains 195 /702 variables (removed 507) and now considering 153/627 (removed 474) transitions.
Finished structural reductions, in 1 iterations. Remains : 195/702 places, 153/627 transitions.
[2021-05-09 08:22:25] [INFO ] Flatten gal took : 49 ms
[2021-05-09 08:22:25] [INFO ] Flatten gal took : 18 ms
[2021-05-09 08:22:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12205637437504813631.gal : 8 ms
[2021-05-09 08:22:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10303016573623290835.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/ReachabilityCardinality12205637437504813631.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10303016573623290835.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/ReachabilityCardinality12205637437504813631.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10303016573623290835.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10303016573623290835.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 17
Reachability property BusinessProcesses-PT-18-ReachabilityFireability-00 is true.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 197
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :197 after 395
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :395 after 743
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :743 after 2433
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2433 after 9053
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9053 after 40133
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :40133 after 1.19117e+06
Reachability property BusinessProcesses-PT-18-ReachabilityFireability-06 is true.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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,1.04717e+07,2.28664,84664,2,13730,17,390409,6,0,935,149337,0
Total reachable state count : 10471685

Verifying 2 reachability properties.
Reachability property BusinessProcesses-PT-18-ReachabilityFireability-00 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-18-ReachabilityFireability-00,1,2.28858,84664,2,196,17,390409,7,0,952,149337,0
Reachability property BusinessProcesses-PT-18-ReachabilityFireability-06 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-18-ReachabilityFireability-06,18432,2.32726,84664,2,870,17,390409,8,0,964,149337,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.

BK_STOP 1620548548648

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-18"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-18, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143900463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;