About the Execution of ITS-Tools for BusinessProcesses-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 323.407 | 55573.00 | 73942.00 | 60.30 | FFTTTTTFFTTTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800399.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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800399
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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.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.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 131K 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-10-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620544835312
Running Version 0
[2021-05-09 07:20:36] [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:20:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:20:37] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-09 07:20:37] [INFO ] Transformed 518 places.
[2021-05-09 07:20:37] [INFO ] Transformed 471 transitions.
[2021-05-09 07:20:37] [INFO ] Found NUPN structural information;
[2021-05-09 07:20:37] [INFO ] Parsed PT model containing 518 places and 471 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 80 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :2
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :2
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 471 rows 518 cols
[2021-05-09 07:20:37] [INFO ] Computed 85 place invariants in 38 ms
[2021-05-09 07:20:37] [INFO ] [Real]Absence check using 48 positive place invariants in 29 ms returned sat
[2021-05-09 07:20:37] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned unsat
[2021-05-09 07:20:38] [INFO ] [Real]Absence check using 48 positive place invariants in 78 ms returned sat
[2021-05-09 07:20:38] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 37 ms returned sat
[2021-05-09 07:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:38] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2021-05-09 07:20:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:38] [INFO ] [Nat]Absence check using 48 positive place invariants in 238 ms returned sat
[2021-05-09 07:20:38] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-09 07:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:39] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2021-05-09 07:20:39] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2021-05-09 07:20:39] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:20:39] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:20:39] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2021-05-09 07:20:39] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:20:39] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:20:40] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:20:40] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:20:40] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:20:40] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
[2021-05-09 07:20:40] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:20:40] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:20:40] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:20:41] [INFO ] Deduced a trap composed of 127 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:20:41] [INFO ] Deduced a trap composed of 122 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:20:41] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:20:41] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:20:41] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:20:41] [INFO ] Deduced a trap composed of 115 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:20:41] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:20:42] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:20:42] [INFO ] Deduced a trap composed of 112 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:20:42] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2021-05-09 07:20:42] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:20:42] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:20:43] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:20:43] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:20:43] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:20:43] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:20:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-09 07:20:43] [INFO ] [Real]Absence check using 48 positive place invariants in 23 ms returned sat
[2021-05-09 07:20:43] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned sat
[2021-05-09 07:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:43] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-09 07:20:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:20:44] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:20:45] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:20:45] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:20:45] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:20:45] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:20:45] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:20:45] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:20:45] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:20:45] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1677 ms
[2021-05-09 07:20:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:45] [INFO ] [Nat]Absence check using 48 positive place invariants in 24 ms returned sat
[2021-05-09 07:20:45] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2021-05-09 07:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:45] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 3 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 8 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:20:46] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:20:47] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:20:47] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:20:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1291 ms
[2021-05-09 07:20:47] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 39 ms.
[2021-05-09 07:20:48] [INFO ] Added : 252 causal constraints over 51 iterations in 1427 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-09 07:20:48] [INFO ] [Real]Absence check using 48 positive place invariants in 23 ms returned sat
[2021-05-09 07:20:48] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned sat
[2021-05-09 07:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:48] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2021-05-09 07:20:49] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2021-05-09 07:20:49] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 1 ms to minimize.
[2021-05-09 07:20:49] [INFO ] Deduced a trap composed of 126 places in 154 ms of which 0 ms to minimize.
[2021-05-09 07:20:49] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:20:49] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2021-05-09 07:20:50] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 0 ms to minimize.
[2021-05-09 07:20:50] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:20:50] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:20:50] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2021-05-09 07:20:50] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:20:50] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:20:51] [INFO ] Deduced a trap composed of 109 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:20:51] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:20:51] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:20:51] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 0 ms to minimize.
[2021-05-09 07:20:51] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:20:51] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:20:52] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:20:52] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:20:52] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:20:52] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:20:52] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 0 ms to minimize.
[2021-05-09 07:20:52] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:20:53] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:20:53] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:20:53] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:20:53] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:20:53] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:20:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-09 07:20:53] [INFO ] [Real]Absence check using 48 positive place invariants in 19 ms returned unsat
[2021-05-09 07:20:53] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned sat
[2021-05-09 07:20:53] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2021-05-09 07:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:54] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2021-05-09 07:20:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:54] [INFO ] [Nat]Absence check using 48 positive place invariants in 23 ms returned sat
[2021-05-09 07:20:54] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-09 07:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:54] [INFO ] [Nat]Absence check using state equation in 204 ms returned unsat
[2021-05-09 07:20:54] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned sat
[2021-05-09 07:20:54] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2021-05-09 07:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:54] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-09 07:20:55] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 0 ms to minimize.
[2021-05-09 07:20:55] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:20:55] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:20:55] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:20:55] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:20:55] [INFO ] Deduced a trap composed of 128 places in 159 ms of which 1 ms to minimize.
[2021-05-09 07:20:56] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:20:56] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:20:56] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:20:56] [INFO ] Deduced a trap composed of 115 places in 164 ms of which 1 ms to minimize.
[2021-05-09 07:20:56] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:20:56] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:20:57] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:20:57] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:20:57] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2021-05-09 07:20:57] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:20:57] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:20:57] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:20:58] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2021-05-09 07:20:58] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:20:58] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:20:58] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:20:58] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:20:58] [INFO ] Deduced a trap composed of 115 places in 166 ms of which 0 ms to minimize.
[2021-05-09 07:20:59] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:20:59] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 1 ms to minimize.
[2021-05-09 07:20:59] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 0 ms to minimize.
[2021-05-09 07:20:59] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:20:59] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 0 ms to minimize.
[2021-05-09 07:20:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-09 07:20:59] [INFO ] [Real]Absence check using 48 positive place invariants in 18 ms returned sat
[2021-05-09 07:20:59] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-09 07:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:00] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-09 07:21:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:21:00] [INFO ] [Nat]Absence check using 48 positive place invariants in 23 ms returned sat
[2021-05-09 07:21:00] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned sat
[2021-05-09 07:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:00] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-09 07:21:00] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2021-05-09 07:21:00] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:21:00] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:21:01] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:21:01] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:21:01] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:21:01] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2021-05-09 07:21:01] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:21:01] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:21:02] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 1 ms to minimize.
[2021-05-09 07:21:02] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:21:02] [INFO ] Deduced a trap composed of 121 places in 173 ms of which 0 ms to minimize.
[2021-05-09 07:21:02] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:21:02] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2021-05-09 07:21:02] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:21:03] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:21:03] [INFO ] Deduced a trap composed of 116 places in 175 ms of which 1 ms to minimize.
[2021-05-09 07:21:03] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:21:03] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 0 ms to minimize.
[2021-05-09 07:21:03] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:21:04] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:21:04] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2021-05-09 07:21:04] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:21:04] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:21:04] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 0 ms to minimize.
[2021-05-09 07:21:04] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:21:05] [INFO ] Deduced a trap composed of 117 places in 152 ms of which 0 ms to minimize.
[2021-05-09 07:21:05] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:21: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 7
[2021-05-09 07:21:05] [INFO ] [Real]Absence check using 48 positive place invariants in 19 ms returned sat
[2021-05-09 07:21:05] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned sat
[2021-05-09 07:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:05] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-09 07:21:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:21:05] [INFO ] [Nat]Absence check using 48 positive place invariants in 20 ms returned sat
[2021-05-09 07:21:05] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2021-05-09 07:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:05] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-09 07:21:05] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2021-05-09 07:21:06] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:21:06] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:21:06] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:21:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2021-05-09 07:21:06] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 39 ms.
[2021-05-09 07:21:08] [INFO ] Added : 279 causal constraints over 57 iterations in 1952 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-09 07:21:08] [INFO ] [Real]Absence check using 48 positive place invariants in 12 ms returned unsat
[2021-05-09 07:21:08] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned sat
[2021-05-09 07:21:08] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 14 ms returned sat
[2021-05-09 07:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:08] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2021-05-09 07:21:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:21:08] [INFO ] [Nat]Absence check using 48 positive place invariants in 21 ms returned sat
[2021-05-09 07:21:08] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-09 07:21:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:09] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-09 07:21:09] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2021-05-09 07:21:09] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 1 ms to minimize.
[2021-05-09 07:21:09] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:21:09] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:21:10] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:21:10] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:21:10] [INFO ] Deduced a trap composed of 114 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:21:10] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:21:10] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:21:10] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:21:10] [INFO ] Deduced a trap composed of 124 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:21:10] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:21:11] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:21:11] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:21:11] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:21:11] [INFO ] Deduced a trap composed of 120 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:21:11] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 1 ms to minimize.
[2021-05-09 07:21:11] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:21:11] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:21:12] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:21:12] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:21:12] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:21:12] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:21:12] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:21:13] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 0 ms to minimize.
[2021-05-09 07:21:13] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2021-05-09 07:21:13] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:21:13] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:21:13] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 0 ms to minimize.
[2021-05-09 07:21:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 26800 steps, including 255 resets, run finished after 92 ms. (steps per millisecond=291 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26900 steps, including 254 resets, run finished after 86 ms. (steps per millisecond=312 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 42 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 517 transition count 403
Reduce places removed 68 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 74 rules applied. Total rules applied 143 place count 449 transition count 397
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 149 place count 443 transition count 397
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 149 place count 443 transition count 297
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 360 place count 332 transition count 297
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 421 place count 271 transition count 236
Iterating global reduction 3 with 61 rules applied. Total rules applied 482 place count 271 transition count 236
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 482 place count 271 transition count 232
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 492 place count 265 transition count 232
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 627 place count 196 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 628 place count 196 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 630 place count 195 transition count 168
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 635 place count 195 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 636 place count 194 transition count 167
Applied a total of 636 rules in 155 ms. Remains 194 /518 variables (removed 324) and now considering 167/471 (removed 304) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/518 places, 167/471 transitions.
[2021-05-09 07:21:14] [INFO ] Flatten gal took : 60 ms
[2021-05-09 07:21:14] [INFO ] Flatten gal took : 22 ms
[2021-05-09 07:21:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1488601432784836377.gal : 12 ms
[2021-05-09 07:21:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5620974491075981040.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/ReachabilityCardinality1488601432784836377.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5620974491075981040.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/ReachabilityCardinality1488601432784836377.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5620974491075981040.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5620974491075981040.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :12 after 30
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :30 after 56
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :56 after 1248
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1248 after 3080
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :3080 after 119036
Invariant property BusinessProcesses-PT-10-ReachabilityFireability-12 does not hold.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-10-ReachabilityFireability-10 is true.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-10-ReachabilityFireability-06 is true.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-10-ReachabilityFireability-04 is true.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :119036 after 255848
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :255848 after 338808
Detected timeout of ITS tools.
[2021-05-09 07:21:29] [INFO ] Flatten gal took : 17 ms
[2021-05-09 07:21:29] [INFO ] Applying decomposition
[2021-05-09 07:21:29] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6049864518749340369.txt, -o, /tmp/graph6049864518749340369.bin, -w, /tmp/graph6049864518749340369.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6049864518749340369.bin, -l, -1, -v, -w, /tmp/graph6049864518749340369.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:21:29] [INFO ] Decomposing Gal with order
[2021-05-09 07:21:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:21:29] [INFO ] Removed a total of 107 redundant transitions.
[2021-05-09 07:21:29] [INFO ] Flatten gal took : 42 ms
[2021-05-09 07:21:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 9 ms.
[2021-05-09 07:21:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17829352605955962227.gal : 5 ms
[2021-05-09 07:21:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3843228895685174679.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/ReachabilityCardinality17829352605955962227.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3843228895685174679.prop, --nowitness], 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/ReachabilityCardinality17829352605955962227.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3843228895685174679.prop --nowitness
Loading property file /tmp/ReachabilityCardinality3843228895685174679.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :4 after 4
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :4 after 4096
Reachability property BusinessProcesses-PT-10-ReachabilityFireability-03 is true.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22144 after 50400
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :50400 after 5.02678e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.02678e+06 after 3.90625e+11
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\_mod\_flat,1.10838e+12,0.814725,37672,1039,694,61323,3218,716,173477,230,13985,0
Total reachable state count : 1108377205888
Verifying 3 reachability properties.
Reachability property BusinessProcesses-PT-10-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-10-ReachabilityFireability-03,64,0.818066,37672,82,60,61323,3218,768,173477,244,13985,459
Invariant property BusinessProcesses-PT-10-ReachabilityFireability-11 is true.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
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-10-ReachabilityFireability-11,0,0.818965,37672,1,0,61323,3218,768,173477,245,13985,725
Invariant property BusinessProcesses-PT-10-ReachabilityFireability-14 is true.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
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-10-ReachabilityFireability-14,0,0.821221,37672,1,0,61323,3218,800,173477,253,13985,1621
All properties solved without resorting to model-checking.
BK_STOP 1620544890885
--------------------
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-10"
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-10, 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-162038143800399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 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 '
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 ;