fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286026100982
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldRVt-PT-020A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8725.651 126167.00 202558.00 1109.10 TTTTTFFTFFTFTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026100982.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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-020A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026100982
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K Apr 30 01:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 01:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 01:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 30 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 30 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 30 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 30 01:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 54K May 10 09:34 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-020A-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654282460734

Running Version 202205111006
[2022-06-03 18:54:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2022-06-03 18:54:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:54:22] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-06-03 18:54:22] [INFO ] Transformed 163 places.
[2022-06-03 18:54:22] [INFO ] Transformed 163 transitions.
[2022-06-03 18:54:22] [INFO ] Found NUPN structural information;
[2022-06-03 18:54:22] [INFO ] Parsed PT model containing 163 places and 163 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 14) seen :3
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 162 rows 163 cols
[2022-06-03 18:54:23] [INFO ] Computed 81 place invariants in 12 ms
[2022-06-03 18:54:24] [INFO ] [Real]Absence check using 81 positive place invariants in 15 ms returned sat
[2022-06-03 18:54:24] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-03 18:54:24] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2022-06-03 18:54:24] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2022-06-03 18:54:24] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 155 ms.
[2022-06-03 18:54:24] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1501 ms.
Support contains 50 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 162/162 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 163 transition count 162
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 163 transition count 152
Applied a total of 20 rules in 42 ms. Remains 163 /163 variables (removed 0) and now considering 152/162 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/163 places, 152/162 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11952 ms. (steps per millisecond=83 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2393 ms. (steps per millisecond=417 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2756 ms. (steps per millisecond=362 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 152 rows 163 cols
[2022-06-03 18:54:43] [INFO ] Computed 81 place invariants in 5 ms
[2022-06-03 18:54:43] [INFO ] [Real]Absence check using 81 positive place invariants in 9 ms returned sat
[2022-06-03 18:54:43] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 18:54:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2022-06-03 18:54:43] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 18:54:43] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-06-03 18:54:43] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 250 ms.
Support contains 38 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 152/152 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 151
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 162 transition count 151
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 162 transition count 150
Applied a total of 4 rules in 32 ms. Remains 162 /163 variables (removed 1) and now considering 150/152 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/163 places, 150/152 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7360 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2324 ms. (steps per millisecond=430 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2998 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12065641 steps, run timeout after 36004 ms. (steps per millisecond=335 ) properties seen :{0=1}
Probabilistic random walk after 12065641 steps, saw 10841147 distinct states, run finished after 36005 ms. (steps per millisecond=335 ) properties seen :1
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 150 rows 162 cols
[2022-06-03 18:55:32] [INFO ] Computed 81 place invariants in 4 ms
[2022-06-03 18:55:32] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:55:33] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2022-06-03 18:55:33] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:55:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 18:55:33] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:55:33] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-03 18:55:33] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 27 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 150/150 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 162 transition count 150
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 162 transition count 147
Applied a total of 6 rules in 17 ms. Remains 162 /162 variables (removed 0) and now considering 147/150 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 147/150 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2677 ms. (steps per millisecond=373 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2001 ms. (steps per millisecond=499 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4539784 steps, run timeout after 12001 ms. (steps per millisecond=378 ) properties seen :{}
Probabilistic random walk after 4539784 steps, saw 4164623 distinct states, run finished after 12001 ms. (steps per millisecond=378 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 147 rows 162 cols
[2022-06-03 18:55:49] [INFO ] Computed 81 place invariants in 7 ms
[2022-06-03 18:55:49] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:55:50] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-06-03 18:55:50] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:55:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 18:55:50] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:55:50] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-03 18:55:50] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 27 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 147/147 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 147/147 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 147/147 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 162 cols
[2022-06-03 18:55:50] [INFO ] Computed 81 place invariants in 3 ms
[2022-06-03 18:55:50] [INFO ] Implicit Places using invariants in 94 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 161/162 places, 147/147 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/162 places, 147/147 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2759 ms. (steps per millisecond=362 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1956 ms. (steps per millisecond=511 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4558784 steps, run timeout after 12009 ms. (steps per millisecond=379 ) properties seen :{}
Probabilistic random walk after 4558784 steps, saw 4181382 distinct states, run finished after 12010 ms. (steps per millisecond=379 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:07] [INFO ] Computed 80 place invariants in 3 ms
[2022-06-03 18:56:07] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:56:07] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-06-03 18:56:07] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:56:07] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-03 18:56:07] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 27 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 147/147 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 147/147 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 147/147 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:07] [INFO ] Computed 80 place invariants in 1 ms
[2022-06-03 18:56:07] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:07] [INFO ] Computed 80 place invariants in 1 ms
[2022-06-03 18:56:07] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2022-06-03 18:56:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:07] [INFO ] Computed 80 place invariants in 2 ms
[2022-06-03 18:56:07] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 147/147 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2759 ms. (steps per millisecond=362 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1938 ms. (steps per millisecond=515 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4336172 steps, run timeout after 12001 ms. (steps per millisecond=361 ) properties seen :{}
Probabilistic random walk after 4336172 steps, saw 3979662 distinct states, run finished after 12003 ms. (steps per millisecond=361 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:24] [INFO ] Computed 80 place invariants in 2 ms
[2022-06-03 18:56:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:56:24] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2022-06-03 18:56:24] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:56:24] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-03 18:56:24] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 27 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 147/147 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:24] [INFO ] Computed 80 place invariants in 2 ms
[2022-06-03 18:56:24] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:24] [INFO ] Computed 80 place invariants in 1 ms
[2022-06-03 18:56:24] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-06-03 18:56:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:24] [INFO ] Computed 80 place invariants in 0 ms
[2022-06-03 18:56:24] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:24] [INFO ] Computed 80 place invariants in 1 ms
[2022-06-03 18:56:25] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:56:25] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2022-06-03 18:56:25] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:56:25] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-03 18:56:25] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:56:25] [INFO ] Flatten gal took : 81 ms
[2022-06-03 18:56:25] [INFO ] Flatten gal took : 23 ms
[2022-06-03 18:56:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6877482311285347243.gal : 12 ms
[2022-06-03 18:56:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13571285938064606330.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6877482311285347243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13571285938064606330.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13571285938064606330.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 149
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :149 after 509
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :509 after 114705
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :114705 after 5.36871e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.36871e+08 after 6.86799e+16
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,1.20893e+24,0.085709,6088,2,401,14,10194,7,0,839,10907,0
Total reachable state count : 1208925819614629174706176

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-020A-ReachabilityCardinality-11 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-020A-ReachabilityCardinality-11,6.91753e+19,0.090565,6088,2,526,14,10194,7,0,885,10907,0
[2022-06-03 18:56:25] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2043655521716539924
[2022-06-03 18:56:25] [INFO ] Applying decomposition
[2022-06-03 18:56:25] [INFO ] Flatten gal took : 33 ms
[2022-06-03 18:56:26] [INFO ] Flatten gal took : 18 ms
[2022-06-03 18:56:26] [INFO ] Computing symmetric may disable matrix : 147 transitions.
[2022-06-03 18:56:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:56:26] [INFO ] Computing symmetric may enable matrix : 147 transitions.
[2022-06-03 18:56:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:56:26] [INFO ] Computing Do-Not-Accords matrix : 147 transitions.
[2022-06-03 18:56:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:56:26] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2043655521716539924
[2022-06-03 18:56:26] [INFO ] Input system was already deterministic with 147 transitions.
Running compilation step : cd /tmp/ltsmin2043655521716539924;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13691823148026397006.txt' '-o' '/tmp/graph13691823148026397006.bin' '-w' '/tmp/graph13691823148026397006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13691823148026397006.bin' '-l' '-1' '-v' '-w' '/tmp/graph13691823148026397006.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:56:26] [INFO ] Ran tautology test, simplified 0 / 1 in 223 ms.
[2022-06-03 18:56:26] [INFO ] Decomposing Gal with order
[2022-06-03 18:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:56:26] [INFO ] BMC solution for property ShieldRVt-PT-020A-ReachabilityCardinality-11(UNSAT) depth K=0 took 12 ms
[2022-06-03 18:56:26] [INFO ] BMC solution for property ShieldRVt-PT-020A-ReachabilityCardinality-11(UNSAT) depth K=1 took 9 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 147 rows 161 cols
[2022-06-03 18:56:26] [INFO ] Computed 80 place invariants in 1 ms
[2022-06-03 18:56:26] [INFO ] Computed 80 place invariants in 2 ms
[2022-06-03 18:56:26] [INFO ] Removed a total of 59 redundant transitions.
[2022-06-03 18:56:26] [INFO ] BMC solution for property ShieldRVt-PT-020A-ReachabilityCardinality-11(UNSAT) depth K=2 took 205 ms
[2022-06-03 18:56:26] [INFO ] Flatten gal took : 146 ms
[2022-06-03 18:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2022-06-03 18:56:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4266627282069400341.gal : 14 ms
[2022-06-03 18:56:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8436232844596499971.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4266627282069400341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8436232844596499971.prop' '--nowitness'
[2022-06-03 18:56:26] [INFO ] BMC solution for property ShieldRVt-PT-020A-ReachabilityCardinality-11(UNSAT) depth K=3 took 67 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality8436232844596499971.prop.
Invariant property ShieldRVt-PT-020A-ReachabilityCardinality-11 does not hold.
FORMULA ShieldRVt-PT-020A-ReachabilityCardinality-11 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 3 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,1.20893e+24,0.046529,5956,52,9,1716,61,221,2805,18,89,0
Total reachable state count : 1208925819614629174706176

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-020A-ReachabilityCardinality-11 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-020A-ReachabilityCardinality-11,1.38351e+20,0.049606,5956,78,8,1716,61,358,2805,29,89,0
[2022-06-03 18:56:26] [WARNING] Interrupting SMT solver.
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Exception in thread "Thread-7" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 18:56:26] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVt-PT-020A-ReachabilityCardinality-11 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 18:56:26] [INFO ] During BMC, SMT solver timed out at depth 4
[2022-06-03 18:56:26] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2022-06-03 18:56:26] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 124869 ms.

BK_STOP 1654282586901

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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-020A"
export BK_EXAMINATION="ReachabilityCardinality"
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-020A, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286026100982"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020A.tgz
mv ShieldRVt-PT-020A execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;