fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r235-smll-162106564700271
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldRVt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
270.020 47554.00 69164.00 432.50 TFFTFFFTTTFTTTFT 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.r235-smll-162106564700271.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 ShieldRVt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564700271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 19:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:01 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 119K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621256537744

Running Version 0
[2021-05-17 13:02:20] [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-17 13:02:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:02:20] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2021-05-17 13:02:20] [INFO ] Transformed 503 places.
[2021-05-17 13:02:20] [INFO ] Transformed 503 transitions.
[2021-05-17 13:02:20] [INFO ] Found NUPN structural information;
[2021-05-17 13:02:20] [INFO ] Parsed PT model containing 503 places and 503 transitions in 223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :10
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 503 rows 503 cols
[2021-05-17 13:02:21] [INFO ] Computed 41 place invariants in 28 ms
[2021-05-17 13:02:21] [INFO ] [Real]Absence check using 41 positive place invariants in 50 ms returned sat
[2021-05-17 13:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:02:22] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2021-05-17 13:02:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:02:22] [INFO ] [Nat]Absence check using 41 positive place invariants in 33 ms returned sat
[2021-05-17 13:02:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:02:22] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2021-05-17 13:02:23] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 7 ms to minimize.
[2021-05-17 13:02:23] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 2 ms to minimize.
[2021-05-17 13:02:23] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 1 ms to minimize.
[2021-05-17 13:02:23] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2021-05-17 13:02:24] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 0 ms to minimize.
[2021-05-17 13:02:24] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2021-05-17 13:02:24] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 0 ms to minimize.
[2021-05-17 13:02:24] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 1 ms to minimize.
[2021-05-17 13:02:24] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2021-05-17 13:02:24] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 1 ms to minimize.
[2021-05-17 13:02:25] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2021-05-17 13:02:25] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2021-05-17 13:02:25] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2021-05-17 13:02:25] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2021-05-17 13:02:25] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 1 ms to minimize.
[2021-05-17 13:02:25] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2021-05-17 13:02:26] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2021-05-17 13:02:26] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2021-05-17 13:02:26] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2021-05-17 13:02:26] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2021-05-17 13:02:26] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2021-05-17 13:02:26] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2021-05-17 13:02:26] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2021-05-17 13:02:27] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2021-05-17 13:02:27] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4167 ms
[2021-05-17 13:02:27] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 44 ms.
[2021-05-17 13:02:27] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 0 ms to minimize.
[2021-05-17 13:02:27] [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 13:02:27] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2021-05-17 13:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:02:27] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2021-05-17 13:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:02:28] [INFO ] [Nat]Absence check using 41 positive place invariants in 25 ms returned sat
[2021-05-17 13:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:02:28] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2021-05-17 13:02:28] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 1 ms to minimize.
[2021-05-17 13:02:28] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2021-05-17 13:02:28] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2021-05-17 13:02:29] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 1 ms to minimize.
[2021-05-17 13:02:29] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2021-05-17 13:02:29] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2021-05-17 13:02:29] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2021-05-17 13:02:29] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 1 ms to minimize.
[2021-05-17 13:02:30] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2021-05-17 13:02:30] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 6 ms to minimize.
[2021-05-17 13:02:30] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2021-05-17 13:02:30] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 1 ms to minimize.
[2021-05-17 13:02:30] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2021-05-17 13:02:30] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2021-05-17 13:02:30] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2021-05-17 13:02:30] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2574 ms
[2021-05-17 13:02:31] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 43 ms.
[2021-05-17 13:02:33] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2021-05-17 13:02:33] [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 13:02:33] [INFO ] [Real]Absence check using 41 positive place invariants in 23 ms returned sat
[2021-05-17 13:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:02:33] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-17 13:02:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:02:33] [INFO ] [Nat]Absence check using 41 positive place invariants in 23 ms returned sat
[2021-05-17 13:02:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:02:33] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-17 13:02:34] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2021-05-17 13:02:34] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 1 ms to minimize.
[2021-05-17 13:02:34] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 1 ms to minimize.
[2021-05-17 13:02:34] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 1 ms to minimize.
[2021-05-17 13:02:34] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2021-05-17 13:02:35] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 1 ms to minimize.
[2021-05-17 13:02:35] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2021-05-17 13:02:35] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2021-05-17 13:02:35] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 0 ms to minimize.
[2021-05-17 13:02:35] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2021-05-17 13:02:35] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2021-05-17 13:02:36] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2021-05-17 13:02:36] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2021-05-17 13:02:36] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2021-05-17 13:02:36] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 17 ms to minimize.
[2021-05-17 13:02:36] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2448 ms
[2021-05-17 13:02:36] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 35 ms.
[2021-05-17 13:02:39] [INFO ] Deduced a trap composed of 15 places in 344 ms of which 1 ms to minimize.
[2021-05-17 13:02:39] [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 13:02:39] [INFO ] [Real]Absence check using 41 positive place invariants in 36 ms returned sat
[2021-05-17 13:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:02:39] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2021-05-17 13:02:39] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2021-05-17 13:02:39] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2021-05-17 13:02:40] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2021-05-17 13:02:40] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 1 ms to minimize.
[2021-05-17 13:02:40] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2021-05-17 13:02:40] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2021-05-17 13:02:40] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 1 ms to minimize.
[2021-05-17 13:02:40] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 0 ms to minimize.
[2021-05-17 13:02:40] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2021-05-17 13:02:41] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 4 ms to minimize.
[2021-05-17 13:02:41] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 4 ms to minimize.
[2021-05-17 13:02:41] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2021-05-17 13:02:41] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2021-05-17 13:02:41] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2021-05-17 13:02:41] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2021-05-17 13:02:42] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2021-05-17 13:02:42] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2021-05-17 13:02:42] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2021-05-17 13:02:42] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2021-05-17 13:02:42] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2021-05-17 13:02:42] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3104 ms
[2021-05-17 13:02:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:02:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 29 ms returned sat
[2021-05-17 13:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:02:43] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-17 13:02:43] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 1 ms to minimize.
[2021-05-17 13:02:43] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 1 ms to minimize.
[2021-05-17 13:02:43] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 1 ms to minimize.
[2021-05-17 13:02:43] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 1 ms to minimize.
[2021-05-17 13:02:44] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 1 ms to minimize.
[2021-05-17 13:02:44] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2021-05-17 13:02:44] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 0 ms to minimize.
[2021-05-17 13:02:44] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2021-05-17 13:02:44] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2021-05-17 13:02:45] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2021-05-17 13:02:45] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 1 ms to minimize.
[2021-05-17 13:02:45] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2021-05-17 13:02:45] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2021-05-17 13:02:45] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2021-05-17 13:02:46] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2021-05-17 13:02:46] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2021-05-17 13:02:46] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2021-05-17 13:02:46] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 1 ms to minimize.
[2021-05-17 13:02:46] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2021-05-17 13:02:46] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 1 ms to minimize.
[2021-05-17 13:02:47] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 1 ms to minimize.
[2021-05-17 13:02:47] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2021-05-17 13:02:47] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2021-05-17 13:02:47] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2021-05-17 13:02:47] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2021-05-17 13:02:47] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4603 ms
[2021-05-17 13:02:47] [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: Broken pipe")... while checking expression at index 3
Fused 4 Parikh solutions to 1 different solutions.
Support contains 30 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 503 transition count 363
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 282 place count 363 transition count 361
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 293 place count 362 transition count 351
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 303 place count 352 transition count 351
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 303 place count 352 transition count 312
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 381 place count 313 transition count 312
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 440 place count 254 transition count 253
Iterating global reduction 4 with 59 rules applied. Total rules applied 499 place count 254 transition count 253
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 499 place count 254 transition count 232
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 541 place count 233 transition count 232
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 709 place count 149 transition count 148
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 749 place count 129 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 750 place count 128 transition count 159
Applied a total of 750 rules in 205 ms. Remains 128 /503 variables (removed 375) and now considering 159/503 (removed 344) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/503 places, 159/503 transitions.
[2021-05-17 13:02:48] [INFO ] Flatten gal took : 103 ms
[2021-05-17 13:02:48] [INFO ] Flatten gal took : 33 ms
[2021-05-17 13:02:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12105597617563039775.gal : 19 ms
[2021-05-17 13:02:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10008640394087365216.prop : 2 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/ReachabilityCardinality12105597617563039775.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10008640394087365216.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/ReachabilityCardinality12105597617563039775.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10008640394087365216.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10008640394087365216.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 23
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :23 after 183
Reachability property ShieldRVt-PT-010B-ReachabilityFireability-03 is true.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2916 after 9455
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :9455 after 10173
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :10173 after 22797
Reachability property ShieldRVt-PT-010B-ReachabilityFireability-07 is true.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :22797 after 194920
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-04 does not hold.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :194920 after 2.27294e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.27294e+06 after 1.25877e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.25877e+07 after 3.49491e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.49491e+07 after 8.82658e+08
Detected timeout of ITS tools.
[2021-05-17 13:03:03] [INFO ] Flatten gal took : 19 ms
[2021-05-17 13:03:03] [INFO ] Applying decomposition
[2021-05-17 13:03:03] [INFO ] Flatten gal took : 18 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/graph7118415295266229795.txt, -o, /tmp/graph7118415295266229795.bin, -w, /tmp/graph7118415295266229795.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/graph7118415295266229795.bin, -l, -1, -v, -w, /tmp/graph7118415295266229795.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 13:03:03] [INFO ] Decomposing Gal with order
[2021-05-17 13:03:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 13:03:03] [INFO ] Removed a total of 141 redundant transitions.
[2021-05-17 13:03:03] [INFO ] Flatten gal took : 109 ms
[2021-05-17 13:03:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 20 ms.
[2021-05-17 13:03:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4094688099477353686.gal : 7 ms
[2021-05-17 13:03:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12790248828388615189.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/ReachabilityCardinality4094688099477353686.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12790248828388615189.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/ReachabilityCardinality4094688099477353686.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12790248828388615189.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12790248828388615189.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 89
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :89 after 729
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :63735 after 7.66952e+06
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-05 does not hold.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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\_mod\_flat,8.63717e+13,0.216391,7128,392,136,5438,664,405,13829,102,3849,0
Total reachable state count : 86371737049815

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-05 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
ShieldRVt-PT-010B-ReachabilityFireability-05,1.14555e+12,0.228335,7392,213,83,5438,664,432,13829,109,3849,0
All properties solved without resorting to model-checking.

BK_STOP 1621256585298

--------------------
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="ShieldRVt-PT-010B"
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 ShieldRVt-PT-010B, 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 r235-smll-162106564700271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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