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-165286025000287.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-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.7K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 18:27 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.7K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 29 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 29 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 18:29 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 338K 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-020B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654268833773

Running Version 202205111006
[2022-06-03 15:07:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 15:07:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:07:15] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2022-06-03 15:07:15] [INFO ] Transformed 1403 places.
[2022-06-03 15:07:15] [INFO ] Transformed 1303 transitions.
[2022-06-03 15:07:15] [INFO ] Found NUPN structural information;
[2022-06-03 15:07:15] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 268 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-02 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2022-06-03 15:07:16] [INFO ] Computed 181 place invariants in 31 ms
[2022-06-03 15:07:16] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 15:07:17] [INFO ] [Nat]Absence check using 181 positive place invariants in 60 ms returned sat
[2022-06-03 15:07:19] [INFO ] After 1922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 15:07:19] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 5 ms to minimize.
[2022-06-03 15:07:20] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 2 ms to minimize.
[2022-06-03 15:07:20] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 1 ms to minimize.
[2022-06-03 15:07:20] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 1 ms to minimize.
[2022-06-03 15:07:21] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 1 ms to minimize.
[2022-06-03 15:07:21] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 1 ms to minimize.
[2022-06-03 15:07:21] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2022-06-03 15:07:22] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2022-06-03 15:07:22] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2022-06-03 15:07:22] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 1 ms to minimize.
[2022-06-03 15:07:22] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 0 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 1 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 0 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 0 ms to minimize.
[2022-06-03 15:07:23] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 0 ms to minimize.
[2022-06-03 15:07:24] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 1 ms to minimize.
[2022-06-03 15:07:24] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 1 ms to minimize.
[2022-06-03 15:07:24] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 0 ms to minimize.
[2022-06-03 15:07:24] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2022-06-03 15:07:25] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 0 ms to minimize.
[2022-06-03 15:07:25] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2022-06-03 15:07:26] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 1 ms to minimize.
[2022-06-03 15:07:26] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 1 ms to minimize.
[2022-06-03 15:07:26] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 1 ms to minimize.
[2022-06-03 15:07:27] [INFO ] Deduced a trap composed of 46 places in 276 ms of which 1 ms to minimize.
[2022-06-03 15:07:27] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 1 ms to minimize.
[2022-06-03 15:07:27] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 0 ms to minimize.
[2022-06-03 15:07:28] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 4 ms to minimize.
[2022-06-03 15:07:28] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 1 ms to minimize.
[2022-06-03 15:07:28] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 1 ms to minimize.
[2022-06-03 15:07:29] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2022-06-03 15:07:29] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2022-06-03 15:07:29] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 1 ms to minimize.
[2022-06-03 15:07:30] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 1 ms to minimize.
[2022-06-03 15:07:30] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 1 ms to minimize.
[2022-06-03 15:07:30] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 1 ms to minimize.
[2022-06-03 15:07:30] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 1 ms to minimize.
[2022-06-03 15:07:31] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 1 ms to minimize.
[2022-06-03 15:07:31] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 1 ms to minimize.
[2022-06-03 15:07:31] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2022-06-03 15:07:32] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2022-06-03 15:07:32] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 1 ms to minimize.
[2022-06-03 15:07:32] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 0 ms to minimize.
[2022-06-03 15:07:32] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2022-06-03 15:07:33] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 1 ms to minimize.
[2022-06-03 15:07:33] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 0 ms to minimize.
[2022-06-03 15:07:33] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 1 ms to minimize.
[2022-06-03 15:07:33] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2022-06-03 15:07:34] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 1 ms to minimize.
[2022-06-03 15:07:34] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2022-06-03 15:07:34] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 0 ms to minimize.
[2022-06-03 15:07:34] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2022-06-03 15:07:35] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 1 ms to minimize.
[2022-06-03 15:07:35] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2022-06-03 15:07:35] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2022-06-03 15:07:35] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2022-06-03 15:07:35] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 4 ms to minimize.
[2022-06-03 15:07:36] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2022-06-03 15:07:36] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 16603 ms
[2022-06-03 15:07:36] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 0 ms to minimize.
[2022-06-03 15:07:36] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 1 ms to minimize.
[2022-06-03 15:07:36] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 1 ms to minimize.
[2022-06-03 15:07:37] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 1 ms to minimize.
[2022-06-03 15:07:37] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 1 ms to minimize.
[2022-06-03 15:07:37] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 0 ms to minimize.
[2022-06-03 15:07:38] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 1 ms to minimize.
[2022-06-03 15:07:38] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 2 ms to minimize.
[2022-06-03 15:07:38] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 2 ms to minimize.
[2022-06-03 15:07:39] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 3 ms to minimize.
[2022-06-03 15:07:39] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 0 ms to minimize.
[2022-06-03 15:07:39] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 1 ms to minimize.
[2022-06-03 15:07:39] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 1 ms to minimize.
[2022-06-03 15:07:40] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 1 ms to minimize.
[2022-06-03 15:07:40] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 0 ms to minimize.
[2022-06-03 15:07:40] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2022-06-03 15:07:40] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 1 ms to minimize.
[2022-06-03 15:07:41] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 1 ms to minimize.
[2022-06-03 15:07:41] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2022-06-03 15:07:41] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 0 ms to minimize.
[2022-06-03 15:07:42] [INFO ] Deduced a trap composed of 14 places in 453 ms of which 1 ms to minimize.
[2022-06-03 15:07:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:07:42] [INFO ] After 25467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 9362 ms.
Support contains 97 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 267 place count 1403 transition count 1036
Reduce places removed 267 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 269 rules applied. Total rules applied 536 place count 1136 transition count 1034
Reduce places removed 1 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 35 rules applied. Total rules applied 571 place count 1135 transition count 1000
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 605 place count 1101 transition count 1000
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 605 place count 1101 transition count 917
Deduced a syphon composed of 83 places in 2 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 771 place count 1018 transition count 917
Discarding 126 places :
Symmetric choice reduction at 4 with 126 rule applications. Total rules 897 place count 892 transition count 791
Iterating global reduction 4 with 126 rules applied. Total rules applied 1023 place count 892 transition count 791
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1023 place count 892 transition count 753
Deduced a syphon composed of 38 places in 8 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1099 place count 854 transition count 753
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 2 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 4 with 592 rules applied. Total rules applied 1691 place count 558 transition count 457
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1773 place count 517 transition count 474
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1774 place count 517 transition count 473
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1776 place count 517 transition count 471
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1778 place count 515 transition count 471
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 1799 place count 515 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1800 place count 514 transition count 470
Applied a total of 1800 rules in 508 ms. Remains 514 /1403 variables (removed 889) and now considering 470/1303 (removed 833) transitions.
Finished structural reductions, in 1 iterations. Remains : 514/1403 places, 470/1303 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10468 ms. (steps per millisecond=95 ) properties (out of 6) seen :4
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2816 ms. (steps per millisecond=355 ) properties (out of 2) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2451 ms. (steps per millisecond=407 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 470 rows 514 cols
[2022-06-03 15:08:07] [INFO ] Computed 181 place invariants in 8 ms
[2022-06-03 15:08:07] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:08:07] [INFO ] [Nat]Absence check using 181 positive place invariants in 28 ms returned sat
[2022-06-03 15:08:08] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:08] [INFO ] State equation strengthened by 94 read => feed constraints.
[2022-06-03 15:08:08] [INFO ] After 78ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:08] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-06-03 15:08:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-06-03 15:08:08] [INFO ] After 220ms 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 15:08:08] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 91 ms.
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 514/514 places, 470/470 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 514 transition count 458
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 502 transition count 458
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 24 place count 502 transition count 429
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 82 place count 473 transition count 429
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 472 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 472 transition count 428
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 206 place count 411 transition count 367
Renaming transitions due to excessive name length > 1024 char.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 240 place count 394 transition count 381
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 243 place count 394 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 246 place count 391 transition count 378
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 391 transition count 378
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 251 place count 388 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 253 place count 386 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 253 place count 386 transition count 374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 255 place count 385 transition count 374
Applied a total of 255 rules in 156 ms. Remains 385 /514 variables (removed 129) and now considering 374/470 (removed 96) transitions.
Finished structural reductions, in 1 iterations. Remains : 385/514 places, 374/470 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4232 ms. (steps per millisecond=236 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2398 ms. (steps per millisecond=417 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3315512 steps, run timeout after 18001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 3315512 steps, saw 2492793 distinct states, run finished after 18003 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 385 cols
[2022-06-03 15:08:33] [INFO ] Computed 179 place invariants in 12 ms
[2022-06-03 15:08:33] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:08:33] [INFO ] [Nat]Absence check using 179 positive place invariants in 19 ms returned sat
[2022-06-03 15:08:33] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 15:08:33] [INFO ] After 23ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:33] [INFO ] After 53ms 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:08:33] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 6 out of 385 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 385/385 places, 374/374 transitions.
Applied a total of 0 rules in 9 ms. Remains 385 /385 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 385/385 places, 374/374 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 385/385 places, 374/374 transitions.
Applied a total of 0 rules in 9 ms. Remains 385 /385 variables (removed 0) and now considering 374/374 (removed 0) transitions.
// Phase 1: matrix 374 rows 385 cols
[2022-06-03 15:08:33] [INFO ] Computed 179 place invariants in 5 ms
[2022-06-03 15:08:33] [INFO ] Implicit Places using invariants in 205 ms returned [374]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 207 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 384/385 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 383 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 383 transition count 373
Applied a total of 2 rules in 13 ms. Remains 383 /384 variables (removed 1) and now considering 373/374 (removed 1) transitions.
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:08:33] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:08:34] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:08:34] [INFO ] Computed 178 place invariants in 4 ms
[2022-06-03 15:08:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-03 15:08:34] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 383/385 places, 373/374 transitions.
Finished structural reductions, in 2 iterations. Remains : 383/385 places, 373/374 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4261 ms. (steps per millisecond=234 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2387 ms. (steps per millisecond=418 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3495942 steps, run timeout after 18001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 3495942 steps, saw 2646894 distinct states, run finished after 18002 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:08:59] [INFO ] Computed 178 place invariants in 3 ms
[2022-06-03 15:08:59] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:08:59] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-06-03 15:08:59] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-03 15:08:59] [INFO ] After 27ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:08:59] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-03 15:08:59] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 76 ms.
Support contains 6 out of 383 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 383/383 places, 373/373 transitions.
Applied a total of 0 rules in 8 ms. Remains 383 /383 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 383/383 places, 373/373 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 383/383 places, 373/373 transitions.
Applied a total of 0 rules in 7 ms. Remains 383 /383 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:08:59] [INFO ] Computed 178 place invariants in 3 ms
[2022-06-03 15:08:59] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:08:59] [INFO ] Computed 178 place invariants in 1 ms
[2022-06-03 15:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-03 15:09:00] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2022-06-03 15:09:00] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:09:00] [INFO ] Computed 178 place invariants in 3 ms
[2022-06-03 15:09:00] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 383/383 places, 373/373 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4219 ms. (steps per millisecond=237 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2375 ms. (steps per millisecond=421 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3499198 steps, run timeout after 18001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 3499198 steps, saw 2649428 distinct states, run finished after 18001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:09:24] [INFO ] Computed 178 place invariants in 1 ms
[2022-06-03 15:09:24] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:09:25] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-06-03 15:09:25] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-03 15:09:25] [INFO ] After 16ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:25] [INFO ] After 43ms 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:09:25] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 98 ms.
Support contains 6 out of 383 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 383/383 places, 373/373 transitions.
Applied a total of 0 rules in 27 ms. Remains 383 /383 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 383/383 places, 373/373 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 383/383 places, 373/373 transitions.
Applied a total of 0 rules in 8 ms. Remains 383 /383 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:09:25] [INFO ] Computed 178 place invariants in 1 ms
[2022-06-03 15:09:25] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:09:25] [INFO ] Computed 178 place invariants in 1 ms
[2022-06-03 15:09:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-03 15:09:25] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2022-06-03 15:09:25] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:09:25] [INFO ] Computed 178 place invariants in 1 ms
[2022-06-03 15:09:26] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 383/383 places, 373/373 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 383 transition count 373
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 383 transition count 372
Applied a total of 40 rules in 20 ms. Remains 383 /383 variables (removed 0) and now considering 372/373 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 372 rows 383 cols
[2022-06-03 15:09:26] [INFO ] Computed 178 place invariants in 1 ms
[2022-06-03 15:09:26] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:09:26] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-06-03 15:09:26] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-03 15:09:26] [INFO ] After 47ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:26] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-03 15:09:26] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 15:09:26] [INFO ] Flatten gal took : 90 ms
[2022-06-03 15:09:26] [INFO ] Flatten gal took : 31 ms
[2022-06-03 15:09:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10048740323975202882.gal : 21 ms
[2022-06-03 15:09:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14743878953888129599.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/ReachabilityCardinality10048740323975202882.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14743878953888129599.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...321
Loading property file /tmp/ReachabilityCardinality14743878953888129599.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 66
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :66 after 181
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :181 after 240
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :240 after 488
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :488 after 5037
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5037 after 66004
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :66004 after 7.63794e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.63794e+06 after 1.33853e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.33853e+08 after 3.6439e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.6439e+10 after 3.3045e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.3045e+15 after 1.45803e+19
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.45803e+19 after 3.67574e+27
Detected timeout of ITS tools.
[2022-06-03 15:09:41] [INFO ] Flatten gal took : 26 ms
[2022-06-03 15:09:41] [INFO ] Applying decomposition
[2022-06-03 15:09:41] [INFO ] Flatten gal took : 26 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/graph8754131131880177205.txt' '-o' '/tmp/graph8754131131880177205.bin' '-w' '/tmp/graph8754131131880177205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8754131131880177205.bin' '-l' '-1' '-v' '-w' '/tmp/graph8754131131880177205.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:09:42] [INFO ] Decomposing Gal with order
[2022-06-03 15:09:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:09:42] [INFO ] Removed a total of 205 redundant transitions.
[2022-06-03 15:09:42] [INFO ] Flatten gal took : 137 ms
[2022-06-03 15:09:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 15 ms.
[2022-06-03 15:09:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8573478194479679962.gal : 15 ms
[2022-06-03 15:09:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2299260384017541557.prop : 9 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/ReachabilityCardinality8573478194479679962.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2299260384017541557.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...298
Loading property file /tmp/ReachabilityCardinality2299260384017541557.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :184320 after 1.21651e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.21651e+06 after 5.42628e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.42628e+14 after 1.77712e+32
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15459484137075990416
[2022-06-03 15:09:57] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15459484137075990416
Running compilation step : cd /tmp/ltsmin15459484137075990416;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 710 ms.
Running link step : cd /tmp/ltsmin15459484137075990416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15459484137075990416;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPtPT020BReachabilityFireability08==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 15:10:12] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1549514275471514184
[2022-06-03 15:10:12] [INFO ] Computing symmetric may disable matrix : 373 transitions.
[2022-06-03 15:10:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:10:12] [INFO ] Computing symmetric may enable matrix : 373 transitions.
[2022-06-03 15:10:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:10:12] [INFO ] Applying decomposition
[2022-06-03 15:10:12] [INFO ] Flatten gal took : 46 ms
[2022-06-03 15:10:12] [INFO ] Computing Do-Not-Accords matrix : 373 transitions.
[2022-06-03 15:10:12] [INFO ] Flatten gal took : 47 ms
[2022-06-03 15:10:12] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 15:10:12] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1549514275471514184
Running compilation step : cd /tmp/ltsmin1549514275471514184;'/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'
[2022-06-03 15:10:12] [INFO ] Input system was already deterministic with 373 transitions.
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/graph9360961780584636390.txt' '-o' '/tmp/graph9360961780584636390.bin' '-w' '/tmp/graph9360961780584636390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9360961780584636390.bin' '-l' '-1' '-v' '-w' '/tmp/graph9360961780584636390.weights' '-q' '0' '-e' '0.001'
[2022-06-03 15:10:12] [INFO ] Decomposing Gal with order
[2022-06-03 15:10:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 15:10:12] [INFO ] Removed a total of 357 redundant transitions.
[2022-06-03 15:10:12] [INFO ] Flatten gal took : 54 ms
[2022-06-03 15:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 8 ms.
[2022-06-03 15:10:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8084354734367010104.gal : 5 ms
[2022-06-03 15:10:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16304885232538229464.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/ReachabilityFireability8084354734367010104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16304885232538229464.prop' '--nowitness'

[2022-06-03 15:10:12] [INFO ] Ran tautology test, simplified 0 / 1 in 269 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...299
Loading property file /tmp/ReachabilityFireability16304885232538229464.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 2
[2022-06-03 15:10:12] [INFO ] BMC solution for property ShieldIIPt-PT-020B-ReachabilityFireability-08(UNSAT) depth K=0 took 18 ms
[2022-06-03 15:10:12] [INFO ] BMC solution for property ShieldIIPt-PT-020B-ReachabilityFireability-08(UNSAT) depth K=1 took 9 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :208896 after 4.77404e+09
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 373 rows 383 cols
[2022-06-03 15:10:13] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:10:13] [INFO ] Computed 178 place invariants in 2 ms
[2022-06-03 15:10:13] [INFO ] BMC solution for property ShieldIIPt-PT-020B-ReachabilityFireability-08(UNSAT) depth K=2 took 229 ms
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-08 does not hold.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-08 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 33 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,4.37845e+29,0.27873,12656,734,79,15381,297,577,45068,84,1694,0
Total reachable state count : 437845118809113278297617203200

Verifying 1 reachability properties.
Invariant property ShieldIIPt-PT-020B-ReachabilityFireability-08 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
ShieldIIPt-PT-020B-ReachabilityFireability-08,1.21524e+27,0.28187,12920,659,75,15381,297,611,45068,94,1694,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 15:10:13] [WARNING] Interrupting SMT solver.
[2022-06-03 15:10:13] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Exception in thread "Thread-12" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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)
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)
[2022-06-03 15:10:13] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldIIPt-PT-020B-ReachabilityFireability-08 SMT depth 3
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 15:10:13] [INFO ] During BMC, SMT solver timed out at depth 3
[2022-06-03 15:10:13] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2022-06-03 15:10:13] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 178429 ms.

BK_STOP 1654269013387

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025000287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;