Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100166.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 MedleyA-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K 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 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 99K May 29 14:32 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 MedleyA-PT-09-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyA-PT-09-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748855753357

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 09:15:55] [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-02 09:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:15:56] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-06-02 09:15:56] [INFO ] Transformed 147 places.
[2025-06-02 09:15:56] [INFO ] Transformed 315 transitions.
[2025-06-02 09:15:56] [INFO ] Found NUPN structural information;
[2025-06-02 09:15:56] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1322 resets) in 2205 ms. (18 steps per ms) remains 9/14 properties
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (318 resets) in 1234 ms. (32 steps per ms) remains 9/9 properties
[2025-06-02 09:15:57] [INFO ] Flatten gal took : 361 ms
BEST_FIRST walk for 40003 steps (302 resets) in 545 ms. (73 steps per ms) remains 9/9 properties
[2025-06-02 09:15:58] [INFO ] Flatten gal took : 234 ms
BEST_FIRST walk for 40004 steps (296 resets) in 546 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (303 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (292 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
[2025-06-02 09:15:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7586457676084280173.gal : 81 ms
BEST_FIRST walk for 40003 steps (297 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (274 resets) in 358 ms. (111 steps per ms) remains 9/9 properties
[2025-06-02 09:15:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9387078221978829890.prop : 8 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/ReachabilityCardinality7586457676084280173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9387078221978829890.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 ...328
Loading property file /tmp/ReachabilityCardinality9387078221978829890.prop.
BEST_FIRST walk for 40004 steps (288 resets) in 360 ms. (110 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 21
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :21 after 104
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :104 after 240
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :240 after 6428
Invariant property MedleyA-PT-09-ReachabilityCardinality-2025-05 does not hold.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :6428 after 6950
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :6950 after 7642
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :7642 after 17137
BEST_FIRST walk for 40002 steps (311 resets) in 760 ms. (52 steps per ms) remains 9/9 properties
// Phase 1: matrix 313 rows 145 cols
[2025-06-02 09:15:58] [INFO ] Computed 12 invariants in 26 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/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MedleyA-PT-09-ReachabilityCardinality-2025-10 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 42/119 variables, 7/84 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 42/126 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 26/145 variables, 5/131 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 26/157 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Invariant property MedleyA-PT-09-ReachabilityCardinality-2025-08 does not hold.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property MedleyA-PT-09-ReachabilityCardinality-2025-04 is true.
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :17137 after 94600
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 313/458 variables, 145/302 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/458 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 302 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1308 ms.
Refiners :[Domain max(s): 145/145 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 43/117 variables, 7/81 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 43/124 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:00] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/125 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem MedleyA-PT-09-ReachabilityCardinality-2025-02 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 28/145 variables, 5/130 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 28/158 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:01] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :94600 after 193534
[2025-06-02 09:16:01] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:01] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 19 ms to minimize.
Problem MedleyA-PT-09-ReachabilityCardinality-2025-06 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:01] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:02] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:02] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:02] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:02] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:02] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 8 ms to minimize.
Problem MedleyA-PT-09-ReachabilityCardinality-2025-14 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 9/167 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/167 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 313/458 variables, 145/312 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/314 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:03] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:03] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 2/316 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:03] [INFO ] Deduced a trap along path composed of 3 places in 111 ms of which 16 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 1/317 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:04] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 17 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 1/318 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/318 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/318 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 318 constraints, problems are : Problem set: 6 solved, 2 unsolved in 4819 ms.
Refiners :[Domain max(s): 145/145 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6325ms problems are : Problem set: 6 solved, 2 unsolved
Parikh walk visited 0 properties in 684 ms.
Support contains 24 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 313/313 transitions.
Graph (complete) has 480 edges and 145 vertex of which 141 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 141 transition count 295
Reduce places removed 16 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 18 rules applied. Total rules applied 35 place count 125 transition count 293
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 40 place count 124 transition count 289
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 43 place count 121 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 43 place count 121 transition count 288
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 120 transition count 288
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 70 place count 95 transition count 260
Iterating global reduction 4 with 25 rules applied. Total rules applied 95 place count 95 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 95 place count 95 transition count 259
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 94 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 93 transition count 257
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 93 transition count 257
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 133 place count 76 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 134 place count 76 transition count 238
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 142 place count 72 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 151 place count 72 transition count 235
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 5 with 2 rules applied. Total rules applied 153 place count 71 transition count 234
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 155 place count 71 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 157 place count 69 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 69 transition count 230
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 161 place count 69 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 163 place count 67 transition count 228
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 164 place count 67 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 165 place count 66 transition count 227
Applied a total of 165 rules in 286 ms. Remains 66 /145 variables (removed 79) and now considering 227/313 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 66/145 places, 227/313 transitions.
RANDOM walk for 40000 steps (3664 resets) in 537 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (668 resets) in 152 ms. (261 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 09:16:06] [INFO ] Flow matrix only has 192 transitions (discarded 35 similar events)
// Phase 1: matrix 192 rows 66 cols
[2025-06-02 09:16:06] [INFO ] Computed 10 invariants in 3 ms
[2025-06-02 09:16:06] [INFO ] State equation strengthened by 55 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/54 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 181/235 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 47/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:06] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:06] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/258 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/258 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/54 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 181/235 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/258 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:06] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/258 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 227/227 transitions.
Graph (complete) has 253 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 64 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 64 transition count 223
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 62 transition count 223
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 9 place count 61 transition count 222
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 61 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 60 transition count 221
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 60 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 59 transition count 220
Applied a total of 13 rules in 42 ms. Remains 59 /66 variables (removed 7) and now considering 220/227 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 59/66 places, 220/227 transitions.
RANDOM walk for 40000 steps (4120 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (763 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :193534 after 1.05359e+06
Interrupted probabilistic random walk after 1308558 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 1308558 steps, saw 258579 distinct states, run finished after 3009 ms. (steps per millisecond=434 ) properties seen :0
[2025-06-02 09:16:10] [INFO ] Flow matrix only has 185 transitions (discarded 35 similar events)
// Phase 1: matrix 185 rows 59 cols
[2025-06-02 09:16:10] [INFO ] Computed 10 invariants in 6 ms
[2025-06-02 09:16:10] [INFO ] State equation strengthened by 55 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/49 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 176/225 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/244 variables, 10/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/244 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 55/55 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/49 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 176/225 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/244 variables, 10/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:10] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 5 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/244 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/244 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 16 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 220/220 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 59/59 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 220/220 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-06-02 09:16:10] [INFO ] Flow matrix only has 185 transitions (discarded 35 similar events)
[2025-06-02 09:16:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:11] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 09:16:11] [INFO ] Flow matrix only has 185 transitions (discarded 35 similar events)
[2025-06-02 09:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:11] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-02 09:16:11] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:16:11] [INFO ] Redundant transitions in 12 ms returned []
Running 215 sub problems to find dead transitions.
[2025-06-02 09:16:11] [INFO ] Flow matrix only has 185 transitions (discarded 35 similar events)
[2025-06-02 09:16:11] [INFO ] Invariant cache hit.
[2025-06-02 09:16:11] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/58 variables, 4/6 constraints. Problems are: Problem set: 32 solved, 183 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 4/10 constraints. Problems are: Problem set: 63 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:14] [INFO ] Deduced a trap composed of 11 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-02 09:16:14] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:14] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 3/13 constraints. Problems are: Problem set: 63 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:15] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 185/243 variables, 58/72 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 55/127 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/127 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 10 (OVERLAPS) 1/244 variables, 1/128 constraints. Problems are: Problem set: 63 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:20] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/129 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/129 constraints. Problems are: Problem set: 63 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:16:25] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/244 variables, 1/130 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/130 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 0/244 variables, 0/130 constraints. Problems are: Problem set: 63 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 130 constraints, problems are : Problem set: 63 solved, 152 unsolved in 20453 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 63 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 3/5 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 4/9 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 4/13 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 185/243 variables, 58/72 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 55/127 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 152/279 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/280 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/280 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 1/244 variables, 1/281 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 1/282 constraints. Problems are: Problem set: 63 solved, 152 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.05359e+06 after 3.79246e+06
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/282 constraints. Problems are: Problem set: 63 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 0/244 variables, 0/282 constraints. Problems are: Problem set: 63 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 282 constraints, problems are : Problem set: 63 solved, 152 unsolved in 21547 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 152/215 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42289ms problems are : Problem set: 63 solved, 152 unsolved
Search for dead transitions found 63 dead transitions in 42298ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/59 places, 157/220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 157
Applied a total of 1 rules in 7 ms. Remains 58 /59 variables (removed 1) and now considering 157/157 (removed 0) transitions.
// Phase 1: matrix 157 rows 58 cols
[2025-06-02 09:16:53] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:53] [INFO ] Implicit Places using invariants in 101 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 57/59 places, 157/220 transitions.
Applied a total of 0 rules in 8 ms. Remains 57 /57 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 42766 ms. Remains : 57/59 places, 157/220 transitions.
RANDOM walk for 40000 steps (4091 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (766 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Probably explored full state space saw : 303500 states, properties seen :0
Probabilistic random walk after 1668360 steps, saw 303500 distinct states, run finished after 2861 ms. (steps per millisecond=583 ) properties seen :0
Explored full state space saw : 303500 states, properties seen :0
Exhaustive walk after 1668360 steps, saw 303500 distinct states, run finished after 2469 ms. (steps per millisecond=675 ) properties seen :0
FORMULA MedleyA-PT-09-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 63140 ms.

BK_STOP 1748855819181

--------------------
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="MedleyA-PT-09"
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 MedleyA-PT-09, 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 r128-smll-174876524100166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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