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

About the Execution of ITS-Tools for ShieldIIPt-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3009.548 59104.00 74838.00 173.40 FTFTFFFTTTTTTTFT 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-165286024900238.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 ShieldIIPt-PT-004B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024900238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.5K Apr 29 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 18:24 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.2K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 29 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 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 67K 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 ShieldIIPt-PT-004B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-004B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654268726843

Running Version 202205111006
[2022-06-03 15:05:28] [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 15:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:05:28] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2022-06-03 15:05:28] [INFO ] Transformed 283 places.
[2022-06-03 15:05:28] [INFO ] Transformed 263 transitions.
[2022-06-03 15:05:28] [INFO ] Found NUPN structural information;
[2022-06-03 15:05:28] [INFO ] Parsed PT model containing 283 places and 263 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 14) seen :5
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 263 rows 283 cols
[2022-06-03 15:05:29] [INFO ] Computed 37 place invariants in 17 ms
[2022-06-03 15:05:29] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 15:05:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2022-06-03 15:05:29] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2022-06-03 15:05:29] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 5 ms to minimize.
[2022-06-03 15:05:29] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2022-06-03 15:05:29] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2022-06-03 15:05:30] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-06-03 15:05:30] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-06-03 15:05:30] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-06-03 15:05:30] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-06-03 15:05:30] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2022-06-03 15:05:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 735 ms
[2022-06-03 15:05:30] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-03 15:05:30] [INFO ] After 1024ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 15 out of 283 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 283/283 places, 263/263 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 283 transition count 202
Reduce places removed 61 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 63 rules applied. Total rules applied 124 place count 222 transition count 200
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 221 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 220 transition count 199
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 127 place count 220 transition count 180
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 165 place count 201 transition count 180
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 191 place count 175 transition count 154
Iterating global reduction 4 with 26 rules applied. Total rules applied 217 place count 175 transition count 154
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 217 place count 175 transition count 142
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 241 place count 163 transition count 142
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 353 place count 107 transition count 86
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 373 place count 97 transition count 92
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 376 place count 97 transition count 92
Applied a total of 376 rules in 80 ms. Remains 97 /283 variables (removed 186) and now considering 92/263 (removed 171) transitions.
Finished structural reductions, in 1 iterations. Remains : 97/283 places, 92/263 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2123 ms. (steps per millisecond=471 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1175 ms. (steps per millisecond=851 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4674695 steps, run timeout after 9001 ms. (steps per millisecond=519 ) properties seen :{}
Probabilistic random walk after 4674695 steps, saw 2427337 distinct states, run finished after 9010 ms. (steps per millisecond=518 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 92 rows 97 cols
[2022-06-03 15:05:42] [INFO ] Computed 37 place invariants in 2 ms
[2022-06-03 15:05:42] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:05:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2022-06-03 15:05:42] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:05:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-03 15:05:42] [INFO ] After 28ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-06-03 15:05:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 237 ms
[2022-06-03 15:05:43] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-03 15:05:43] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 15 out of 97 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 92/92 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 97/97 places, 92/92 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 97/97 places, 92/92 transitions.
Applied a total of 0 rules in 8 ms. Remains 97 /97 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 97 cols
[2022-06-03 15:05:43] [INFO ] Computed 37 place invariants in 2 ms
[2022-06-03 15:05:43] [INFO ] Implicit Places using invariants in 61 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 96/97 places, 92/92 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 96 transition count 91
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 95 transition count 91
Applied a total of 2 rules in 6 ms. Remains 95 /96 variables (removed 1) and now considering 91/92 (removed 1) transitions.
// Phase 1: matrix 91 rows 95 cols
[2022-06-03 15:05:43] [INFO ] Computed 36 place invariants in 1 ms
[2022-06-03 15:05:43] [INFO ] Implicit Places using invariants in 49 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 94/97 places, 91/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 94/97 places, 91/92 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1170 ms. (steps per millisecond=854 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4967508 steps, run timeout after 9001 ms. (steps per millisecond=551 ) properties seen :{}
Probabilistic random walk after 4967508 steps, saw 2528429 distinct states, run finished after 9001 ms. (steps per millisecond=551 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 94 cols
[2022-06-03 15:05:55] [INFO ] Computed 35 place invariants in 2 ms
[2022-06-03 15:05:55] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:05:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2022-06-03 15:05:55] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:05:55] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 15:05:55] [INFO ] After 25ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:05:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2022-06-03 15:05:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2022-06-03 15:05:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 364 ms
[2022-06-03 15:05:56] [INFO ] After 421ms 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 15:05:56] [INFO ] After 531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 15 out of 94 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 94/94 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 91/91 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 94/94 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 94 cols
[2022-06-03 15:05:56] [INFO ] Computed 35 place invariants in 2 ms
[2022-06-03 15:05:56] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 91 rows 94 cols
[2022-06-03 15:05:56] [INFO ] Computed 35 place invariants in 0 ms
[2022-06-03 15:05:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 15:05:56] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-06-03 15:05:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 91 rows 94 cols
[2022-06-03 15:05:56] [INFO ] Computed 35 place invariants in 4 ms
[2022-06-03 15:05:56] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 91/91 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2060 ms. (steps per millisecond=485 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1179 ms. (steps per millisecond=848 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5490217 steps, run timeout after 9001 ms. (steps per millisecond=609 ) properties seen :{}
Probabilistic random walk after 5490217 steps, saw 2792734 distinct states, run finished after 9001 ms. (steps per millisecond=609 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 94 cols
[2022-06-03 15:06:08] [INFO ] Computed 35 place invariants in 2 ms
[2022-06-03 15:06:08] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:06:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2022-06-03 15:06:08] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:06:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 15:06:08] [INFO ] After 27ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 375 ms
[2022-06-03 15:06:09] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-03 15:06:09] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 15 out of 94 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 94/94 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 91/91 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 94/94 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 94 cols
[2022-06-03 15:06:09] [INFO ] Computed 35 place invariants in 1 ms
[2022-06-03 15:06:09] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 91 rows 94 cols
[2022-06-03 15:06:09] [INFO ] Computed 35 place invariants in 0 ms
[2022-06-03 15:06:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 15:06:09] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2022-06-03 15:06:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 91 rows 94 cols
[2022-06-03 15:06:09] [INFO ] Computed 35 place invariants in 2 ms
[2022-06-03 15:06:09] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 91/91 transitions.
Graph (trivial) has 14 edges and 94 vertex of which 2 / 94 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 234 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 92 transition count 89
Applied a total of 14 rules in 11 ms. Remains 92 /94 variables (removed 2) and now considering 89/91 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 92 cols
[2022-06-03 15:06:09] [INFO ] Computed 34 place invariants in 1 ms
[2022-06-03 15:06:09] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:06:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2022-06-03 15:06:09] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:06:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-03 15:06:09] [INFO ] After 13ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-06-03 15:06:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2022-06-03 15:06:10] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 5 ms to minimize.
[2022-06-03 15:06:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 198 ms
[2022-06-03 15:06:10] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-03 15:06:10] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:06:10] [INFO ] Flatten gal took : 35 ms
[2022-06-03 15:06:10] [INFO ] Flatten gal took : 12 ms
[2022-06-03 15:06:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8687500511586702537.gal : 6 ms
[2022-06-03 15:06:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3233917222810505988.prop : 0 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/ReachabilityCardinality8687500511586702537.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3233917222810505988.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...319
Loading property file /tmp/ReachabilityCardinality3233917222810505988.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 217
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :217 after 1991
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1991 after 2365
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2365 after 12221
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12221 after 81274
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :81274 after 856713
Detected timeout of ITS tools.
[2022-06-03 15:06:25] [INFO ] Flatten gal took : 9 ms
[2022-06-03 15:06:25] [INFO ] Applying decomposition
[2022-06-03 15:06:25] [INFO ] Flatten gal took : 11 ms
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/graph3648037143307807786.txt' '-o' '/tmp/graph3648037143307807786.bin' '-w' '/tmp/graph3648037143307807786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3648037143307807786.bin' '-l' '-1' '-v' '-w' '/tmp/graph3648037143307807786.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:06:25] [INFO ] Decomposing Gal with order
[2022-06-03 15:06:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:06:25] [INFO ] Removed a total of 51 redundant transitions.
[2022-06-03 15:06:25] [INFO ] Flatten gal took : 43 ms
[2022-06-03 15:06:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 8 ms.
[2022-06-03 15:06:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality989531944820190154.gal : 3 ms
[2022-06-03 15:06:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9140685744987532394.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/ReachabilityCardinality989531944820190154.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9140685744987532394.prop' '--nowitness'

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...297
Loading property file /tmp/ReachabilityCardinality9140685744987532394.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 217
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :217 after 2.11853e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.11853e+06 after 5.92972e+10
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.2874e+12,0.402143,17040,238,79,23352,642,339,69913,87,3303,0
Total reachable state count : 1287400141057

Verifying 1 reachability properties.
Invariant property ShieldIIPt-PT-004B-ReachabilityCardinality-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-004B-ReachabilityCardinality-08,0,0.41947,17304,1,0,23352,642,371,69913,95,3303,511
FORMULA ShieldIIPt-PT-004B-ReachabilityCardinality-08 TRUE TECHNIQUES OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 57867 ms.

BK_STOP 1654268785947

--------------------
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="ShieldIIPt-PT-004B"
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 ShieldIIPt-PT-004B, 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-165286024900238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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