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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K 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 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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.5K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 157K 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-15-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620547231062

Running Version 0
[2021-05-09 08:00:32] [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:00:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:00:33] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2021-05-09 08:00:33] [INFO ] Transformed 630 places.
[2021-05-09 08:00:33] [INFO ] Transformed 566 transitions.
[2021-05-09 08:00:33] [INFO ] Found NUPN structural information;
[2021-05-09 08:00:33] [INFO ] Parsed PT model containing 630 places and 566 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 562 rows 626 cols
[2021-05-09 08:00:33] [INFO ] Computed 102 place invariants in 44 ms
[2021-05-09 08:00:33] [INFO ] [Real]Absence check using 61 positive place invariants in 24 ms returned sat
[2021-05-09 08:00:33] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-09 08:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:34] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-09 08:00:34] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 5 ms to minimize.
[2021-05-09 08:00:34] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2021-05-09 08:00:34] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2021-05-09 08:00:34] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:00:34] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2021-05-09 08:00:34] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:00:34] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:00:34] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2021-05-09 08:00:35] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:00:35] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:00:35] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2021-05-09 08:00:35] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:00:35] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2021-05-09 08:00:35] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:00:35] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2021-05-09 08:00:35] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1356 ms
[2021-05-09 08:00:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:00:35] [INFO ] [Nat]Absence check using 61 positive place invariants in 31 ms returned sat
[2021-05-09 08:00:35] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2021-05-09 08:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:35] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2021-05-09 08:00:35] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 0 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:00:36] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2021-05-09 08:00:37] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2021-05-09 08:00:37] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:00:37] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:00:37] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1439 ms
[2021-05-09 08:00:37] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 37 ms.
[2021-05-09 08:00:39] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:00:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2021-05-09 08:00:39] [INFO ] Added : 265 causal constraints over 53 iterations in 1876 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-09 08:00:39] [INFO ] [Real]Absence check using 61 positive place invariants in 39 ms returned sat
[2021-05-09 08:00:39] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2021-05-09 08:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:39] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2021-05-09 08:00:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:00:39] [INFO ] [Nat]Absence check using 61 positive place invariants in 32 ms returned sat
[2021-05-09 08:00:39] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 19 ms returned sat
[2021-05-09 08:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:40] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2021-05-09 08:00:40] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 6 ms to minimize.
[2021-05-09 08:00:40] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 0 ms to minimize.
[2021-05-09 08:00:40] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:00:41] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 1 ms to minimize.
[2021-05-09 08:00:41] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 1 ms to minimize.
[2021-05-09 08:00:41] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2021-05-09 08:00:41] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:00:41] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 0 ms to minimize.
[2021-05-09 08:00:42] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:00:42] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:00:42] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:00:42] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:00:42] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:00:43] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 0 ms to minimize.
[2021-05-09 08:00:43] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:00:43] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:00:43] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:00:43] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:00:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:00:43] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:00:44] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 1 ms to minimize.
[2021-05-09 08:00:44] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:00:44] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2021-05-09 08:00:44] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 4 ms to minimize.
[2021-05-09 08:00:44] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2021-05-09 08:00:44] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:00:44] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:00:44] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 0 ms to minimize.
[2021-05-09 08:00:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-09 08:00:45] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2021-05-09 08:00:45] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 18 ms returned sat
[2021-05-09 08:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:45] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2021-05-09 08:00:45] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:00:45] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:00:45] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:00:45] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2021-05-09 08:00:45] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:00:45] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:00:46] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1399 ms
[2021-05-09 08:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:00:46] [INFO ] [Nat]Absence check using 61 positive place invariants in 29 ms returned sat
[2021-05-09 08:00:46] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 08:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:47] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2021-05-09 08:00:47] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:00:47] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2021-05-09 08:00:47] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:00:47] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:00:47] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:00:47] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2021-05-09 08:00:47] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 0 ms to minimize.
[2021-05-09 08:00:48] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1615 ms
[2021-05-09 08:00:48] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 44 ms.
[2021-05-09 08:00:51] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:00:51] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:00:51] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:00:51] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:00:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-09 08:00:52] [INFO ] [Real]Absence check using 61 positive place invariants in 30 ms returned sat
[2021-05-09 08:00:52] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-09 08:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:52] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2021-05-09 08:00:52] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:00:52] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:00:52] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:00:53] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:00:53] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:00:53] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:00:53] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:00:53] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:00:53] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:00:54] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:00:54] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:00:54] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:00:54] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:00:54] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:00:54] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:00:55] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:00:55] [INFO ] Deduced a trap composed of 136 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:00:55] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:00:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 3031 ms
[2021-05-09 08:00:55] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2021-05-09 08:00:55] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 08:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:55] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-09 08:00:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:00:55] [INFO ] [Nat]Absence check using 61 positive place invariants in 27 ms returned sat
[2021-05-09 08:00:55] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 08:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:56] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2021-05-09 08:00:56] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:00:56] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:00:56] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:00:56] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:00:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 557 ms
[2021-05-09 08:00:56] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 48 ms.
[2021-05-09 08:00:59] [INFO ] Added : 322 causal constraints over 65 iterations in 2695 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 08:00:59] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2021-05-09 08:00:59] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2021-05-09 08:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:59] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-09 08:00:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:01:00] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2021-05-09 08:01:00] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 08:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:01:00] [INFO ] [Nat]Absence check using state equation in 184 ms returned unsat
[2021-05-09 08:01:00] [INFO ] [Real]Absence check using 61 positive place invariants in 24 ms returned sat
[2021-05-09 08:01:00] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2021-05-09 08:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:01:00] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-09 08:01:00] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 0 ms to minimize.
[2021-05-09 08:01:00] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:01:01] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 0 ms to minimize.
[2021-05-09 08:01:01] [INFO ] Deduced a trap composed of 143 places in 198 ms of which 1 ms to minimize.
[2021-05-09 08:01:01] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:01:01] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 0 ms to minimize.
[2021-05-09 08:01:02] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:01:02] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:01:02] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 1 ms to minimize.
[2021-05-09 08:01:02] [INFO ] Deduced a trap composed of 147 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:01:02] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 0 ms to minimize.
[2021-05-09 08:01:03] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:01:03] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:01:03] [INFO ] Deduced a trap composed of 146 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:01:03] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:01:03] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:01:04] [INFO ] Deduced a trap composed of 153 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:01:04] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:01:04] [INFO ] Deduced a trap composed of 147 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:01:04] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:01:04] [INFO ] Deduced a trap composed of 149 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:01:04] [INFO ] Deduced a trap composed of 152 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:01:05] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 0 ms to minimize.
[2021-05-09 08:01:05] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:01:05] [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 08:01:05] [INFO ] [Real]Absence check using 61 positive place invariants in 27 ms returned sat
[2021-05-09 08:01:05] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-09 08:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:01:05] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-09 08:01:05] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 15 ms to minimize.
[2021-05-09 08:01:06] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:01:06] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:01:06] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:01:06] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:01:06] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:01:06] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:01:06] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:01:07] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:01:07] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:01:07] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:01:07] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:01:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1710 ms
[2021-05-09 08:01:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:01:07] [INFO ] [Nat]Absence check using 61 positive place invariants in 27 ms returned sat
[2021-05-09 08:01:07] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 08:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:01:07] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-09 08:01:08] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:01:08] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:01:08] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:01:08] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:01:08] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:01:08] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:01:08] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:01:08] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2021-05-09 08:01:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1959 ms
[2021-05-09 08:01:09] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 43 ms.
[2021-05-09 08:01:11] [INFO ] Added : 302 causal constraints over 61 iterations in 1828 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-09 08:01:11] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2021-05-09 08:01:11] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 08:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:01:12] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-09 08:01:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:01:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 29 ms returned sat
[2021-05-09 08:01:12] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2021-05-09 08:01:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:01:12] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2021-05-09 08:01:13] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2021-05-09 08:01:13] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 0 ms to minimize.
[2021-05-09 08:01:13] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:01:13] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:01:13] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 0 ms to minimize.
[2021-05-09 08:01:14] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:01:14] [INFO ] Deduced a trap composed of 139 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:01:14] [INFO ] Deduced a trap composed of 150 places in 159 ms of which 0 ms to minimize.
[2021-05-09 08:01:14] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:01:14] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 0 ms to minimize.
[2021-05-09 08:01:15] [INFO ] Deduced a trap composed of 147 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:01:15] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:01:15] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2021-05-09 08:01:15] [INFO ] Deduced a trap composed of 134 places in 168 ms of which 1 ms to minimize.
[2021-05-09 08:01:15] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 1 ms to minimize.
[2021-05-09 08:01:16] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 0 ms to minimize.
[2021-05-09 08:01:16] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:01:16] [INFO ] Deduced a trap composed of 143 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:01:16] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:01:16] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 0 ms to minimize.
[2021-05-09 08:01:16] [INFO ] Deduced a trap composed of 141 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:01:17] [INFO ] Deduced a trap composed of 140 places in 198 ms of which 1 ms to minimize.
[2021-05-09 08:01:17] [INFO ] Deduced a trap composed of 142 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:01:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-09 08:01:17] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2021-05-09 08:01:17] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-09 08:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:01:17] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2021-05-09 08:01:18] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 1 ms to minimize.
[2021-05-09 08:01:18] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:01:18] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:01:18] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:01:18] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:01:18] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:01:19] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:01:19] [INFO ] Deduced a trap composed of 155 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:01:19] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 0 ms to minimize.
[2021-05-09 08:01:19] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:01:19] [INFO ] Deduced a trap composed of 155 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:01:19] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:01:20] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:01:20] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:01:20] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:01:20] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:01:20] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:01:20] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:01:20] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2021-05-09 08:01:21] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:01:21] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:01:21] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2021-05-09 08:01:21] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:01:21] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:01:21] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:01:21] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:01:22] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:01:22] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:01:22] [INFO ] Deduced a trap composed of 151 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:01:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 19300 steps, including 128 resets, run finished after 58 ms. (steps per millisecond=332 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 39700 steps, including 288 resets, run finished after 96 ms. (steps per millisecond=413 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26100 steps, including 204 resets, run finished after 60 ms. (steps per millisecond=435 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 32 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 622 transition count 477
Reduce places removed 84 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 90 rules applied. Total rules applied 175 place count 538 transition count 471
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 181 place count 532 transition count 471
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 181 place count 532 transition count 341
Deduced a syphon composed of 130 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 455 place count 388 transition count 341
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 535 place count 308 transition count 261
Iterating global reduction 3 with 80 rules applied. Total rules applied 615 place count 308 transition count 261
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 615 place count 308 transition count 254
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 631 place count 299 transition count 254
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 801 place count 214 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 214 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 804 place count 213 transition count 172
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 808 place count 213 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 809 place count 212 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 810 place count 211 transition count 171
Applied a total of 810 rules in 127 ms. Remains 211 /626 variables (removed 415) and now considering 171/562 (removed 391) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/626 places, 171/562 transitions.
[2021-05-09 08:01:23] [INFO ] Flatten gal took : 62 ms
[2021-05-09 08:01:23] [INFO ] Flatten gal took : 24 ms
[2021-05-09 08:01:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17160117777309077993.gal : 14 ms
[2021-05-09 08:01:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7819980336847383768.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/ReachabilityCardinality17160117777309077993.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7819980336847383768.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/ReachabilityCardinality17160117777309077993.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7819980336847383768.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7819980336847383768.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 27
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :27 after 64
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :64 after 80
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :80 after 97
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :97 after 288
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-14 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :288 after 2108
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2108 after 8856
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-03 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :8856 after 35152
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-12 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-06 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :35152 after 52872
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :52872 after 119368
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :119368 after 280380
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-11 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :280380 after 1.10299e+06
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-13 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-01 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 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 2049 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,2.17941e+06,2.17652,42204,2,23349,27,123904,6,0,1015,98065,0
Total reachable state count : 2179408

Verifying 7 reachability properties.
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-01 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-15-ReachabilityFireability-01,1,2.17944,42204,2,212,27,123904,7,0,1032,98065,0
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-03,16,2.18161,42204,2,352,27,123904,8,0,1037,98065,0
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-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-15-ReachabilityFireability-06,16,2.19274,42204,2,277,27,123904,9,0,1048,98065,0
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-11 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-15-ReachabilityFireability-11,2064,2.19518,42204,2,992,27,123904,10,0,1050,98065,0
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-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-15-ReachabilityFireability-12,1,2.19696,42204,2,212,27,123904,11,0,1052,98065,0
Invariant property BusinessProcesses-PT-15-ReachabilityFireability-13 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-13,12672,3.05884,42204,2,789,27,123904,12,0,1078,98065,0
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-14,38368,3.57607,42204,2,6336,27,123904,13,0,1098,98065,0
All properties solved without resorting to model-checking.

BK_STOP 1620547286920

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-15"
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-15, 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-162038143900439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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