Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 12:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 11M Jun 5 20:08 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 MedleyB-PT-B09-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B09-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749402066346

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 17:01: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-08 17:01:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 17:01:08] [INFO ] Load time of PNML (sax parser for PT used): 613 ms
[2025-06-08 17:01:08] [INFO ] Transformed 2435 places.
[2025-06-08 17:01:08] [INFO ] Transformed 15948 transitions.
[2025-06-08 17:01:08] [INFO ] Found NUPN structural information;
[2025-06-08 17:01:08] [INFO ] Parsed PT model containing 2435 places and 15948 transitions and 219484 arcs in 810 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (270 resets) in 2650 ms. (15 steps per ms) remains 11/15 properties
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (38 resets) in 298 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 383 ms. (104 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (35 resets) in 338 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (36 resets) in 529 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 298 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 242 ms. (164 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 256 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (35 resets) in 207 ms. (192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 241 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (35 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
// Phase 1: matrix 15948 rows 2435 cols
[2025-06-08 17:01:10] [INFO ] Computed 9 invariants in 457 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/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-08 17:01:11] [INFO ] Flatten gal took : 2205 ms
At refinement iteration 2 (OVERLAPS) 2333/2416 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2416 variables, 2333/2424 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2416 variables, 0/2424 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 19/2435 variables, 1/2425 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2435 variables, 19/2444 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2435 variables, 0/2444 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-08 17:01:13] [INFO ] Flatten gal took : 1212 ms
[2025-06-08 17:01:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3553007571018576936.gal : 322 ms
[2025-06-08 17:01:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12971531502555969468.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3553007571018576936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12971531502555969468.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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18383/18383 variables, and 4879 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5047 ms.
Refiners :[Domain max(s): 2435/2435 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 2435/2435 constraints, PredecessorRefiner: 11/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2333/2416 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2416 variables, 2333/2424 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality12971531502555969468.prop.
[2025-06-08 17:01:27] [INFO ] Deduced a trap composed of 395 places in 10651 ms of which 4186 ms to minimize.
SMT process timed out in 17070ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 83 out of 2435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2435/2435 places, 15948/15948 transitions.
Graph (trivial) has 2243 edges and 2435 vertex of which 122 / 2435 are part of one of the 20 SCC in 10 ms
Free SCC test removed 102 places
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 4016 edges and 2333 vertex of which 2318 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.68 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1671 transitions
Trivial Post-agglo rules discarded 1671 transitions
Performed 1671 trivial Post agglomeration. Transition count delta: 1671
Iterating post reduction 0 with 1677 rules applied. Total rules applied 1679 place count 2318 transition count 14131
Reduce places removed 1671 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 1711 rules applied. Total rules applied 3390 place count 647 transition count 14091
Reduce places removed 14 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 2 with 75 rules applied. Total rules applied 3465 place count 633 transition count 14030
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 3527 place count 572 transition count 14029
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 3527 place count 572 transition count 13932
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 3721 place count 475 transition count 13932
Discarding 86 places :
Symmetric choice reduction at 4 with 86 rule applications. Total rules 3807 place count 389 transition count 13846
Iterating global reduction 4 with 86 rules applied. Total rules applied 3893 place count 389 transition count 13846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3894 place count 389 transition count 13845
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3894 place count 389 transition count 13843
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3898 place count 387 transition count 13843
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 3932 place count 353 transition count 1836
Iterating global reduction 5 with 34 rules applied. Total rules applied 3966 place count 353 transition count 1836
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3974 place count 353 transition count 1828
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 3979 place count 348 transition count 1823
Iterating global reduction 6 with 5 rules applied. Total rules applied 3984 place count 348 transition count 1823
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 3989 place count 343 transition count 1818
Iterating global reduction 6 with 5 rules applied. Total rules applied 3994 place count 343 transition count 1818
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 3999 place count 343 transition count 1813
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 4069 place count 308 transition count 1778
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4077 place count 300 transition count 1770
Iterating global reduction 7 with 8 rules applied. Total rules applied 4085 place count 300 transition count 1770
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4092 place count 293 transition count 1763
Iterating global reduction 7 with 7 rules applied. Total rules applied 4099 place count 293 transition count 1763
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 4105 place count 287 transition count 1757
Iterating global reduction 7 with 6 rules applied. Total rules applied 4111 place count 287 transition count 1757
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4121 place count 282 transition count 1764
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4122 place count 282 transition count 1763
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 4123 place count 282 transition count 1762
Free-agglomeration rule applied 60 times.
Iterating global reduction 8 with 60 rules applied. Total rules applied 4183 place count 282 transition count 1702
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 8 with 60 rules applied. Total rules applied 4243 place count 222 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 4247 place count 218 transition count 1698
Iterating global reduction 9 with 4 rules applied. Total rules applied 4251 place count 218 transition count 1698
Drop transitions (Redundant composition of simpler transitions.) removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 9 with 256 rules applied. Total rules applied 4507 place count 218 transition count 1442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4509 place count 217 transition count 1447
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 4521 place count 217 transition count 1447
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 4527 place count 217 transition count 1441
Applied a total of 4527 rules in 3872 ms. Remains 217 /2435 variables (removed 2218) and now considering 1441/15948 (removed 14507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3878 ms. Remains : 217/2435 places, 1441/15948 transitions.
RANDOM walk for 40000 steps (911 resets) in 2241 ms. (17 steps per ms) remains 10/11 properties
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (101 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (102 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (101 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (97 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (101 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (102 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (99 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (103 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (100 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (104 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 499384 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 10
Probabilistic random walk after 499384 steps, saw 78698 distinct states, run finished after 3006 ms. (steps per millisecond=166 ) properties seen :0
// Phase 1: matrix 1441 rows 217 cols
[2025-06-08 17:01:35] [INFO ] Computed 7 invariants in 13 ms
[2025-06-08 17:01:35] [INFO ] State equation strengthened by 927 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 130/171 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1398/1570 variables, 172/179 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1570 variables, 523/702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1570 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 67/1637 variables, 28/730 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1637 variables, 402/1132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1637 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 20/1657 variables, 16/1148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1657 variables, 2/1150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1657 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 1/1658 variables, 1/1151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1658 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/1658 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1658/1658 variables, and 1151 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4957 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 217/217 constraints, ReadFeed: 927/927 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 130/171 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:40] [INFO ] Deduced a trap composed of 23 places in 357 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:41] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:41] [INFO ] Deduced a trap composed of 30 places in 304 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:41] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:42] [INFO ] Deduced a trap composed of 28 places in 330 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:42] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:42] [INFO ] Deduced a trap composed of 30 places in 283 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:43] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:43] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:43] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:44] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:44] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:44] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:44] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:45] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:45] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:45] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:45] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:46] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:46] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:46] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:47] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:47] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:47] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:48] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:48] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:48] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:48] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:49] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/172 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1398/1570 variables, 172/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1570 variables, 523/731 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1570 variables, 5/736 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:50] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1570 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:51] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1570 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1570 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 67/1637 variables, 28/766 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1637 variables, 402/1168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1637 variables, 4/1172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:54] [INFO ] Deduced a trap composed of 30 places in 393 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:54] [INFO ] Deduced a trap composed of 36 places in 314 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:55] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1637 variables, 3/1175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1637 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 20/1657 variables, 16/1191 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1657 variables, 2/1193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:58] [INFO ] Deduced a trap composed of 34 places in 342 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:58] [INFO ] Deduced a trap composed of 36 places in 361 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:59] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:01:59] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:00] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 9 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1657 variables, 5/1198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:01] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:02] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:02] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:03] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1657 variables, 4/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1657 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 1/1658 variables, 1/1203 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:05] [INFO ] Deduced a trap composed of 25 places in 403 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:06] [INFO ] Deduced a trap composed of 33 places in 400 ms of which 9 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1658 variables, 2/1205 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1658 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:09] [INFO ] Deduced a trap composed of 35 places in 437 ms of which 18 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/1658 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:10] [INFO ] Deduced a trap composed of 35 places in 343 ms of which 9 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1658 variables, 1/1207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1658 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:13] [INFO ] Deduced a trap composed of 41 places in 357 ms of which 12 ms to minimize.
At refinement iteration 30 (OVERLAPS) 0/1658 variables, 1/1208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1658 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (OVERLAPS) 0/1658 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1658/1658 variables, and 1208 constraints, problems are : Problem set: 0 solved, 10 unsolved in 37460 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 217/217 constraints, ReadFeed: 927/927 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42568ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 2785 ms.
Support contains 41 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 1441/1441 transitions.
Graph (trivial) has 98 edges and 217 vertex of which 6 / 217 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 214 transition count 1402
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 36 rules applied. Total rules applied 70 place count 181 transition count 1399
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 180 transition count 1397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 178 transition count 1397
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 75 place count 178 transition count 1392
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 85 place count 173 transition count 1392
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 90 place count 168 transition count 1387
Iterating global reduction 4 with 5 rules applied. Total rules applied 95 place count 168 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 167 transition count 1386
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 167 transition count 1386
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 121 place count 155 transition count 1374
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 125 place count 155 transition count 1370
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 134 place count 146 transition count 1170
Iterating global reduction 5 with 9 rules applied. Total rules applied 143 place count 146 transition count 1170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 147 place count 146 transition count 1166
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 150 place count 143 transition count 1163
Iterating global reduction 6 with 3 rules applied. Total rules applied 153 place count 143 transition count 1163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 155 place count 143 transition count 1161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 157 place count 142 transition count 1167
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 164 place count 142 transition count 1160
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 178 place count 142 transition count 1146
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 193 place count 128 transition count 1145
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 196 place count 128 transition count 1142
Applied a total of 196 rules in 492 ms. Remains 128 /217 variables (removed 89) and now considering 1142/1441 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 128/217 places, 1142/1441 transitions.
RANDOM walk for 40000 steps (1253 resets) in 639 ms. (62 steps per ms) remains 7/10 properties
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (156 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (167 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (161 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (163 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (170 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (169 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (166 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
// Phase 1: matrix 1142 rows 128 cols
[2025-06-08 17:02:21] [INFO ] Computed 7 invariants in 4 ms
[2025-06-08 17:02:21] [INFO ] State equation strengthened by 979 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 66/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1121/1223 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1223 variables, 578/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1223 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 41/1264 variables, 21/708 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1264 variables, 400/1108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1264 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 6/1270 variables, 5/1113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1270 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1270 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1270 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1270/1270 variables, and 1114 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2814 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 979/979 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 66/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:24] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:25] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:25] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:25] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:25] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:25] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:26] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:26] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:26] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:26] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:26] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/102 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:27] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1121/1223 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1223 variables, 578/699 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1223 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1223 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 41/1264 variables, 21/722 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 400/1122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 4/1126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:29] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:29] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1264 variables, 2/1128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1264 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 6/1270 variables, 5/1133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1270 variables, 1/1134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:32] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:32] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:32] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:33] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1270 variables, 4/1138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1270 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:34] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 9 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/1270 variables, 1/1139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:35] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:35] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 7 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1270 variables, 2/1141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1270 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 0/1270 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1270/1270 variables, and 1141 constraints, problems are : Problem set: 0 solved, 7 unsolved in 13607 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 979/979 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16494ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1968 ms.
Support contains 33 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1142/1142 transitions.
Graph (trivial) has 24 edges and 128 vertex of which 2 / 128 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 127 transition count 1135
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 122 transition count 1133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 120 transition count 1133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 120 transition count 1132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 119 transition count 1132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 27 place count 114 transition count 1127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 114 transition count 1124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 33 place count 111 transition count 1121
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 111 transition count 1121
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 4 with 128 rules applied. Total rules applied 164 place count 111 transition count 993
Applied a total of 164 rules in 219 ms. Remains 111 /128 variables (removed 17) and now considering 993/1142 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 111/128 places, 993/1142 transitions.
RANDOM walk for 40000 steps (1284 resets) in 353 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (161 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (163 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (163 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (172 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (166 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (167 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 587050 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 6
Probabilistic random walk after 587050 steps, saw 96045 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
// Phase 1: matrix 993 rows 111 cols
[2025-06-08 17:02:43] [INFO ] Computed 7 invariants in 4 ms
[2025-06-08 17:02:43] [INFO ] State equation strengthened by 862 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 53/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 974/1061 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 462/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 37/1098 variables, 19/575 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1098 variables, 399/974 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1098 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 6/1104 variables, 5/979 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1104 variables, 1/980 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1104 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1104 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 980 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1810 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 111/111 constraints, ReadFeed: 862/862 constraints, PredecessorRefiner: 6/5 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 53/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:45] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:45] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:46] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:46] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:46] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:46] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:46] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:46] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:47] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:47] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:47] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 974/1061 variables, 87/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1061 variables, 462/567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1061 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:02:48] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1061 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1061 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 37/1098 variables, 19/589 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1098 variables, 399/988 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1098 variables, 3/991 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 5/996 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 1/997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 997 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5416 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 111/111 constraints, ReadFeed: 862/862 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7308ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 538 ms.
Support contains 33 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 993/993 transitions.
Applied a total of 0 rules in 83 ms. Remains 111 /111 variables (removed 0) and now considering 993/993 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 111/111 places, 993/993 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 993/993 transitions.
Applied a total of 0 rules in 84 ms. Remains 111 /111 variables (removed 0) and now considering 993/993 (removed 0) transitions.
[2025-06-08 17:02:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 17:02:51] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-08 17:02:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 17:02:52] [INFO ] State equation strengthened by 862 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :11 after 19
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :19 after 25
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :25 after 44
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :44 after 348
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :348 after 6824
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :6824 after 460177
[2025-06-08 17:02:56] [INFO ] Implicit Places using invariants and state equation in 4612 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4788 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 110/111 places, 993/993 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 110 transition count 985
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 102 transition count 983
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 100 transition count 983
Performed 22 Post agglomeration using F-continuation condition with reduction of 603 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 64 place count 78 transition count 358
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 3 with 168 rules applied. Total rules applied 232 place count 78 transition count 190
Renaming transitions due to excessive name length > 1024 char.
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 233 place count 77 transition count 158
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 77 transition count 158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 240 place count 74 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 73 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 280 place count 73 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 284 place count 71 transition count 133
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 289 place count 71 transition count 128
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 294 place count 66 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 296 place count 66 transition count 126
Applied a total of 296 rules in 59 ms. Remains 66 /110 variables (removed 44) and now considering 126/993 (removed 867) transitions.
// Phase 1: matrix 126 rows 66 cols
[2025-06-08 17:02:56] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 17:02:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-08 17:02:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 17:02:56] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-08 17:02:56] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/111 places, 126/993 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5081 ms. Remains : 66/111 places, 126/993 transitions.
RANDOM walk for 40000 steps (2223 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (378 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (395 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (375 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (430 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (410 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (402 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 495923 steps, run visited all 6 properties in 1080 ms. (steps per millisecond=459 )
Probabilistic random walk after 495923 steps, saw 75436 distinct states, run finished after 1086 ms. (steps per millisecond=456 ) properties seen :6
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B09-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 110380 ms.

BK_STOP 1749402178004

--------------------
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="MedleyB-PT-B09"
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 MedleyB-PT-B09, 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 r254-tall-174931340000494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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