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

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

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994100303.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-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994100303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 28K 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 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K 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 364K 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-030B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749116214821

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-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 09:36:56] [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 09:36:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 09:36:56] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2025-06-05 09:36:56] [INFO ] Transformed 1503 places.
[2025-06-05 09:36:56] [INFO ] Transformed 1503 transitions.
[2025-06-05 09:36:56] [INFO ] Found NUPN structural information;
[2025-06-05 09:36:56] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 09:36:57] [INFO ] Flatten gal took : 236 ms
[2025-06-05 09:36:57] [INFO ] Flatten gal took : 85 ms
RANDOM walk for 40000 steps (8 resets) in 2121 ms. (18 steps per ms) remains 11/16 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 09:36:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14539581449946569870.gal : 61 ms
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
[2025-06-05 09:36:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5546175729496149659.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/ReachabilityCardinality14539581449946569870.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5546175729496149659.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 11/11 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 ...329
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality5546175729496149659.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 11/11 properties
// Phase 1: matrix 1503 rows 1503 cols
[2025-06-05 09:36:58] [INFO ] Computed 121 invariants in 31 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, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1318/1446 variables, 116/244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 239
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :239 after 2.01901e+06
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :2.01901e+06 after 9.61669e+12
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :9.61669e+12 after 3.00562e+26
At refinement iteration 3 (INCLUDED_ONLY) 0/1446 variables, 1318/1562 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :3.00562e+26 after 2.78374e+54
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2025-03 is true.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property ShieldRVt-PT-030B-ReachabilityFireability-2025-02 does not hold.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :2.78374e+54 after 4.08332e+69
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :4.08332e+69 after 4.08332e+69
At refinement iteration 4 (INCLUDED_ONLY) 0/1446 variables, 0/1562 constraints. Problems are: Problem set: 2 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :4.08332e+69 after 4.08332e+69
At refinement iteration 5 (OVERLAPS) 57/1503 variables, 5/1567 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1503 variables, 57/1624 constraints. Problems are: Problem set: 2 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :4.08332e+69 after 4.08332e+69
At refinement iteration 7 (INCLUDED_ONLY) 0/1503 variables, 0/1624 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2025-12 is true.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :4.08332e+69 after 4.08332e+69
At refinement iteration 8 (OVERLAPS) 1503/3006 variables, 1503/3127 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 3 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :4.08332e+69 after 4.08332e+69
At refinement iteration 10 (OVERLAPS) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 3127 constraints, problems are : Problem set: 3 solved, 8 unsolved in 3139 ms.
Refiners :[Domain max(s): 1503/1503 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1503/1503 constraints, PredecessorRefiner: 11/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1321/1446 variables, 116/241 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1446 variables, 1321/1562 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:02] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :4.08332e+69 after 4.08332e+69
[2025-06-05 09:37:02] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:02] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:02] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:03] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:03] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:03] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:03] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:03] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:04] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:04] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:04] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:04] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:04] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:04] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:05] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:05] [INFO ] Deduced a trap composed of 45 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 09:37:05] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1446 variables, 18/1580 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:05] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:05] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:06] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :4.08332e+69 after 4.08332e+69
[2025-06-05 09:37:06] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 16 ms to minimize.
SMT process timed out in 8373ms, After SMT, problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 125 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1503 transition count 1143
Reduce places removed 360 places and 0 transitions.
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 1 with 362 rules applied. Total rules applied 722 place count 1143 transition count 1141
Reduce places removed 1 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 35 rules applied. Total rules applied 757 place count 1142 transition count 1107
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 791 place count 1108 transition count 1107
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 129 Pre rules applied. Total rules applied 791 place count 1108 transition count 978
Deduced a syphon composed of 129 places in 4 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1049 place count 979 transition count 978
Discarding 192 places :
Symmetric choice reduction at 4 with 192 rule applications. Total rules 1241 place count 787 transition count 786
Iterating global reduction 4 with 192 rules applied. Total rules applied 1433 place count 787 transition count 786
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1433 place count 787 transition count 720
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1565 place count 721 transition count 720
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: 228
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 4 with 456 rules applied. Total rules applied 2021 place count 493 transition count 492
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 2147 place count 430 transition count 532
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2153 place count 430 transition count 526
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2159 place count 424 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2160 place count 424 transition count 525
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2162 place count 424 transition count 525
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2163 place count 424 transition count 525
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2164 place count 423 transition count 524
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2165 place count 422 transition count 524
Applied a total of 2165 rules in 361 ms. Remains 422 /1503 variables (removed 1081) and now considering 524/1503 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 422/1503 places, 524/1503 transitions.
RANDOM walk for 40000 steps (8 resets) in 597 ms. (66 steps per ms) remains 5/8 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/5 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 3/4 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
// Phase 1: matrix 524 rows 422 cols
[2025-06-05 09:37:07] [INFO ] Computed 120 invariants in 2 ms
[2025-06-05 09:37:07] [INFO ] State equation strengthened by 150 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 361/390 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/400 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 501/901 variables, 400/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/901 variables, 149/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/901 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 21/922 variables, 9/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/922 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/922 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/928 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 16/944 variables, 11/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/944 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/946 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/946 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 946/946 variables, and 692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 422/422 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 361/390 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:08] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:08] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:08] [INFO ] Deduced a trap composed of 13 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 09:37:08] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:08] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:08] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:08] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:08] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/400 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 501/901 variables, 400/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/901 variables, 149/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:09] [INFO ] Deduced a trap composed of 15 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 09:37:09] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 2/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:09] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/901 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:10] [INFO ] Deduced a trap along path composed of 5 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:10] [INFO ] Deduced a trap along path composed of 4 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 09:37:10] [INFO ] Deduced a trap along path composed of 6 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:10] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:10] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:10] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 6/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 21/922 variables, 9/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/922 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/922 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/922 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/928 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/928 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 16/944 variables, 11/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/944 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/946 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/946 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/946 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/946 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 946/946 variables, and 712 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4307 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 422/422 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 5042ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 220 ms.
Support contains 29 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 524/524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 422 transition count 500
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 398 transition count 498
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 396 transition count 498
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 52 place count 396 transition count 465
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 118 place count 363 transition count 465
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 361 transition count 463
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 361 transition count 463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 122 place count 361 transition count 462
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 124 place count 360 transition count 462
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 232 place count 306 transition count 408
Renaming transitions due to excessive name length > 1024 char.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 274 place count 285 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 279 place count 285 transition count 430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 284 transition count 429
Applied a total of 280 rules in 104 ms. Remains 284 /422 variables (removed 138) and now considering 429/524 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 284/422 places, 429/524 transitions.
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 280823 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :1 out of 3
Probabilistic random walk after 280823 steps, saw 184918 distinct states, run finished after 3006 ms. (steps per millisecond=93 ) properties seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 429 rows 284 cols
[2025-06-05 09:37:15] [INFO ] Computed 120 invariants in 3 ms
[2025-06-05 09:37:15] [INFO ] State equation strengthened by 233 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 237/264 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/272 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 417/689 variables, 272/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 232/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/705 variables, 8/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/705 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/713 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/713 variables, 2/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/713 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/713 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/713 variables, and 637 constraints, problems are : Problem set: 0 solved, 2 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 284/284 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 2/2 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 237/264 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 131072
[2025-06-05 09:37:16] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :4.08332e+69 after 4.08332e+69
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/272 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 417/689 variables, 272/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 232/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 2/621 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 09:37:18] [INFO ] Deduced a trap composed of 8 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 09:37:18] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:18] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 3/624 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 09:37:19] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:19] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/705 variables, 8/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 4/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/713 variables, 4/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/713 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/713 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/713 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 713/713 variables, and 645 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4677 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 284/284 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5140ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 245 ms.
Support contains 27 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 429/429 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 0 with 1 rules applied. Total rules applied 1 place count 284 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 283 transition count 428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 282 transition count 427
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 282 transition count 427
Applied a total of 5 rules in 35 ms. Remains 282 /284 variables (removed 2) and now considering 427/429 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 282/284 places, 427/429 transitions.
RANDOM walk for 40000 steps (9 resets) in 520 ms. (76 steps per ms) remains 1/2 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
// Phase 1: matrix 427 rows 282 cols
[2025-06-05 09:37:21] [INFO ] Computed 120 invariants in 2 ms
[2025-06-05 09:37:21] [INFO ] State equation strengthened by 234 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 236/262 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/270 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 415/685 variables, 270/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/685 variables, 233/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/685 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/701 variables, 8/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/701 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/701 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/701 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/709 variables, 4/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/709 variables, 2/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/709 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/709 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 709/709 variables, and 636 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 282/282 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 236/262 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:22] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/270 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 415/685 variables, 270/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/685 variables, 233/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:22] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:23] [INFO ] Deduced a trap along path composed of 2 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 09:37:23] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:23] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/685 variables, 3/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:24] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/685 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/701 variables, 8/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/701 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/701 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/709 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/709 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/709 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 709/709 variables, and 644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3063 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 282/282 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 3444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 26 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 427/427 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 281 transition count 426
Applied a total of 2 rules in 12 ms. Remains 281 /282 variables (removed 1) and now considering 426/427 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 281/282 places, 426/427 transitions.
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 533953 steps, run timeout after 3018 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 533953 steps, saw 360883 distinct states, run finished after 3019 ms. (steps per millisecond=176 ) properties seen :0
// Phase 1: matrix 426 rows 281 cols
[2025-06-05 09:37:28] [INFO ] Computed 120 invariants in 2 ms
[2025-06-05 09:37:28] [INFO ] State equation strengthened by 234 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 235/261 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/269 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 414/683 variables, 269/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 233/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/699 variables, 8/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/699 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/699 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/707 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/707 variables, 2/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/707 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/707 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 635 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2074 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 281/281 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 235/261 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/269 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 414/683 variables, 269/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 233/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:31] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:31] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:31] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:31] [INFO ] Deduced a trap composed of 10 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 09:37:31] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 5/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:31] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:31] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/683 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/683 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/699 variables, 8/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/699 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/699 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:32] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/707 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/707 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/707 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/707 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2215 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 281/281 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 4326ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 26 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 426/426 transitions.
Applied a total of 0 rules in 7 ms. Remains 281 /281 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 281/281 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 426/426 transitions.
Applied a total of 0 rules in 13 ms. Remains 281 /281 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2025-06-05 09:37:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:37:32] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-05 09:37:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:37:33] [INFO ] State equation strengthened by 234 read => feed constraints.
[2025-06-05 09:37:33] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:37:34] [INFO ] Redundant transitions in 34 ms returned []
Running 423 sub problems to find dead transitions.
[2025-06-05 09:37:34] [INFO ] Invariant cache hit.
[2025-06-05 09:37:34] [INFO ] State equation strengthened by 234 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,8 properties remain. new max is 262144
SDD size :4.08332e+69 after 4.08332e+69
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/281 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:37:40] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (OVERLAPS) 426/707 variables, 281/402 constraints. Problems are: Problem set: 0 solved, 423 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 234/636 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 0/707 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 636 constraints, problems are : Problem set: 0 solved, 423 unsolved in 26071 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 281/281 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/281 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (OVERLAPS) 426/707 variables, 281/402 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 234/636 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 423/1059 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Reachability property ShieldRVt-PT-030B-ReachabilityFireability-2025-11 is true.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:22] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 707/707 variables, and 1068 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 281/281 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 56225ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 56238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57563 ms. Remains : 281/281 places, 426/426 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 93 edges and 281 vertex of which 2 / 281 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 94 edges and 279 vertex of which 2 / 279 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 278 transition count 424
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 277 transition count 421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 277 transition count 420
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 275 transition count 420
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 273 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 273 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 273 transition count 402
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 55 place count 273 transition count 402
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 75 place count 273 transition count 382
Applied a total of 75 rules in 50 ms. Remains 273 /281 variables (removed 8) and now considering 382/426 (removed 44) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 382 rows 273 cols
[2025-06-05 09:38:30] [INFO ] Computed 116 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 09:38:30] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 09:38:30] [INFO ] [Nat]Absence check using 116 positive place invariants in 19 ms returned sat
[2025-06-05 09:38:30] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-05 09:38:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 09:38:30] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:30] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 5 ms to minimize.
[2025-06-05 09:38:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:30] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
[2025-06-05 09:38:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:31] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 8 ms to minimize.
[2025-06-05 09:38:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:38:31] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 5 ms to minimize.
[2025-06-05 09:38:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
TRAPS : Iteration 4
[2025-06-05 09:38:31] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 09:38:31] [INFO ] After 872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-05 09:38:31] [INFO ] Flatten gal took : 39 ms
[2025-06-05 09:38:31] [INFO ] Flatten gal took : 24 ms
[2025-06-05 09:38:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3333567642160997344.gal : 4 ms
[2025-06-05 09:38:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15993278034906986754.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/ReachabilityCardinality3333567642160997344.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15993278034906986754.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 ...329
Loading property file /tmp/ReachabilityCardinality15993278034906986754.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 147
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :147 after 7779
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :139983 after 760990
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :760990 after 957549
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :957549 after 5.15404e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.15404e+10 after 1.15517e+18
Invariant property ShieldRVt-PT-030B-ReachabilityFireability-2025-14 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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,1.18324e+26,0.193622,10556,2,1840,16,25777,6,0,1476,30710,0
Total reachable state count : 118323585558386147523035136

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-030B-ReachabilityFireability-2025-14 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-030B-ReachabilityFireability-2025-14,1,0.196136,10684,2,274,16,25777,7,0,1525,30710,0
Over-approximation ignoring read arcs solved 0 properties in 1266 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 09:38:31] [INFO ] Flatten gal took : 45 ms
[2025-06-05 09:38:31] [INFO ] Applying decomposition
[2025-06-05 09:38:31] [INFO ] Flatten gal took : 43 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/graph3046374371166997318.txt' '-o' '/tmp/graph3046374371166997318.bin' '-w' '/tmp/graph3046374371166997318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3046374371166997318.bin' '-l' '-1' '-v' '-w' '/tmp/graph3046374371166997318.weights' '-q' '0' '-e' '0.001'
[2025-06-05 09:38:32] [INFO ] Decomposing Gal with order
[2025-06-05 09:38:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 09:38:32] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-05 09:38:32] [INFO ] Flatten gal took : 131 ms
[2025-06-05 09:38:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-06-05 09:38:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5352672851510904944.gal : 18 ms
[2025-06-05 09:38:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3857642219659483729.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/ReachabilityCardinality5352672851510904944.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3857642219659483729.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/ReachabilityCardinality3857642219659483729.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 278
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :278 after 1225
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1225 after 3403
Invariant property ShieldRVt-PT-030B-ReachabilityFireability-2025-14 does not hold.
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.16558e+75,3.17265,80744,9905,30,162315,534,1327,386899,38,1243,0
Total reachable state count : 1.165577226662782825560719936178861994316e+75

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-030B-ReachabilityFireability-2025-14 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-030B-ReachabilityFireability-2025-14,3.15592e+63,4.22352,81000,2061,28,162315,534,1452,386899,53,1243,0
All properties solved without resorting to model-checking.
Total runtime 100647 ms.

BK_STOP 1749116316720

--------------------
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-030B"
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-030B, 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-174901994100303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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