fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897698600126
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BART-PT-060

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.280 47466.00 84171.00 338.20 FTTTFFFFFFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897698600126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 BART-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897698600126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 28M
-rw-r--r-- 1 mcc users 3.7K Apr 15 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 15 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 15 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 15 13:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.9M Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.9M Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8M Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 15 13:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 15 13:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 15 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 15 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 15 13:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 15 13:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 15M Mar 24 05:37 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 BART-PT-060-ReachabilityCardinality-00
FORMULA_NAME BART-PT-060-ReachabilityCardinality-01
FORMULA_NAME BART-PT-060-ReachabilityCardinality-02
FORMULA_NAME BART-PT-060-ReachabilityCardinality-03
FORMULA_NAME BART-PT-060-ReachabilityCardinality-04
FORMULA_NAME BART-PT-060-ReachabilityCardinality-05
FORMULA_NAME BART-PT-060-ReachabilityCardinality-06
FORMULA_NAME BART-PT-060-ReachabilityCardinality-07
FORMULA_NAME BART-PT-060-ReachabilityCardinality-08
FORMULA_NAME BART-PT-060-ReachabilityCardinality-09
FORMULA_NAME BART-PT-060-ReachabilityCardinality-10
FORMULA_NAME BART-PT-060-ReachabilityCardinality-11
FORMULA_NAME BART-PT-060-ReachabilityCardinality-12
FORMULA_NAME BART-PT-060-ReachabilityCardinality-13
FORMULA_NAME BART-PT-060-ReachabilityCardinality-14
FORMULA_NAME BART-PT-060-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589206865826

