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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 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.4K 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.9K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 148K 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-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620545792781

Running Version 0
[2021-05-09 07:36:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:36:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:36:34] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-09 07:36:34] [INFO ] Transformed 593 places.
[2021-05-09 07:36:34] [INFO ] Transformed 536 transitions.
[2021-05-09 07:36:34] [INFO ] Found NUPN structural information;
[2021-05-09 07:36:34] [INFO ] Parsed PT model containing 593 places and 536 transitions in 106 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 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 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 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :3
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 528 rows 585 cols
[2021-05-09 07:36:34] [INFO ] Computed 95 place invariants in 34 ms
[2021-05-09 07:36:34] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2021-05-09 07:36:35] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2021-05-09 07:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:35] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2021-05-09 07:36:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:36:35] [INFO ] [Nat]Absence check using 57 positive place invariants in 53 ms returned sat
[2021-05-09 07:36:35] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 21 ms returned sat
[2021-05-09 07:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:36] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2021-05-09 07:36:36] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 5 ms to minimize.
[2021-05-09 07:36:36] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 2 ms to minimize.
[2021-05-09 07:36:36] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 1 ms to minimize.
[2021-05-09 07:36:37] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 2 ms to minimize.
[2021-05-09 07:36:37] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2021-05-09 07:36:37] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:36:37] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:36:37] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:36:38] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:36:38] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 1 ms to minimize.
[2021-05-09 07:36:38] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 1 ms to minimize.
[2021-05-09 07:36:38] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:36:38] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:36:38] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 0 ms to minimize.
[2021-05-09 07:36:39] [INFO ] Deduced a trap composed of 147 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:36:39] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:36:39] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:36:39] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:36:39] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:36:39] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:36:39] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:36:40] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:36:40] [INFO ] Deduced a trap composed of 132 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:36:40] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 1 ms to minimize.
[2021-05-09 07:36:40] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:36:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-09 07:36:40] [INFO ] [Real]Absence check using 57 positive place invariants in 30 ms returned sat
[2021-05-09 07:36:40] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 4 ms returned unsat
[2021-05-09 07:36:40] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned unsat
[2021-05-09 07:36:40] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2021-05-09 07:36:40] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-09 07:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:41] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2021-05-09 07:36:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:36:41] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-09 07:36:41] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2021-05-09 07:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:41] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2021-05-09 07:36:41] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:36:42] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 1 ms to minimize.
[2021-05-09 07:36:42] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:36:42] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:36:42] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2021-05-09 07:36:42] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:36:42] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:36:42] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:36:43] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:36:43] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 4 ms to minimize.
[2021-05-09 07:36:43] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:36:43] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:36:43] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:36:43] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:36:43] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:36:43] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:36:44] [INFO ] Deduced a trap composed of 109 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:36:44] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:36:44] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:36:44] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:36:44] [INFO ] Deduced a trap composed of 155 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:36:44] [INFO ] Deduced a trap composed of 145 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:36:44] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:36:44] [INFO ] Deduced a trap composed of 144 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 146 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 147 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 134 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 137 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 130 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 13 ms to minimize.
[2021-05-09 07:36:45] [INFO ] Deduced a trap composed of 127 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:36:46] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:36:46] [INFO ] Deduced a trap composed of 139 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:36:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-09 07:36:46] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned sat
[2021-05-09 07:36:46] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 07:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:46] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-09 07:36:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:36:46] [INFO ] [Nat]Absence check using 57 positive place invariants in 16 ms returned sat
[2021-05-09 07:36:46] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 07:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:46] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-09 07:36:46] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:36:46] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:36:47] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:36:47] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:36:47] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:36:47] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2021-05-09 07:36:47] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:36:47] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 4 ms to minimize.
[2021-05-09 07:36:47] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:36:47] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2021-05-09 07:36:48] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:36:48] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:36:48] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:36:48] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:36:48] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:36:48] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:36:48] [INFO ] Deduced a trap composed of 127 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:36:48] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:36:49] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:36:49] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:36:49] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:36:49] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:36:49] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:36:49] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:36:49] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2775 ms
[2021-05-09 07:36:49] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 27 ms.
[2021-05-09 07:36:50] [INFO ] Added : 229 causal constraints over 47 iterations in 1073 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-09 07:36:50] [INFO ] [Real]Absence check using 57 positive place invariants in 11 ms returned unsat
[2021-05-09 07:36:50] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2021-05-09 07:36:50] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2021-05-09 07:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:51] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2021-05-09 07:36:51] [INFO ] Deduced a trap composed of 116 places in 159 ms of which 0 ms to minimize.
[2021-05-09 07:36:51] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2021-05-09 07:36:51] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:36:51] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:36:51] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:36:52] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2021-05-09 07:36:52] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:36:52] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:36:52] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:36:52] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:36:52] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:36:53] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:36:53] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:36:53] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:36:53] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:36:53] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2021-05-09 07:36:53] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:36:53] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2021-05-09 07:36:54] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:36:54] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:36:54] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:36:54] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:36:54] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:36:54] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:36:54] [INFO ] Deduced a trap composed of 128 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:36:54] [INFO ] Deduced a trap composed of 150 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:36:55] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:36:55] [INFO ] Deduced a trap composed of 133 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:36:55] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:36:55] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:36:55] [INFO ] Deduced a trap composed of 133 places in 164 ms of which 0 ms to minimize.
[2021-05-09 07:36:55] [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
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 19200 steps, including 108 resets, run finished after 94 ms. (steps per millisecond=204 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 33 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (complete) has 1197 edges and 585 vertex of which 579 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 579 transition count 447
Reduce places removed 80 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 88 rules applied. Total rules applied 169 place count 499 transition count 439
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 177 place count 491 transition count 439
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 177 place count 491 transition count 323
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 425 place count 359 transition count 323
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 496 place count 288 transition count 252
Iterating global reduction 3 with 71 rules applied. Total rules applied 567 place count 288 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 567 place count 288 transition count 249
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 574 place count 284 transition count 249
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 742 place count 199 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 743 place count 199 transition count 165
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 745 place count 198 transition count 169
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 748 place count 198 transition count 169
Applied a total of 748 rules in 159 ms. Remains 198 /585 variables (removed 387) and now considering 169/528 (removed 359) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/585 places, 169/528 transitions.
[2021-05-09 07:36:56] [INFO ] Flatten gal took : 70 ms
[2021-05-09 07:36:56] [INFO ] Flatten gal took : 24 ms
[2021-05-09 07:36:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11783538166986731650.gal : 30 ms
[2021-05-09 07:36:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10335989325580384073.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11783538166986731650.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10335989325580384073.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/ReachabilityCardinality11783538166986731650.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10335989325580384073.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10335989325580384073.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :14 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 379
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :379 after 1277
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1277 after 3637
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3637 after 12877
Reachability property BusinessProcesses-PT-13-ReachabilityFireability-14 is true.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :12877 after 44077
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :44077 after 80333
Invariant property BusinessProcesses-PT-13-ReachabilityFireability-04 does not hold.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :80333 after 1.96878e+06
Invariant property BusinessProcesses-PT-13-ReachabilityFireability-09 does not hold.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,5.9106e+06,0.839208,27252,2,8707,18,60889,6,0,961,54488,0
Total reachable state count : 5910601

Verifying 3 reachability properties.
Invariant property BusinessProcesses-PT-13-ReachabilityFireability-04 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-13-ReachabilityFireability-04,1,0.841449,27516,2,199,18,60889,7,0,980,54488,0
Invariant property BusinessProcesses-PT-13-ReachabilityFireability-09 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-13-ReachabilityFireability-09,2,0.842898,27516,2,200,18,60889,8,0,1004,54488,0
Reachability property BusinessProcesses-PT-13-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-13-ReachabilityFireability-14,21736,2.10294,27516,2,1826,18,60889,9,0,1030,54488,0
All properties solved without resorting to model-checking.

BK_STOP 1620545818581

--------------------
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-13"
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-13, 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-162038143900423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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