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-165286025500639.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 ShieldPPPt-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-165286025500639
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:36 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.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 29 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 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 376K 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 ShieldPPPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654275199832

Running Version 202205111006
[2022-06-03 16:53:21] [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 16:53:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:53:21] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2022-06-03 16:53:21] [INFO ] Transformed 1563 places.
[2022-06-03 16:53:21] [INFO ] Transformed 1423 transitions.
[2022-06-03 16:53:21] [INFO ] Found NUPN structural information;
[2022-06-03 16:53:21] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 301 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2022-06-03 16:53:22] [INFO ] Computed 221 place invariants in 30 ms
[2022-06-03 16:53:23] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-03 16:53:24] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2022-06-03 16:53:26] [INFO ] After 2204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-06-03 16:53:27] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 7 ms to minimize.
[2022-06-03 16:53:27] [INFO ] Deduced a trap composed of 24 places in 371 ms of which 1 ms to minimize.
[2022-06-03 16:53:27] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 1 ms to minimize.
[2022-06-03 16:53:28] [INFO ] Deduced a trap composed of 18 places in 315 ms of which 1 ms to minimize.
[2022-06-03 16:53:28] [INFO ] Deduced a trap composed of 19 places in 377 ms of which 1 ms to minimize.
[2022-06-03 16:53:29] [INFO ] Deduced a trap composed of 30 places in 308 ms of which 1 ms to minimize.
[2022-06-03 16:53:29] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 1 ms to minimize.
[2022-06-03 16:53:29] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 1 ms to minimize.
[2022-06-03 16:53:30] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 1 ms to minimize.
[2022-06-03 16:53:30] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 1 ms to minimize.
[2022-06-03 16:53:30] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 1 ms to minimize.
[2022-06-03 16:53:31] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 0 ms to minimize.
[2022-06-03 16:53:31] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2022-06-03 16:53:31] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 1 ms to minimize.
[2022-06-03 16:53:32] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 1 ms to minimize.
[2022-06-03 16:53:32] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 1 ms to minimize.
[2022-06-03 16:53:32] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 0 ms to minimize.
[2022-06-03 16:53:33] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 9 ms to minimize.
[2022-06-03 16:53:33] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 1 ms to minimize.
[2022-06-03 16:53:33] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 1 ms to minimize.
[2022-06-03 16:53:33] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2022-06-03 16:53:34] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 1 ms to minimize.
[2022-06-03 16:53:34] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 1 ms to minimize.
[2022-06-03 16:53:34] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2022-06-03 16:53:34] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 1 ms to minimize.
[2022-06-03 16:53:35] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2022-06-03 16:53:35] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 0 ms to minimize.
[2022-06-03 16:53:35] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2022-06-03 16:53:35] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 1 ms to minimize.
[2022-06-03 16:53:36] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 0 ms to minimize.
[2022-06-03 16:53:36] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 1 ms to minimize.
[2022-06-03 16:53:36] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 0 ms to minimize.
[2022-06-03 16:53:36] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 10020 ms
[2022-06-03 16:53:36] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 0 ms to minimize.
[2022-06-03 16:53:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2022-06-03 16:53:37] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 4 ms to minimize.
[2022-06-03 16:53:37] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 0 ms to minimize.
[2022-06-03 16:53:38] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 1 ms to minimize.
[2022-06-03 16:53:38] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 1 ms to minimize.
[2022-06-03 16:53:38] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 1 ms to minimize.
[2022-06-03 16:53:39] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 1 ms to minimize.
[2022-06-03 16:53:39] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 1 ms to minimize.
[2022-06-03 16:53:39] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 0 ms to minimize.
[2022-06-03 16:53:40] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 1 ms to minimize.
[2022-06-03 16:53:40] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2022-06-03 16:53:40] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 0 ms to minimize.
[2022-06-03 16:53:40] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 1 ms to minimize.
[2022-06-03 16:53:41] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 1 ms to minimize.
[2022-06-03 16:53:41] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 1 ms to minimize.
[2022-06-03 16:53:41] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 0 ms to minimize.
[2022-06-03 16:53:42] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2022-06-03 16:53:42] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2022-06-03 16:53:42] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 1 ms to minimize.
[2022-06-03 16:53:42] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 0 ms to minimize.
[2022-06-03 16:53:43] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 1 ms to minimize.
[2022-06-03 16:53:43] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 0 ms to minimize.
[2022-06-03 16:53:43] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 0 ms to minimize.
[2022-06-03 16:53:43] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 5 ms to minimize.
[2022-06-03 16:53:43] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2022-06-03 16:53:44] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 0 ms to minimize.
[2022-06-03 16:53:44] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 0 ms to minimize.
[2022-06-03 16:53:44] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 1 ms to minimize.
[2022-06-03 16:53:44] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2022-06-03 16:53:44] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2022-06-03 16:53:45] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 0 ms to minimize.
[2022-06-03 16:53:45] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2022-06-03 16:53:45] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 0 ms to minimize.
[2022-06-03 16:53:45] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2022-06-03 16:53:45] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2022-06-03 16:53:46] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2022-06-03 16:53:46] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2022-06-03 16:53:46] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2022-06-03 16:53:46] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 9283 ms
[2022-06-03 16:53:46] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 1 ms to minimize.
[2022-06-03 16:53:47] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2022-06-03 16:53:47] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 0 ms to minimize.
[2022-06-03 16:53:47] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2022-06-03 16:53:47] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 1 ms to minimize.
[2022-06-03 16:53:48] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2022-06-03 16:53:48] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 0 ms to minimize.
[2022-06-03 16:53:48] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2022-06-03 16:53:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 16:53:48] [INFO ] After 25070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 25875 ms.
Support contains 125 out of 1563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1563 transition count 1148
Reduce places removed 275 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 277 rules applied. Total rules applied 552 place count 1288 transition count 1146
Reduce places removed 1 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 40 rules applied. Total rules applied 592 place count 1287 transition count 1107
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 631 place count 1248 transition count 1107
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 631 place count 1248 transition count 1010
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 825 place count 1151 transition count 1010
Discarding 125 places :
Symmetric choice reduction at 4 with 125 rule applications. Total rules 950 place count 1026 transition count 885
Iterating global reduction 4 with 125 rules applied. Total rules applied 1075 place count 1026 transition count 885
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1075 place count 1026 transition count 847
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1151 place count 988 transition count 847
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 2 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 4 with 560 rules applied. Total rules applied 1711 place count 708 transition count 567
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1789 place count 669 transition count 567
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1794 place count 669 transition count 562
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1799 place count 664 transition count 562
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 5 with 46 rules applied. Total rules applied 1845 place count 664 transition count 562
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1846 place count 663 transition count 561
Applied a total of 1846 rules in 603 ms. Remains 663 /1563 variables (removed 900) and now considering 561/1423 (removed 862) transitions.
Finished structural reductions, in 1 iterations. Remains : 663/1563 places, 561/1423 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16376 ms. (steps per millisecond=61 ) properties (out of 11) seen :8
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4171 ms. (steps per millisecond=239 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4140 ms. (steps per millisecond=241 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 994910 steps, including 7 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen 0
Running SMT prover for 3 properties.
// Phase 1: matrix 561 rows 663 cols
[2022-06-03 16:54:44] [INFO ] Computed 221 place invariants in 3 ms
[2022-06-03 16:54:44] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 16:54:44] [INFO ] [Nat]Absence check using 221 positive place invariants in 39 ms returned sat
[2022-06-03 16:54:45] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 16:54:45] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-03 16:54:46] [INFO ] After 587ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-03 16:54:46] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2022-06-03 16:54:46] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2022-06-03 16:54:46] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-06-03 16:54:46] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2022-06-03 16:54:46] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-06-03 16:54:46] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-06-03 16:54:46] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-06-03 16:54:47] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-06-03 16:54:47] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-06-03 16:54:47] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-06-03 16:54:47] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2022-06-03 16:54:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1193 ms
[2022-06-03 16:54:47] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2022-06-03 16:54:47] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2022-06-03 16:54:47] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2022-06-03 16:54:47] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2022-06-03 16:54:48] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2022-06-03 16:54:48] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2022-06-03 16:54:48] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2022-06-03 16:54:48] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-06-03 16:54:48] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2022-06-03 16:54:48] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2022-06-03 16:54:48] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2022-06-03 16:54:48] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2022-06-03 16:54:49] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-06-03 16:54:49] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-06-03 16:54:49] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-06-03 16:54:49] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2022-06-03 16:54:49] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2022-06-03 16:54:49] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2119 ms
[2022-06-03 16:54:49] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2022-06-03 16:54:50] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2022-06-03 16:54:50] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2022-06-03 16:54:50] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2022-06-03 16:54:50] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2022-06-03 16:54:50] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-06-03 16:54:50] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2022-06-03 16:54:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 821 ms
[2022-06-03 16:54:50] [INFO ] After 5260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 469 ms.
[2022-06-03 16:54:51] [INFO ] After 6374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1583 ms.
Support contains 76 out of 663 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 663/663 places, 561/561 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 663 transition count 550
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 24 place count 652 transition count 548
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 650 transition count 548
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 26 place count 650 transition count 535
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 52 place count 637 transition count 535
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 636 transition count 534
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 636 transition count 534
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 114 place count 606 transition count 504
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 601 transition count 504
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 601 transition count 504
Applied a total of 126 rules in 162 ms. Remains 601 /663 variables (removed 62) and now considering 504/561 (removed 57) transitions.
Finished structural reductions, in 1 iterations. Remains : 601/663 places, 504/561 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8971 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3682 ms. (steps per millisecond=271 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 4297 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4462849 steps, run timeout after 48001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 4462849 steps, saw 2877806 distinct states, run finished after 48003 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 504 rows 601 cols
[2022-06-03 16:55:57] [INFO ] Computed 221 place invariants in 16 ms
[2022-06-03 16:55:58] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:55:58] [INFO ] [Nat]Absence check using 221 positive place invariants in 34 ms returned sat
[2022-06-03 16:55:58] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:55:58] [INFO ] State equation strengthened by 97 read => feed constraints.
[2022-06-03 16:55:59] [INFO ] After 513ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1741 ms
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2022-06-03 16:56:02] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-06-03 16:56:02] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2022-06-03 16:56:02] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2022-06-03 16:56:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1058 ms
[2022-06-03 16:56:02] [INFO ] After 3709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 474 ms.
[2022-06-03 16:56:02] [INFO ] After 4743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 741 ms.
Support contains 76 out of 601 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 601/601 places, 504/504 transitions.
Applied a total of 0 rules in 16 ms. Remains 601 /601 variables (removed 0) and now considering 504/504 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 504/504 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 601/601 places, 504/504 transitions.
Applied a total of 0 rules in 15 ms. Remains 601 /601 variables (removed 0) and now considering 504/504 (removed 0) transitions.
// Phase 1: matrix 504 rows 601 cols
[2022-06-03 16:56:03] [INFO ] Computed 221 place invariants in 2 ms
[2022-06-03 16:56:03] [INFO ] Implicit Places using invariants in 331 ms returned [593]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 349 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 600/601 places, 504/504 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 600 transition count 502
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 598 transition count 502
Applied a total of 4 rules in 37 ms. Remains 598 /600 variables (removed 2) and now considering 502/504 (removed 2) transitions.
// Phase 1: matrix 502 rows 598 cols
[2022-06-03 16:56:03] [INFO ] Computed 220 place invariants in 2 ms
[2022-06-03 16:56:04] [INFO ] Implicit Places using invariants in 284 ms returned [579, 583]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 285 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 596/601 places, 502/504 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 594 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 594 transition count 500
Applied a total of 4 rules in 24 ms. Remains 594 /596 variables (removed 2) and now considering 500/502 (removed 2) transitions.
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:56:04] [INFO ] Computed 218 place invariants in 2 ms
[2022-06-03 16:56:04] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:56:04] [INFO ] Computed 218 place invariants in 4 ms
[2022-06-03 16:56:04] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-03 16:56:05] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 594/601 places, 500/504 transitions.
Finished structural reductions, in 3 iterations. Remains : 594/601 places, 500/504 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9147 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3662 ms. (steps per millisecond=273 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7 resets, run finished after 4630 ms. (steps per millisecond=215 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5043363 steps, run timeout after 51001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 5043363 steps, saw 3381578 distinct states, run finished after 51001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:57:13] [INFO ] Computed 218 place invariants in 4 ms
[2022-06-03 16:57:13] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:57:14] [INFO ] [Nat]Absence check using 218 positive place invariants in 32 ms returned sat
[2022-06-03 16:57:14] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:57:14] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-03 16:57:15] [INFO ] After 534ms SMT Verify possible using 95 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:57:15] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2022-06-03 16:57:15] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2022-06-03 16:57:15] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2022-06-03 16:57:15] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2022-06-03 16:57:15] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2022-06-03 16:57:15] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-06-03 16:57:15] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-03 16:57:15] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1918 ms
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2022-06-03 16:57:18] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2022-06-03 16:57:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 786 ms
[2022-06-03 16:57:18] [INFO ] After 3556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 482 ms.
[2022-06-03 16:57:18] [INFO ] After 4554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1007 ms.
Support contains 76 out of 594 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 594/594 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 594 /594 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 594/594 places, 500/500 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 594/594 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 594 /594 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:57:19] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-03 16:57:19] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:57:19] [INFO ] Computed 218 place invariants in 3 ms
[2022-06-03 16:57:20] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-03 16:57:20] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2022-06-03 16:57:20] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:57:20] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-03 16:57:21] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 594/594 places, 500/500 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9370 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3617 ms. (steps per millisecond=276 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 4280 ms. (steps per millisecond=233 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5186483 steps, run timeout after 51001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 5186483 steps, saw 3476777 distinct states, run finished after 51001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:58:29] [INFO ] Computed 218 place invariants in 3 ms
[2022-06-03 16:58:29] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:58:29] [INFO ] [Nat]Absence check using 218 positive place invariants in 32 ms returned sat
[2022-06-03 16:58:30] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:58:30] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-03 16:58:30] [INFO ] After 529ms SMT Verify possible using 95 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:58:30] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2022-06-03 16:58:30] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-06-03 16:58:31] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-06-03 16:58:32] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2022-06-03 16:58:32] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-06-03 16:58:32] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2022-06-03 16:58:32] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2022-06-03 16:58:32] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-06-03 16:58:32] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-06-03 16:58:32] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1911 ms
[2022-06-03 16:58:32] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2022-06-03 16:58:33] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2022-06-03 16:58:33] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-06-03 16:58:33] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-06-03 16:58:33] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-06-03 16:58:33] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2022-06-03 16:58:33] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-06-03 16:58:33] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-06-03 16:58:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 745 ms
[2022-06-03 16:58:33] [INFO ] After 3514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 487 ms.
[2022-06-03 16:58:34] [INFO ] After 4569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 996 ms.
Support contains 76 out of 594 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 594/594 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 594 /594 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 594/594 places, 500/500 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 594/594 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 594 /594 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:58:35] [INFO ] Computed 218 place invariants in 3 ms
[2022-06-03 16:58:35] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:58:35] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-03 16:58:35] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-03 16:58:36] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2022-06-03 16:58:36] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:58:36] [INFO ] Computed 218 place invariants in 3 ms
[2022-06-03 16:58:36] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 594/594 places, 500/500 transitions.
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 0 with 87 rules applied. Total rules applied 87 place count 594 transition count 500
Applied a total of 87 rules in 27 ms. Remains 594 /594 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:58:36] [INFO ] Computed 218 place invariants in 2 ms
[2022-06-03 16:58:36] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:58:36] [INFO ] [Nat]Absence check using 218 positive place invariants in 35 ms returned sat
[2022-06-03 16:58:37] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:58:37] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-03 16:58:37] [INFO ] After 508ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:58:38] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-06-03 16:58:38] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2022-06-03 16:58:38] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-06-03 16:58:38] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2022-06-03 16:58:38] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2022-06-03 16:58:38] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2022-06-03 16:58:38] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2022-06-03 16:58:38] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-06-03 16:58:39] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-06-03 16:58:39] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2022-06-03 16:58:39] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2022-06-03 16:58:39] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2022-06-03 16:58:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1529 ms
[2022-06-03 16:58:39] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2022-06-03 16:58:40] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2022-06-03 16:58:40] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2022-06-03 16:58:40] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-06-03 16:58:40] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-06-03 16:58:40] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-06-03 16:58:40] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2022-06-03 16:58:40] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2022-06-03 16:58:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 821 ms
[2022-06-03 16:58:40] [INFO ] After 3325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 718 ms.
[2022-06-03 16:58:41] [INFO ] After 4579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:58:41] [INFO ] Flatten gal took : 89 ms
[2022-06-03 16:58:41] [INFO ] Flatten gal took : 42 ms
[2022-06-03 16:58:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16659436640838716175.gal : 18 ms
[2022-06-03 16:58:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8318898569389503218.prop : 7 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/ReachabilityCardinality16659436640838716175.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8318898569389503218.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8318898569389503218.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 182
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :182 after 3242
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3242 after 699842
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :699842 after 2.20695e+11
Detected timeout of ITS tools.
[2022-06-03 16:58:56] [INFO ] Flatten gal took : 37 ms
[2022-06-03 16:58:56] [INFO ] Applying decomposition
[2022-06-03 16:58:56] [INFO ] Flatten gal took : 35 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/graph11866224098545077695.txt' '-o' '/tmp/graph11866224098545077695.bin' '-w' '/tmp/graph11866224098545077695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11866224098545077695.bin' '-l' '-1' '-v' '-w' '/tmp/graph11866224098545077695.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:58:56] [INFO ] Decomposing Gal with order
[2022-06-03 16:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:58:57] [INFO ] Removed a total of 98 redundant transitions.
[2022-06-03 16:58:57] [INFO ] Flatten gal took : 85 ms
[2022-06-03 16:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 40 ms.
[2022-06-03 16:58:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7257303429353806919.gal : 21 ms
[2022-06-03 16:58:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16723808752851985264.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/ReachabilityCardinality7257303429353806919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16723808752851985264.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...299
Loading property file /tmp/ReachabilityCardinality16723808752851985264.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 330
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :330 after 232380
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :232380 after 5.01231e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.01231e+07 after 4.87194e+11
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.87194e+11 after 2.54189e+20
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin971013826190189578
[2022-06-03 16:59:12] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin971013826190189578
Running compilation step : cd /tmp/ltsmin971013826190189578;'/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 935 ms.
Running link step : cd /tmp/ltsmin971013826190189578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin971013826190189578;'/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' 'ShieldPPPtPT020BReachabilityFireability14==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 16:59:27] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10111741968234851434
[2022-06-03 16:59:27] [INFO ] Applying decomposition
[2022-06-03 16:59:27] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2022-06-03 16:59:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:59:27] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2022-06-03 16:59:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:59:27] [INFO ] Flatten gal took : 43 ms
[2022-06-03 16:59:27] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2022-06-03 16:59:27] [INFO ] Flatten gal took : 47 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/graph9888362801795193951.txt' '-o' '/tmp/graph9888362801795193951.bin' '-w' '/tmp/graph9888362801795193951.weights'
[2022-06-03 16:59:27] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:59:27] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10111741968234851434
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9888362801795193951.bin' '-l' '-1' '-v' '-w' '/tmp/graph9888362801795193951.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:59:27] [INFO ] Decomposing Gal with order
Running compilation step : cd /tmp/ltsmin10111741968234851434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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 16:59:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:59:27] [INFO ] Input system was already deterministic with 500 transitions.
[2022-06-03 16:59:27] [INFO ] Removed a total of 222 redundant transitions.
[2022-06-03 16:59:27] [INFO ] Flatten gal took : 53 ms
[2022-06-03 16:59:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 76 ms.
[2022-06-03 16:59:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12591611468386815161.gal : 22 ms
[2022-06-03 16:59:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8635425878221410450.prop : 2 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/ReachabilityFireability12591611468386815161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8635425878221410450.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...299
[2022-06-03 16:59:27] [INFO ] Ran tautology test, simplified 0 / 2 in 399 ms.
[2022-06-03 16:59:28] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=0 took 30 ms
[2022-06-03 16:59:28] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(UNSAT) depth K=0 took 1 ms
[2022-06-03 16:59:28] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=1 took 2 ms
[2022-06-03 16:59:28] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(UNSAT) depth K=1 took 11 ms
Loading property file /tmp/ReachabilityFireability8635425878221410450.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 92
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :92 after 1082
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1082 after 1.13374e+09
[2022-06-03 16:59:28] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=2 took 238 ms
[2022-06-03 16:59:28] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(UNSAT) depth K=2 took 158 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 500 rows 594 cols
[2022-06-03 16:59:28] [INFO ] Computed 218 place invariants in 1 ms
[2022-06-03 16:59:28] [INFO ] Computed 218 place invariants in 2 ms
Compilation finished in 1736 ms.
Running link step : cd /tmp/ltsmin10111741968234851434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10111741968234851434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT020BReachabilityFireability14==true'
[2022-06-03 16:59:30] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=3 took 1993 ms
[2022-06-03 16:59:34] [INFO ] Proved 594 variables to be positive in 5499 ms
[2022-06-03 16:59:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-03 16:59:34] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=0 took 343 ms
[2022-06-03 16:59:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-15
[2022-06-03 16:59:34] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(SAT) depth K=0 took 258 ms
[2022-06-03 16:59:34] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(UNSAT) depth K=3 took 4172 ms
[2022-06-03 16:59:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-03 16:59:35] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=1 took 935 ms
[2022-06-03 16:59:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-15
[2022-06-03 16:59:36] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(SAT) depth K=1 took 1036 ms
[2022-06-03 16:59:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-03 16:59:50] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=2 took 13164 ms
[2022-06-03 17:00:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-15
[2022-06-03 17:00:46] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(SAT) depth K=2 took 56824 ms
[2022-06-03 17:01:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-03 17:01:40] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=3 took 53838 ms
[2022-06-03 17:02:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-15
[2022-06-03 17:02:17] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(SAT) depth K=3 took 36498 ms
[2022-06-03 17:02:27] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=4 took 172494 ms
[2022-06-03 17:12:56] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(UNSAT) depth K=4 took 629759 ms
Detected timeout of ITS tools.
[2022-06-03 17:21:30] [INFO ] Applying decomposition
[2022-06-03 17:21:31] [INFO ] Flatten gal took : 72 ms
[2022-06-03 17:21:31] [INFO ] Decomposing Gal with order
[2022-06-03 17:21:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 17:21:31] [INFO ] Removed a total of 215 redundant transitions.
[2022-06-03 17:21:31] [INFO ] Flatten gal took : 134 ms
[2022-06-03 17:21:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 203 ms.
[2022-06-03 17:21:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12272348524836288113.gal : 24 ms
[2022-06-03 17:21:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7504521585362232754.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/ReachabilityFireability12272348524836288113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7504521585362232754.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...299
Loading property file /tmp/ReachabilityFireability7504521585362232754.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :489 after 489
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :489 after 1029
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1029 after 117129
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :117129 after 4.27126e+13
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.27126e+13 after 5.0242e+31
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin10111741968234851434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT020BReachabilityFireability14==true'
Running LTSmin : cd /tmp/ltsmin10111741968234851434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT020BReachabilityFireability15==true'
[2022-06-03 17:32:07] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(UNSAT) depth K=5 took 1150048 ms
[2022-06-03 17:42:26] [INFO ] BMC solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(UNSAT) depth K=5 took 619742 ms
Detected timeout of ITS tools.
[2022-06-03 17:43:34] [INFO ] Flatten gal took : 91 ms
[2022-06-03 17:43:34] [INFO ] Input system was already deterministic with 500 transitions.
[2022-06-03 17:43:34] [INFO ] Transformed 594 places.
[2022-06-03 17:43:34] [INFO ] Transformed 500 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-03 17:43:34] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12341718455007711038.gal : 2 ms
[2022-06-03 17:43:34] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6218678884376465180.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/ReachabilityFireability12341718455007711038.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6218678884376465180.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...365
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability6218678884376465180.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 100
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :100 after 162
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :162 after 164
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :164 after 50945
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :50945 after 338305
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :338305 after 8.19942e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.19942e+08 after 8.2123e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.2123e+10 after 8.50949e+12
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.50949e+12 after 7.1319e+13
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7.1319e+13 after 5.13178e+18
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.13178e+18 after 5.80702e+20
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :5.80702e+20 after 1.94925e+24
[2022-06-03 17:45:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-14
[2022-06-03 17:45:55] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-14(SAT) depth K=4 took 2617874 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.94925e+24 after 1.28183e+28
[2022-06-03 17:49:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-020B-ReachabilityFireability-15
[2022-06-03 17:49:33] [INFO ] KInduction solution for property ShieldPPPt-PT-020B-ReachabilityFireability-15(SAT) depth K=4 took 218451 ms
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.28183e+28 after 1.59964e+29

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ 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 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="ShieldPPPt-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 ShieldPPPt-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-165286025500639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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