[2020-05-11 14:21:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-11 14:21:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-11 14:21:13] [INFO ] Load time of PNML (sax parser for PT used): 1993 ms
[2020-05-11 14:21:13] [INFO ] Transformed 8130 places.
[2020-05-11 14:21:14] [INFO ] Transformed 12120 transitions.
[2020-05-11 14:21:14] [INFO ] Found NUPN structural information;
[2020-05-11 14:21:14] [INFO ] Parsed PT model containing 8130 places and 12120 transitions in 2833 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 376 ms.
Working with output stream class java.io.PrintStream
FORMULA BART-PT-060-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 669 ms. (steps per millisecond=14 ) properties seen :[1, 0, 1, 0, 0, 0, 1, 0, 0, 0]
FORMULA BART-PT-060-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 12120 rows 7920 cols
[2020-05-11 14:21:16] [INFO ] Computed 60 place invariants in 982 ms
[2020-05-11 14:21:21] [INFO ] [Real]Absence check using 60 positive place invariants in 1265 ms returned sat
[2020-05-11 14:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:21:21] [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: Broken pipe (>= t2622 0)") while checking expression at index 0
[2020-05-11 14:21:24] [INFO ] [Real]Absence check using 60 positive place invariants in 1087 ms returned sat
[2020-05-11 14:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:21:26] [INFO ] [Real]Absence check using state equation in 1975 ms returned (error "Solver has unexpectedly terminated")
[2020-05-11 14:21:29] [INFO ] [Real]Absence check using 60 positive place invariants in 1157 ms returned sat
[2020-05-11 14:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:21:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-11 14:21:31] [INFO ] [Real]Absence check using state equation in 2030 ms returned (error "Failed to check-sat")
[2020-05-11 14:21:34] [INFO ] [Real]Absence check using 60 positive place invariants in 1098 ms returned sat
[2020-05-11 14:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:21:36] [INFO ] [Real]Absence check using state equation in 2229 ms returned (error "Failed to check-sat")
[2020-05-11 14:21:39] [INFO ] [Real]Absence check using 60 positive place invariants in 1130 ms returned sat
[2020-05-11 14:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:21:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-11 14:21:41] [INFO ] [Real]Absence check using state equation in 2140 ms returned (error "Failed to check-sat")
[2020-05-11 14:21:44] [INFO ] [Real]Absence check using 60 positive place invariants in 1232 ms returned sat
[2020-05-11 14:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:21:47] [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: Broken pipe (= s7 (- (+ 1 t7) (+ t67 t127 t187 t247 t307 t367 t427 t487 t547 t607 t667 t727 t787 t847 t907 t967 t1027 t1087 t1147 t1207 t1267 t1327 t1387 t1447 t1507 t1567 t1627 t1687 t1747 t1807 t1867 t1927 t1987 t2047 t2107 t2167)))") while checking expression at index 5
[2020-05-11 14:21:49] [INFO ] [Real]Absence check using 60 positive place invariants in 876 ms returned sat
[2020-05-11 14:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-11 14:21:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-11 14:21:52] [INFO ] [Real]Absence check using state equation in 2384 ms returned (error "Failed to check-sat")
Support contains 31 out of 7920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Graph (trivial) has 12039 edges and 7920 vertex of which 7666 / 7920 are part of one of the 59 SCC in 124 ms
Free SCC test removed 7607 places
Discarding 36 places :
Also discarding 7272 output transitions
Drop transitions removed 7272 transitions
Graph (complete) has 378 edges and 313 vertex of which 277 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.99 ms
Drop transitions removed 4464 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 4470 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 4598 rules applied. Total rules applied 4600 place count 277 transition count 250
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 142 rules applied. Total rules applied 4742 place count 149 transition count 236
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 4749 place count 146 transition count 232
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 4752 place count 145 transition count 230
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 4755 place count 144 transition count 228
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 4758 place count 143 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4760 place count 142 transition count 225
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 4760 place count 142 transition count 217
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 4776 place count 134 transition count 217
Symmetric choice reduction at 7 with 11 rule applications. Total rules 4787 place count 134 transition count 217
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 4809 place count 123 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 4815 place count 123 transition count 200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 4815 place count 123 transition count 198
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4819 place count 121 transition count 198
Symmetric choice reduction at 8 with 4 rule applications. Total rules 4823 place count 121 transition count 198
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 4831 place count 117 transition count 194
Symmetric choice reduction at 8 with 3 rule applications. Total rules 4834 place count 117 transition count 194
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 4840 place count 114 transition count 191
Symmetric choice reduction at 8 with 3 rule applications. Total rules 4843 place count 114 transition count 191
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 4849 place count 111 transition count 188
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4851 place count 111 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4855 place count 109 transition count 186
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4857 place count 109 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4861 place count 107 transition count 184
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4862 place count 107 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4864 place count 106 transition count 183
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 4878 place count 99 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4882 place count 99 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 4886 place count 97 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 4890 place count 97 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 4894 place count 95 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 4898 place count 95 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 4902 place count 93 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 4906 place count 93 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 4910 place count 91 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 4914 place count 91 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 4918 place count 89 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 4922 place count 89 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 4926 place count 87 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 4930 place count 87 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 4934 place count 85 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 4938 place count 85 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 4942 place count 83 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 4946 place count 83 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 4950 place count 81 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 4954 place count 81 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 4958 place count 79 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 4962 place count 79 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 4966 place count 77 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 4970 place count 77 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 4974 place count 75 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 4978 place count 75 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 4982 place count 73 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 4986 place count 73 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 4990 place count 71 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 4994 place count 71 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 4998 place count 69 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 5002 place count 69 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 5006 place count 67 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 24 with 5 rules applied. Total rules applied 5011 place count 67 transition count 75
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 5013 place count 66 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 5013 place count 66 transition count 73
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 5015 place count 65 transition count 73
Free-agglomeration rule applied 10 times.
Iterating global reduction 26 with 10 rules applied. Total rules applied 5025 place count 65 transition count 63
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 5036 place count 55 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 5037 place count 55 transition count 61
Applied a total of 5037 rules in 637 ms. Remains 55 /7920 variables (removed 7865) and now considering 61/12120 (removed 12059) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/7920 places, 61/12120 transitions.
Finished random walk after 119 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=59 )
FORMULA BART-PT-060-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-060-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589206913292

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BART-PT-060"
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"

# 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 BART-PT-060, 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 r021-oct2-158897698600126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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