About the Execution of ITS-Tools for ShieldRVs-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
508.968 | 55549.00 | 78379.00 | 824.40 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r242-smll-162106584500058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r242-smll-162106584500058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 122K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1621236004666
Running Version 0
[2021-05-17 07:20:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2021-05-17 07:20:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:20:08] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2021-05-17 07:20:08] [INFO ] Transformed 403 places.
[2021-05-17 07:20:08] [INFO ] Transformed 453 transitions.
[2021-05-17 07:20:08] [INFO ] Found NUPN structural information;
[2021-05-17 07:20:08] [INFO ] Parsed PT model containing 403 places and 453 transitions in 213 ms.
Structural test allowed to assert that 191 places are NOT stable. Took 17 ms.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 212) seen :204
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 453 rows 403 cols
[2021-05-17 07:20:09] [INFO ] Computed 41 place invariants in 20 ms
[2021-05-17 07:20:09] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2021-05-17 07:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:09] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-17 07:20:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:20:10] [INFO ] [Nat]Absence check using 41 positive place invariants in 39 ms returned sat
[2021-05-17 07:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:10] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2021-05-17 07:20:11] [INFO ] Deduced a trap composed of 78 places in 297 ms of which 5 ms to minimize.
[2021-05-17 07:20:11] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 2 ms to minimize.
[2021-05-17 07:20:11] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2021-05-17 07:20:11] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2021-05-17 07:20:11] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 2 ms to minimize.
[2021-05-17 07:20:12] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2021-05-17 07:20:12] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 3 ms to minimize.
[2021-05-17 07:20:12] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 2 ms to minimize.
[2021-05-17 07:20:13] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 6 ms to minimize.
[2021-05-17 07:20:13] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 1 ms to minimize.
[2021-05-17 07:20:13] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2021-05-17 07:20:13] [INFO ] Deduced a trap composed of 40 places in 285 ms of which 1 ms to minimize.
[2021-05-17 07:20:14] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2021-05-17 07:20:14] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 1 ms to minimize.
[2021-05-17 07:20:14] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 0 ms to minimize.
[2021-05-17 07:20:14] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2021-05-17 07:20:14] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2021-05-17 07:20:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4134 ms
[2021-05-17 07:20:14] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 55 ms.
[2021-05-17 07:20:15] [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-17 07:20:15] [INFO ] [Real]Absence check using 41 positive place invariants in 23 ms returned sat
[2021-05-17 07:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:15] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-17 07:20:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:20:15] [INFO ] [Nat]Absence check using 41 positive place invariants in 27 ms returned sat
[2021-05-17 07:20:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:15] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2021-05-17 07:20:16] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2021-05-17 07:20:16] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 0 ms to minimize.
[2021-05-17 07:20:16] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 1 ms to minimize.
[2021-05-17 07:20:16] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 1 ms to minimize.
[2021-05-17 07:20:16] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 1 ms to minimize.
[2021-05-17 07:20:17] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 2 ms to minimize.
[2021-05-17 07:20:17] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2021-05-17 07:20:17] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2021-05-17 07:20:17] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2021-05-17 07:20:17] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2021-05-17 07:20:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1727 ms
[2021-05-17 07:20:17] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-17 07:20:20] [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-17 07:20:20] [INFO ] [Real]Absence check using 41 positive place invariants in 31 ms returned sat
[2021-05-17 07:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:20] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2021-05-17 07:20:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:20:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 32 ms returned sat
[2021-05-17 07:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:21] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2021-05-17 07:20:21] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2021-05-17 07:20:21] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2021-05-17 07:20:21] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2021-05-17 07:20:22] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
[2021-05-17 07:20:22] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2021-05-17 07:20:22] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2021-05-17 07:20:22] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 2 ms to minimize.
[2021-05-17 07:20:23] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 8 ms to minimize.
[2021-05-17 07:20:23] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2021-05-17 07:20:23] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2021-05-17 07:20:23] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 0 ms to minimize.
[2021-05-17 07:20:23] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 1 ms to minimize.
[2021-05-17 07:20:24] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 1 ms to minimize.
[2021-05-17 07:20:24] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2021-05-17 07:20:24] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 1 ms to minimize.
[2021-05-17 07:20:24] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 1 ms to minimize.
[2021-05-17 07:20:25] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 1 ms to minimize.
[2021-05-17 07:20:25] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2021-05-17 07:20:25] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 1 ms to minimize.
[2021-05-17 07:20:25] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 0 ms to minimize.
[2021-05-17 07:20:26] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2021-05-17 07:20:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-17 07:20:26] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2021-05-17 07:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:26] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2021-05-17 07:20:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:20:26] [INFO ] [Nat]Absence check using 41 positive place invariants in 35 ms returned sat
[2021-05-17 07:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:26] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2021-05-17 07:20:27] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2021-05-17 07:20:27] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2021-05-17 07:20:27] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 2 ms to minimize.
[2021-05-17 07:20:27] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 0 ms to minimize.
[2021-05-17 07:20:28] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 1 ms to minimize.
[2021-05-17 07:20:28] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 1 ms to minimize.
[2021-05-17 07:20:28] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 1 ms to minimize.
[2021-05-17 07:20:28] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 1 ms to minimize.
[2021-05-17 07:20:28] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 5 ms to minimize.
[2021-05-17 07:20:29] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 0 ms to minimize.
[2021-05-17 07:20:29] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2021-05-17 07:20:29] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2021-05-17 07:20:29] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2021-05-17 07:20:29] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2021-05-17 07:20:29] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2021-05-17 07:20:30] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2021-05-17 07:20:30] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2021-05-17 07:20:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3346 ms
[2021-05-17 07:20:30] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 55 ms.
[2021-05-17 07:20:31] [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-17 07:20:31] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2021-05-17 07:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:32] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2021-05-17 07:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:20:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 36 ms returned sat
[2021-05-17 07:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:32] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2021-05-17 07:20:32] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 2 ms to minimize.
[2021-05-17 07:20:33] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 1 ms to minimize.
[2021-05-17 07:20:33] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2021-05-17 07:20:33] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 1 ms to minimize.
[2021-05-17 07:20:34] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 2 ms to minimize.
[2021-05-17 07:20:34] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 1 ms to minimize.
[2021-05-17 07:20:34] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 0 ms to minimize.
[2021-05-17 07:20:34] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 1 ms to minimize.
[2021-05-17 07:20:35] [INFO ] Deduced a trap composed of 24 places in 330 ms of which 1 ms to minimize.
[2021-05-17 07:20:35] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 0 ms to minimize.
[2021-05-17 07:20:35] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2021-05-17 07:20:35] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 0 ms to minimize.
[2021-05-17 07:20:36] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 1 ms to minimize.
[2021-05-17 07:20:36] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 1 ms to minimize.
[2021-05-17 07:20:36] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 1 ms to minimize.
[2021-05-17 07:20:36] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 1 ms to minimize.
[2021-05-17 07:20:36] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2021-05-17 07:20:37] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2021-05-17 07:20:37] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 1 ms to minimize.
[2021-05-17 07:20:37] [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 4
[2021-05-17 07:20:37] [INFO ] [Real]Absence check using 41 positive place invariants in 24 ms returned sat
[2021-05-17 07:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:37] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2021-05-17 07:20:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:20:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 27 ms returned sat
[2021-05-17 07:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:38] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2021-05-17 07:20:38] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 1 ms to minimize.
[2021-05-17 07:20:38] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 1 ms to minimize.
[2021-05-17 07:20:38] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 1 ms to minimize.
[2021-05-17 07:20:39] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 1 ms to minimize.
[2021-05-17 07:20:39] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 1 ms to minimize.
[2021-05-17 07:20:39] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 0 ms to minimize.
[2021-05-17 07:20:39] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 1 ms to minimize.
[2021-05-17 07:20:40] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2021-05-17 07:20:40] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 1 ms to minimize.
[2021-05-17 07:20:40] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 1 ms to minimize.
[2021-05-17 07:20:40] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 0 ms to minimize.
[2021-05-17 07:20:41] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2021-05-17 07:20:41] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 1 ms to minimize.
[2021-05-17 07:20:41] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2021-05-17 07:20:41] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 1 ms to minimize.
[2021-05-17 07:20:42] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 1 ms to minimize.
[2021-05-17 07:20:42] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 1 ms to minimize.
[2021-05-17 07:20:42] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2021-05-17 07:20:42] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2021-05-17 07:20:42] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2021-05-17 07:20:42] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4623 ms
[2021-05-17 07:20:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 5
Fused 6 Parikh solutions to 1 different solutions.
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 453/453 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 403 transition count 412
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 362 transition count 412
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 362 transition count 362
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 312 transition count 362
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 246 place count 248 transition count 298
Iterating global reduction 2 with 64 rules applied. Total rules applied 310 place count 248 transition count 298
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 310 place count 248 transition count 268
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 370 place count 218 transition count 268
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 510 place count 148 transition count 198
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 532 place count 148 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 533 place count 147 transition count 197
Applied a total of 533 rules in 256 ms. Remains 147 /403 variables (removed 256) and now considering 197/453 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/403 places, 197/453 transitions.
[2021-05-17 07:20:43] [INFO ] Flatten gal took : 135 ms
[2021-05-17 07:20:43] [INFO ] Flatten gal took : 44 ms
[2021-05-17 07:20:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17582537400775612558.gal : 41 ms
[2021-05-17 07:20:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9658843183303913763.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/ReachabilityCardinality17582537400775612558.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9658843183303913763.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/ReachabilityCardinality17582537400775612558.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9658843183303913763.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9658843183303913763.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 31
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :31 after 213
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :213 after 285
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :285 after 776
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :776 after 13315
Invariant property smplace_100 does not hold.
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :13315 after 52131
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :52131 after 1.64012e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.64012e+06 after 4.67973e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :4.67973e+06 after 1.30197e+08
Invariant property smplace_178 does not hold.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.30197e+08 after 6.07487e+08
Invariant property smplace_201 does not hold.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :6.07487e+08 after 2.60408e+10
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.60408e+10 after 6.62975e+10
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :6.62975e+10 after 2.05028e+12
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :2.05028e+12 after 1.83518e+14
Invariant property smplace_318 does not hold.
Invariant property smplace_295 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.83518e+14 after 3.01113e+16
Invariant property smplace_334 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 213 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL
BK_STOP 1621236060215
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="ShieldRVs-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldRVs-PT-010B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r242-smll-162106584500058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010B.tgz
mv ShieldRVs-PT-010B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;