fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r212-tall-174901994000287
Last Updated
June 24, 2025

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1909359.00 0.00 0.00 FTTTTFFFTTTTTFFT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994000287.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ShieldRVt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994000287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 239K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749108431112

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 07:27:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 07:27:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:27:12] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2025-06-05 07:27:12] [INFO ] Transformed 1003 places.
[2025-06-05 07:27:12] [INFO ] Transformed 1003 transitions.
[2025-06-05 07:27:12] [INFO ] Found NUPN structural information;
[2025-06-05 07:27:12] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1839 ms. (21 steps per ms) remains 4/16 properties
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
[2025-06-05 07:27:13] [INFO ] Flatten gal took : 236 ms
[2025-06-05 07:27:13] [INFO ] Flatten gal took : 134 ms
BEST_FIRST walk for 40004 steps (8 resets) in 640 ms. (62 steps per ms) remains 4/4 properties
[2025-06-05 07:27:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16081388535969882062.gal : 53 ms
[2025-06-05 07:27:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11983506604034086968.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16081388535969882062.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11983506604034086968.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality11983506604034086968.prop.
// Phase 1: matrix 1003 rows 1003 cols
[2025-06-05 07:27:13] [INFO ] Computed 81 invariants in 22 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 821/949 variables, 76/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 49
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :49 after 229
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :229 after 2.80904e+06
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.80904e+06 after 3.60626e+12
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3.60626e+12 after 2.33771e+26
At refinement iteration 3 (INCLUDED_ONLY) 0/949 variables, 821/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 54/1003 variables, 5/1030 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 54/1084 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1003/2006 variables, 1003/2087 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2006 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2006 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2006/2006 variables, and 2087 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1316 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 821/949 variables, 76/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/949 variables, 821/1025 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:15] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:15] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:15] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:16] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:16] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:16] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:16] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:16] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:17] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:17] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:17] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:17] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:17] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:17] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:17] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:18] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:18] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:18] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:18] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:18] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 20/1045 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:18] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:20] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 20 ms to minimize.
SMT process timed out in 6505ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 128 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1003 transition count 808
Reduce places removed 195 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 238 rules applied. Total rules applied 433 place count 808 transition count 765
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 476 place count 765 transition count 765
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 476 place count 765 transition count 681
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 644 place count 681 transition count 681
Discarding 118 places :
Symmetric choice reduction at 3 with 118 rule applications. Total rules 762 place count 563 transition count 563
Iterating global reduction 3 with 118 rules applied. Total rules applied 880 place count 563 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 882 place count 563 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 883 place count 562 transition count 561
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 883 place count 562 transition count 528
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 949 place count 529 transition count 528
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 5 with 274 rules applied. Total rules applied 1223 place count 392 transition count 391
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1285 place count 361 transition count 403
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1293 place count 361 transition count 395
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1301 place count 353 transition count 395
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1304 place count 353 transition count 392
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1305 place count 353 transition count 392
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1306 place count 353 transition count 392
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1307 place count 352 transition count 391
Applied a total of 1307 rules in 266 ms. Remains 352 /1003 variables (removed 651) and now considering 391/1003 (removed 612) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 352/1003 places, 391/1003 transitions.
RANDOM walk for 40000 steps (10 resets) in 568 ms. (70 steps per ms) remains 3/4 properties
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 2/3 properties
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 391 rows 352 cols
[2025-06-05 07:27:20] [INFO ] Computed 81 invariants in 2 ms
[2025-06-05 07:27:20] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/283 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/348 variables, 23/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/737 variables, 348/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 60/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/737 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/743 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/743 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/743 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 743/743 variables, and 493 constraints, problems are : Problem set: 0 solved, 2 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 352/352 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/283 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 65/348 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:21] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 389/737 variables, 348/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 60/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:22] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:22] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/737 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:22] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:22] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:22] [INFO ] Deduced a trap along path composed of 4 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:22] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:22] [INFO ] Deduced a trap along path composed of 4 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:22] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/737 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/743 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/743 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/743 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 743/743 variables, and 510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1659 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 352/352 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 2096ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 547 ms.
Support contains 75 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 391/391 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 352 transition count 377
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 338 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 337 transition count 376
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 30 place count 337 transition count 358
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 66 place count 319 transition count 358
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 71 place count 314 transition count 353
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 314 transition count 353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 76 place count 314 transition count 352
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 313 transition count 352
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 140 place count 282 transition count 321
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 160 place count 272 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 272 transition count 327
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 272 transition count 327
Applied a total of 163 rules in 65 ms. Remains 272 /352 variables (removed 80) and now considering 327/391 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 272/352 places, 327/391 transitions.
RANDOM walk for 40000 steps (12 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 371063 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 2
Probabilistic random walk after 371063 steps, saw 262391 distinct states, run finished after 3008 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 327 rows 272 cols
[2025-06-05 07:27:26] [INFO ] Computed 81 invariants in 5 ms
[2025-06-05 07:27:26] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/224 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/270 variables, 23/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/597 variables, 270/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 85/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/599 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/599 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 438 constraints, problems are : Problem set: 0 solved, 2 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 272/272 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/224 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:27] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:27] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:27] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:27] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:27] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 46/270 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 327/597 variables, 270/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 85/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:27] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:28] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:28] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:28] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:28] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:28] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:28] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/599 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:28] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/599 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/599 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/599 variables, and 451 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 272/272 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 2102ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 602 ms.
Support contains 75 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 327/327 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 272/272 places, 327/327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 327/327 transitions.
Applied a total of 0 rules in 17 ms. Remains 272 /272 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2025-06-05 07:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 07:27:29] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-05 07:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 07:27:29] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-05 07:27:30] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 07:27:30] [INFO ] Redundant transitions in 24 ms returned []
Running 324 sub problems to find dead transitions.
[2025-06-05 07:27:30] [INFO ] Invariant cache hit.
[2025-06-05 07:27:30] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 3/272 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:34] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:34] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:35] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:35] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 327/599 variables, 272/359 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 85/444 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/599 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 444 constraints, problems are : Problem set: 0 solved, 324 unsolved in 16535 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 272/272 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 3/272 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 327/599 variables, 272/359 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 85/444 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 324/768 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:53] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:53] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:53] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:53] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:53] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:54] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:54] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:54] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:55] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:56] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:57] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:27:57] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 12/780 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:04] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:04] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:04] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:04] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:04] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:04] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:04] [INFO ] Deduced a trap along path composed of 4 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:05] [INFO ] Deduced a trap along path composed of 4 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:05] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:05] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:05] [INFO ] Deduced a trap along path composed of 4 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:05] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:06] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:06] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:06] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:06] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:07] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:07] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:14] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:14] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 20/800 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/599 variables, and 800 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 272/272 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 46653ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 46655ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47216 ms. Remains : 272/272 places, 327/327 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 272 transition count 309
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 272 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 272 transition count 306
Applied a total of 29 rules in 23 ms. Remains 272 /272 variables (removed 0) and now considering 306/327 (removed 21) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 306 rows 272 cols
[2025-06-05 07:28:16] [INFO ] Computed 81 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 07:28:16] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 07:28:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2025-06-05 07:28:17] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
[2025-06-05 07:28:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 270 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
[2025-06-05 07:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
[2025-06-05 07:28:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 07:28:17] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
[2025-06-05 07:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
TRAPS : Iteration 3
[2025-06-05 07:28:17] [INFO ] After 790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 07:28:17] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-05 07:28:17] [INFO ] Flatten gal took : 21 ms
[2025-06-05 07:28:17] [INFO ] Flatten gal took : 20 ms
[2025-06-05 07:28:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6845016459415371076.gal : 3 ms
[2025-06-05 07:28:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality899188245912033645.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6845016459415371076.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality899188245912033645.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality899188245912033645.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 39
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :39 after 5377
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5377 after 193537
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :193537 after 9.53126e+09
Detected timeout of ITS tools.
[2025-06-05 07:28:32] [INFO ] Flatten gal took : 17 ms
[2025-06-05 07:28:32] [INFO ] Applying decomposition
[2025-06-05 07:28:32] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16365632554073140235.txt' '-o' '/tmp/graph16365632554073140235.bin' '-w' '/tmp/graph16365632554073140235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16365632554073140235.bin' '-l' '-1' '-v' '-w' '/tmp/graph16365632554073140235.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:28:33] [INFO ] Decomposing Gal with order
[2025-06-05 07:28:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:28:33] [INFO ] Removed a total of 229 redundant transitions.
[2025-06-05 07:28:33] [INFO ] Flatten gal took : 106 ms
[2025-06-05 07:28:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 43 ms.
[2025-06-05 07:28:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14698019359469894106.gal : 9 ms
[2025-06-05 07:28:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14819595197667154894.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14698019359469894106.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14819595197667154894.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14819595197667154894.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 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1632 after 6384
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6384 after 2.12894e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.12894e+06 after 1.32434e+11
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.01333e+36,2.66506,108748,933,37,216019,278,946,621357,82,865,0
Total reachable state count : 6013327300889349301893994582051389440

Verifying 2 reachability properties.
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-2025-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-2025-05,4.21063e+33,2.67861,108748,580,32,216019,278,1010,621357,89,865,2048
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-2025-07 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-2025-07,6.69293e+33,2.69854,108748,869,34,216019,278,1081,621357,90,865,4922
Over-approximation ignoring read arcs solved 0 properties in 19272 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 07:28:36] [INFO ] Flatten gal took : 32 ms
[2025-06-05 07:28:36] [INFO ] Applying decomposition
[2025-06-05 07:28:36] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2161705040118333932.txt' '-o' '/tmp/graph2161705040118333932.bin' '-w' '/tmp/graph2161705040118333932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2161705040118333932.bin' '-l' '-1' '-v' '-w' '/tmp/graph2161705040118333932.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:28:36] [INFO ] Decomposing Gal with order
[2025-06-05 07:28:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:28:36] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-05 07:28:36] [INFO ] Flatten gal took : 57 ms
[2025-06-05 07:28:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-05 07:28:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality962261134055647381.gal : 13 ms
[2025-06-05 07:28:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12602242888844541331.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality962261134055647381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12602242888844541331.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality12602242888844541331.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 278
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :278 after 2.54098e+09
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2.54098e+09 after 1.61137e+44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.61137e+44 after 6.35688e+47
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6.35688e+47 after 2.47852e+48
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-2025-07 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.47852e+48 after 5.893e+52
Detected timeout of ITS tools.
[2025-06-05 07:58:39] [INFO ] Flatten gal took : 235 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12116653612371020600
[2025-06-05 07:58:39] [INFO ] Applying decomposition
[2025-06-05 07:58:39] [INFO ] Flatten gal took : 177 ms
[2025-06-05 07:58:39] [INFO ] Computing symmetric may disable matrix : 327 transitions.
[2025-06-05 07:58:39] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 07:58:39] [INFO ] Computing symmetric may enable matrix : 327 transitions.
[2025-06-05 07:58:39] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 07:58:40] [INFO ] Computing Do-Not-Accords matrix : 327 transitions.
[2025-06-05 07:58:40] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 07:58:40] [INFO ] Built C files in 622ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12116653612371020600
Running compilation step : cd /tmp/ltsmin12116653612371020600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4786028871298211799.txt' '-o' '/tmp/graph4786028871298211799.bin' '-w' '/tmp/graph4786028871298211799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4786028871298211799.bin' '-l' '-1' '-v' '-w' '/tmp/graph4786028871298211799.weights' '-q' '0' '-e' '0.001'
[2025-06-05 07:58:40] [INFO ] Decomposing Gal with order
[2025-06-05 07:58:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 07:58:46] [INFO ] Removed a total of 286 redundant transitions.
[2025-06-05 07:58:46] [INFO ] Flatten gal took : 82 ms
[2025-06-05 07:58:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 615 ms.
[2025-06-05 07:58:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7988820233867664642.gal : 7 ms
[2025-06-05 07:58:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1406864625464905521.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7988820233867664642.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1406864625464905521.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Compilation finished in 6650 ms.
Running link step : cd /tmp/ltsmin12116653612371020600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Loading property file /tmp/ReachabilityFireability1406864625464905521.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 408
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :408 after 22368
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22368 after 2.50823e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.50823e+09 after 1.71563e+12
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12116653612371020600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVtPT020BReachabilityFireability202505==true'
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-2025-05 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.32242e+35,4.01619,65976,974,219,136794,1122,731,351732,167,6710,0
Total reachable state count : 532241695417660506906842048476741632

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-2025-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-2025-05,2.25638e+32,6.01563,66232,845,147,136794,1122,869,351732,182,6710,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1908020 ms.

BK_STOP 1749110340471

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-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-5832"
echo " Executing tool itstools"
echo " Input is ShieldRVt-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 r212-tall-174901994000287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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