Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533600926.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 ShieldPPPt-PT-050A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533600926
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 27K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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 337K 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 ShieldPPPt-PT-050A-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldPPPt-PT-050A-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749333845960

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-07 22:04:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 22:04:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 22:04:07] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2025-06-07 22:04:07] [INFO ] Transformed 1253 places.
[2025-06-07 22:04:07] [INFO ] Transformed 903 transitions.
[2025-06-07 22:04:07] [INFO ] Found NUPN structural information;
[2025-06-07 22:04:07] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2253 ms. (17 steps per ms) remains 10/12 properties
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 22:04:08] [INFO ] Flatten gal took : 418 ms
BEST_FIRST walk for 40003 steps (8 resets) in 554 ms. (72 steps per ms) remains 10/10 properties
[2025-06-07 22:04:08] [INFO ] Flatten gal took : 172 ms
BEST_FIRST walk for 40003 steps (8 resets) in 573 ms. (69 steps per ms) remains 10/10 properties
[2025-06-07 22:04:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5614771000508150060.gal : 70 ms
[2025-06-07 22:04:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17759402467517994329.prop : 14 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/ReachabilityCardinality5614771000508150060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17759402467517994329.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
BEST_FIRST walk for 40003 steps (8 resets) in 680 ms. (58 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality17759402467517994329.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 675 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 527 ms. (75 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 407 ms. (98 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 10/10 properties
// Phase 1: matrix 902 rows 1253 cols
[2025-06-07 22:04:09] [INFO ] Computed 551 invariants in 15 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/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 24
At refinement iteration 2 (OVERLAPS) 218/361 variables, 145/288 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :24 after 49
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :49 after 99
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 218/506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :99 after 272
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :272 after 2431
Reachability property ShieldPPPt-PT-050A-ReachabilityCardinality-2025-02 is true.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :2431 after 1.01828e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/506 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1.01828e+06 after 1.99554e+07
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1.99554e+07 after 9.91872e+10
At refinement iteration 5 (OVERLAPS) 892/1253 variables, 406/912 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 892/1804 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :9.91872e+10 after 8.44186e+20
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Invariant property ShieldPPPt-PT-050A-ReachabilityCardinality-2025-14 does not hold.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2155/2155 variables, and 3057 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1904 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 214/353 variables, 142/281 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 214/495 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 900/1253 variables, 409/904 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 900/1804 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 7/3064 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2155 variables, 0/3064 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2155/2155 variables, and 3064 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5019 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7029ms problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 139 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 141 times.
Drop transitions (Partial Free agglomeration) removed 141 transitions
Iterating global reduction 0 with 141 rules applied. Total rules applied 145 place count 1251 transition count 900
Applied a total of 145 rules in 280 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 1251/1253 places, 900/902 transitions.
RANDOM walk for 40000 steps (8 resets) in 891 ms. (44 steps per ms) remains 6/8 properties
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 297 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
// Phase 1: matrix 900 rows 1251 cols
[2025-06-07 22:04:17] [INFO ] Computed 551 invariants in 7 ms
[2025-06-07 22:04:17] [INFO ] State equation strengthened by 42 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/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 147/238 variables, 94/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 147/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1013/1251 variables, 457/789 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1251 variables, 1013/1802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1251 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 900/2151 variables, 1251/3053 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 42/3095 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 0/3095 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/2151 variables, 0/3095 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2151/2151 variables, and 3095 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1267 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1251/1251 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 147/238 variables, 94/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 147/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1013/1251 variables, 457/789 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1251 variables, 1013/1802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1251 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 900/2151 variables, 1251/3053 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 42/3095 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 4/3099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:04:21] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:04:21] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:04:21] [INFO ] Deduced a trap along path composed of 3 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-07 22:04:21] [INFO ] Deduced a trap along path composed of 3 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-07 22:04:21] [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-07 22:04:21] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:04:21] [INFO ] Deduced a trap along path composed of 3 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-07 22:04:22] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2151 variables, 8/3107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2151 variables, 0/3107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2151 variables, 0/3107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2151/2151 variables, and 3107 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6308 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1251/1251 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 7619ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 13225 ms.
Support contains 85 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 1251 transition count 900
Applied a total of 19 rules in 80 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1251/1251 places, 900/900 transitions.
RANDOM walk for 40000 steps (8 resets) in 503 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 198175 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :3 out of 4
Probabilistic random walk after 198175 steps, saw 193299 distinct states, run finished after 3008 ms. (steps per millisecond=65 ) properties seen :3
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 900 rows 1251 cols
[2025-06-07 22:04:42] [INFO ] Computed 551 invariants in 8 ms
[2025-06-07 22:04:42] [INFO ] State equation strengthened by 44 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/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/25 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1251 variables, 541/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1251 variables, 1226/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1251 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 900/2151 variables, 1251/3053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 44/3097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 0/3097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2151 variables, 0/3097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2151/2151 variables, and 3097 constraints, problems are : Problem set: 0 solved, 1 unsolved in 621 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1251/1251 constraints, ReadFeed: 44/44 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/25 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1251 variables, 541/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1251 variables, 1226/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1251 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 900/2151 variables, 1251/3053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 44/3097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 1/3098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2151 variables, 0/3098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:04:44] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/2151 variables, 1/3099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2151 variables, 0/3099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2151 variables, 0/3099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2151/2151 variables, and 3099 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1771 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1251/1251 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2416ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1232 ms.
Support contains 10 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Partial Free-agglomeration rule applied 37 times.
Drop transitions (Partial Free agglomeration) removed 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 1251 transition count 900
Applied a total of 37 rules in 60 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1251/1251 places, 900/900 transitions.
RANDOM walk for 40000 steps (8 resets) in 449 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274699 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274699 steps, saw 263685 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 900 rows 1251 cols
[2025-06-07 22:04:49] [INFO ] Computed 551 invariants in 8 ms
[2025-06-07 22:04:49] [INFO ] State equation strengthened by 52 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/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/25 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1251 variables, 541/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1251 variables, 1226/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1251 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 900/2151 variables, 1251/3053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 52/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 0/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2151 variables, 0/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2151/2151 variables, and 3105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1251/1251 constraints, ReadFeed: 52/52 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/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/25 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1251 variables, 541/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1251 variables, 1226/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1251 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 900/2151 variables, 1251/3053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 52/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 1/3106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:04:50] [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-07 22:04:50] [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-07 22:04:51] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2151 variables, 3/3109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2151 variables, 0/3109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2151 variables, 0/3109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2151/2151 variables, and 3109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1617 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1251/1251 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2291ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1143 ms.
Support contains 10 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Applied a total of 0 rules in 42 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1251/1251 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 900/900 transitions.
Applied a total of 0 rules in 27 ms. Remains 1251 /1251 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2025-06-07 22:04:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:04:53] [INFO ] Implicit Places using invariants in 780 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 795 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1250/1251 places, 900/900 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 56 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2025-06-07 22:04:53] [INFO ] Computed 550 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:04:54] [INFO ] Implicit Places using invariants in 684 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 686 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1246/1251 places, 898/900 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1244 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 156 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2025-06-07 22:04:54] [INFO ] Computed 548 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:04:55] [INFO ] Implicit Places using invariants in 595 ms returned []
[2025-06-07 22:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:04:55] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-07 22:04:57] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1244/1251 places, 896/900 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4419 ms. Remains : 1244/1251 places, 896/900 transitions.
RANDOM walk for 40000 steps (8 resets) in 450 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 283848 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 283848 steps, saw 273737 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :0
[2025-06-07 22:05:00] [INFO ] Invariant cache hit.
[2025-06-07 22:05:00] [INFO ] State equation strengthened by 50 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1219/1244 variables, 538/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1244 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 896/2140 variables, 1244/1792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2140 variables, 50/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2140 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2140 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2140/2140 variables, and 1842 constraints, problems are : Problem set: 0 solved, 1 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1244/1244 constraints, ReadFeed: 50/50 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1219/1244 variables, 538/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1244 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 896/2140 variables, 1244/1792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2140 variables, 50/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2140 variables, 1/1843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2140 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2140 variables, 0/1843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2140/2140 variables, and 1843 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1244/1244 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2642ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 991 ms.
Support contains 10 out of 1244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 54 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1244/1244 places, 896/896 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 42 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2025-06-07 22:05:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:05:04] [INFO ] Implicit Places using invariants in 619 ms returned []
[2025-06-07 22:05:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:05:05] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-07 22:05:06] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 2695 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:05:06] [INFO ] Redundant transitions in 65 ms returned []
Running 895 sub problems to find dead transitions.
[2025-06-07 22:05:06] [INFO ] Invariant cache hit.
[2025-06-07 22:05:06] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 895 unsolved
SMT process timed out in 30375ms, After SMT, problems are : Problem set: 0 solved, 895 unsolved
Search for dead transitions found 0 dead transitions in 30384ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33204 ms. Remains : 1244/1244 places, 896/896 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 48 times.
Drop transitions (Partial Free agglomeration) removed 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 1244 transition count 896
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1244 transition count 848
Applied a total of 96 rules in 116 ms. Remains 1244 /1244 variables (removed 0) and now considering 848/896 (removed 48) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 848 rows 1244 cols
[2025-06-07 22:05:37] [INFO ] Computed 548 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 22:05:37] [INFO ] After 137ms 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-07 22:05:37] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2025-06-07 22:05:38] [INFO ] After 1056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-07 22:05:39] [INFO ] After 1382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-07 22:05:39] [INFO ] After 2097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-07 22:05:39] [INFO ] Flatten gal took : 61 ms
[2025-06-07 22:05:39] [INFO ] Flatten gal took : 59 ms
[2025-06-07 22:05:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17686946438188136187.gal : 8 ms
[2025-06-07 22:05:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7586324018736170484.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/ReachabilityCardinality17686946438188136187.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7586324018736170484.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/ReachabilityCardinality7586324018736170484.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 459
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :459 after 59025
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :59025 after 652352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :652352 after 1.26643e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.26643e+07 after 6.89459e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.89459e+09 after 1.67462e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.67462e+13 after 5.33793e+16
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.33793e+16 after 7.02596e+20
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.02596e+20 after 6.77526e+27
Detected timeout of ITS tools.
[2025-06-07 22:05:54] [INFO ] Flatten gal took : 52 ms
[2025-06-07 22:05:54] [INFO ] Applying decomposition
[2025-06-07 22:05:55] [INFO ] Flatten gal took : 49 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/graph9609129960270195363.txt' '-o' '/tmp/graph9609129960270195363.bin' '-w' '/tmp/graph9609129960270195363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9609129960270195363.bin' '-l' '-1' '-v' '-w' '/tmp/graph9609129960270195363.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:05:55] [INFO ] Decomposing Gal with order
[2025-06-07 22:05:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:05:55] [INFO ] Removed a total of 293 redundant transitions.
[2025-06-07 22:05:55] [INFO ] Flatten gal took : 117 ms
[2025-06-07 22:05:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 156 ms.
[2025-06-07 22:05:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15744141040359368697.gal : 32 ms
[2025-06-07 22:05:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16509970435083036243.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/ReachabilityCardinality15744141040359368697.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16509970435083036243.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/ReachabilityCardinality16509970435083036243.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1281 after 1281
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1281 after 6913
Invariant property ShieldPPPt-PT-050A-ReachabilityCardinality-2025-01 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,6.79301e+79,5.22246,183112,9657,84,372815,454,1307,779469,45,1271,0
Total reachable state count : 6.793006697373571129670016790886125457738e+79

Verifying 1 reachability properties.
Invariant property ShieldPPPt-PT-050A-ReachabilityCardinality-2025-01 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
ShieldPPPt-PT-050A-ReachabilityCardinality-2025-01,6.93521e+75,5.28365,183112,2932,75,372815,454,1362,779469,58,1271,0
Over-approximation ignoring read arcs solved 0 properties in 23790 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 22:06:01] [INFO ] Flatten gal took : 42 ms
[2025-06-07 22:06:01] [INFO ] Applying decomposition
[2025-06-07 22:06:01] [INFO ] Flatten gal took : 42 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/graph9080845414595590214.txt' '-o' '/tmp/graph9080845414595590214.bin' '-w' '/tmp/graph9080845414595590214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9080845414595590214.bin' '-l' '-1' '-v' '-w' '/tmp/graph9080845414595590214.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:06:01] [INFO ] Decomposing Gal with order
[2025-06-07 22:06:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:06:01] [INFO ] Removed a total of 150 redundant transitions.
[2025-06-07 22:06:01] [INFO ] Flatten gal took : 59 ms
[2025-06-07 22:06:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 32 ms.
[2025-06-07 22:06:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10216291285467108360.gal : 13 ms
[2025-06-07 22:06:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7697608966383817942.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/ReachabilityCardinality10216291285467108360.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7697608966383817942.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 ...308
Loading property file /tmp/ReachabilityCardinality7697608966383817942.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 10
Invariant property ShieldPPPt-PT-050A-ReachabilityCardinality-2025-01 does not hold.
FORMULA ShieldPPPt-PT-050A-ReachabilityCardinality-2025-01 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 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.05648e+179,364.085,10103064,1126,31,2.21646e+07,224,1133,6.00921e+07,33,967,0
Total reachable state count : 4.056481920730334084948084961635640397353e+179

Verifying 1 reachability properties.
Invariant property ShieldPPPt-PT-050A-ReachabilityCardinality-2025-01 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
ShieldPPPt-PT-050A-ReachabilityCardinality-2025-01,1.23962e+108,365.017,10103064,363,29,2.21646e+07,224,1029,6.00921e+07,45,967,0
All properties solved without resorting to model-checking.
Total runtime 480429 ms.

BK_STOP 1749334327569

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ShieldPPPt-PT-050A"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 ShieldPPPt-PT-050A, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533600926"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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