Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729200391.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 ASLink-PT-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729200391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748599336862

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 10:02:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 10:02:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:02:18] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2025-05-30 10:02:18] [INFO ] Transformed 3222 places.
[2025-05-30 10:02:18] [INFO ] Transformed 3986 transitions.
[2025-05-30 10:02:18] [INFO ] Found NUPN structural information;
[2025-05-30 10:02:18] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (64 resets) in 1775 ms. (22 steps per ms) remains 13/16 properties
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
[2025-05-30 10:02:19] [INFO ] Flatten gal took : 550 ms
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 513 ms. (77 steps per ms) remains 13/13 properties
[2025-05-30 10:02:19] [INFO ] Flatten gal took : 214 ms
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 13/13 properties
[2025-05-30 10:02:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12444027643945668036.gal : 83 ms
[2025-05-30 10:02:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2890330283228302424.prop : 9 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/ReachabilityCardinality12444027643945668036.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2890330283228302424.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 3986 rows 3222 cols

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
[2025-05-30 10:02:30] [INFO ] Computed 316 invariants in 174 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality2890330283228302424.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 248/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 543/791 variables, 43/291 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/791 variables, 543/834 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/791 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 209/1000 variables, 32/866 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 209/1075 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 2197/3197 variables, 231/1306 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3197 variables, 2197/3503 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3197/7208 variables, and 3503 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5032 ms.
Refiners :[Domain max(s): 3197/3222 constraints, Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 231/241 constraints, State Equation: 0/3222 constraints, PredecessorRefiner: 13/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 248/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 543/791 variables, 43/291 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/791 variables, 543/834 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/791 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 209/1000 variables, 32/866 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 209/1075 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :13 after 19
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :19 after 291
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :291 after 391
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :391 after 804
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :804 after 26845
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :26845 after 110041
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :110041 after 909862
At refinement iteration 8 (OVERLAPS) 2197/3197 variables, 231/1306 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :909862 after 1.46003e+11
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.91046e+11
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :5.91046e+11 after 2.23156e+20
At refinement iteration 9 (INCLUDED_ONLY) 0/3197 variables, 2197/3503 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3197/7208 variables, and 3503 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5008 ms.
Refiners :[Domain max(s): 3197/3222 constraints, Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 231/241 constraints, State Equation: 0/3222 constraints, PredecessorRefiner: 3/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10415ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 248 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 3222 transition count 3393
Reduce places removed 593 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 620 rules applied. Total rules applied 1213 place count 2629 transition count 3366
Reduce places removed 7 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 2 with 50 rules applied. Total rules applied 1263 place count 2622 transition count 3323
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 47 rules applied. Total rules applied 1310 place count 2579 transition count 3319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1311 place count 2578 transition count 3319
Performed 684 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 684 Pre rules applied. Total rules applied 1311 place count 2578 transition count 2635
Deduced a syphon composed of 684 places in 8 ms
Ensure Unique test removed 50 places
Reduce places removed 734 places and 0 transitions.
Iterating global reduction 5 with 1418 rules applied. Total rules applied 2729 place count 1844 transition count 2635
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 5 with 42 rules applied. Total rules applied 2771 place count 1833 transition count 2604
Reduce places removed 31 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 6 with 42 rules applied. Total rules applied 2813 place count 1802 transition count 2593
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 2824 place count 1791 transition count 2593
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 2824 place count 1791 transition count 2583
Deduced a syphon composed of 10 places in 16 ms
Ensure Unique test removed 8 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 2852 place count 1773 transition count 2583
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 2853 place count 1772 transition count 2583
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 7 Pre rules applied. Total rules applied 2853 place count 1772 transition count 2576
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 2867 place count 1765 transition count 2576
Discarding 93 places :
Symmetric choice reduction at 9 with 93 rule applications. Total rules 2960 place count 1672 transition count 2483
Iterating global reduction 9 with 93 rules applied. Total rules applied 3053 place count 1672 transition count 2483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3054 place count 1672 transition count 2482
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 22 Pre rules applied. Total rules applied 3054 place count 1672 transition count 2460
Deduced a syphon composed of 22 places in 17 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 10 with 45 rules applied. Total rules applied 3099 place count 1649 transition count 2460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 3099 place count 1649 transition count 2459
Deduced a syphon composed of 1 places in 17 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 3102 place count 1647 transition count 2459
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 3105 place count 1644 transition count 2441
Iterating global reduction 10 with 3 rules applied. Total rules applied 3108 place count 1644 transition count 2441
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 3108 place count 1644 transition count 2438
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3114 place count 1641 transition count 2438
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 13 ms
Ensure Unique test removed 9 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 10 with 391 rules applied. Total rules applied 3505 place count 1441 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3506 place count 1440 transition count 2246
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 3508 place count 1439 transition count 2246
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3510 place count 1438 transition count 2245
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3512 place count 1437 transition count 2254
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3513 place count 1437 transition count 2253
Free-agglomeration rule applied 15 times.
Iterating global reduction 10 with 15 rules applied. Total rules applied 3528 place count 1437 transition count 2238
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 3543 place count 1422 transition count 2238
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 3552 place count 1422 transition count 2229
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3561 place count 1413 transition count 2229
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3562 place count 1413 transition count 2229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3563 place count 1412 transition count 2228
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 9 rules applied. Total rules applied 3572 place count 1405 transition count 2226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 3574 place count 1403 transition count 2226
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 11 Pre rules applied. Total rules applied 3574 place count 1403 transition count 2215
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 14 with 22 rules applied. Total rules applied 3596 place count 1392 transition count 2215
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 14 with 4 rules applied. Total rules applied 3600 place count 1388 transition count 2215
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 16 rules applied. Total rules applied 3616 place count 1380 transition count 2207
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 3619 place count 1377 transition count 2204
Iterating global reduction 15 with 3 rules applied. Total rules applied 3622 place count 1377 transition count 2204
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 3623 place count 1376 transition count 2203
Iterating global reduction 15 with 1 rules applied. Total rules applied 3624 place count 1376 transition count 2203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 3625 place count 1376 transition count 2202
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 3626 place count 1376 transition count 2201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 3627 place count 1375 transition count 2201
Applied a total of 3627 rules in 1948 ms. Remains 1375 /3222 variables (removed 1847) and now considering 2201/3986 (removed 1785) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1955 ms. Remains : 1375/3222 places, 2201/3986 transitions.
RANDOM walk for 40000 steps (214 resets) in 519 ms. (76 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (29 resets) in 337 ms. (118 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (31 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (30 resets) in 243 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (29 resets) in 223 ms. (178 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (28 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 305 ms. (130 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (29 resets) in 210 ms. (189 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (27 resets) in 226 ms. (176 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (26 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (30 resets) in 288 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 359 ms. (111 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :2.23156e+20 after 5.42075e+34
Interrupted probabilistic random walk after 107876 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 13
Probabilistic random walk after 107876 steps, saw 63281 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 2201 rows 1375 cols
[2025-05-30 10:02:47] [INFO ] Computed 223 invariants in 47 ms
[2025-05-30 10:02:47] [INFO ] State equation strengthened by 4 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/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 299/547 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 36/583 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 785/1368 variables, 166/217 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1368 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 3/1371 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1371 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 4/1375 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1375 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2201/3576 variables, 1375/1598 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3576 variables, 4/1602 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3576 variables, 0/1602 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/3576 variables, 0/1602 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3576/3576 variables, and 1602 constraints, problems are : Problem set: 0 solved, 13 unsolved in 12535 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 169/169 constraints, State Equation: 1375/1375 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 13/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 299/547 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 36/583 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 785/1368 variables, 166/217 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:01] [INFO ] Deduced a trap composed of 22 places in 558 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:01] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:01] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:02] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:02] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:02] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:02] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:03] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:03] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:03] [INFO ] Deduced a trap composed of 22 places in 386 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:04] [INFO ] Deduced a trap composed of 24 places in 427 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:05] [INFO ] Deduced a trap composed of 27 places in 542 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:05] [INFO ] Deduced a trap composed of 64 places in 477 ms of which 90 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1368 variables, 13/230 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:07] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 35 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1368 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1368 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 3/1371 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1371 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 4/1375 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1375 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ASLink-PT-07b-ReachabilityFireability-2025-02 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2025-03 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2025-07 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2025-08 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2025-12 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2025-14 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 2201/3576 variables, 1375/1612 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3576 variables, 4/1616 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3576 variables, 5/1621 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3576/3576 variables, and 1621 constraints, problems are : Problem set: 6 solved, 7 unsolved in 45026 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 169/169 constraints, State Equation: 1375/1375 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57682ms problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 183 out of 1375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1375/1375 places, 2201/2201 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1375 transition count 2192
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 1366 transition count 2191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 1365 transition count 2191
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 20 place count 1365 transition count 2162
Deduced a syphon composed of 29 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 82 place count 1332 transition count 2162
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 1332 transition count 2161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 1331 transition count 2161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 84 place count 1331 transition count 2158
Deduced a syphon composed of 3 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 91 place count 1327 transition count 2158
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1326 transition count 2158
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 94 place count 1324 transition count 2156
Iterating global reduction 6 with 2 rules applied. Total rules applied 96 place count 1324 transition count 2156
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 97 place count 1323 transition count 2155
Iterating global reduction 6 with 1 rules applied. Total rules applied 98 place count 1323 transition count 2155
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 99 place count 1322 transition count 2154
Iterating global reduction 6 with 1 rules applied. Total rules applied 100 place count 1322 transition count 2154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 101 place count 1322 transition count 2153
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 121 place count 1312 transition count 2143
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 122 place count 1311 transition count 2142
Iterating global reduction 7 with 1 rules applied. Total rules applied 123 place count 1311 transition count 2142
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 124 place count 1311 transition count 2141
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 127 place count 1308 transition count 2138
Applied a total of 127 rules in 413 ms. Remains 1308 /1375 variables (removed 67) and now considering 2138/2201 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 1308/1375 places, 2138/2201 transitions.
RANDOM walk for 40000 steps (245 resets) in 581 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 304 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (34 resets) in 135 ms. (294 steps per ms) remains 6/7 properties
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (38 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (31 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 380 ms. (104 steps per ms) remains 6/6 properties
// Phase 1: matrix 2138 rows 1308 cols
[2025-05-30 10:03:45] [INFO ] Computed 217 invariants in 37 ms
[2025-05-30 10:03:45] [INFO ] State equation strengthened by 5 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/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 295/475 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 38/513 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 778/1291 variables, 158/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1291 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/1295 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1295 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 13/1308 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1308 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2138/3446 variables, 1308/1525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3446 variables, 5/1530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3446 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/3446 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3446/3446 variables, and 1530 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5750 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 163/163 constraints, State Equation: 1308/1308 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 295/475 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 38/513 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 778/1291 variables, 158/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:52] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:52] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:53] [INFO ] Deduced a trap composed of 22 places in 424 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:53] [INFO ] Deduced a trap composed of 5 places in 410 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:54] [INFO ] Deduced a trap composed of 23 places in 463 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:54] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:55] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 55 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1291 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1291 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 4/1295 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:56] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:57] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 27 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:03:58] [INFO ] Deduced a trap composed of 27 places in 491 ms of which 60 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1295 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 13/1308 variables, 5/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1308 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2138/3446 variables, 1308/1535 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3446 variables, 5/1540 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3446 variables, 4/1544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3446 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/3446 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3446/3446 variables, and 1544 constraints, problems are : Problem set: 0 solved, 6 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 163/163 constraints, State Equation: 1308/1308 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35955ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 46634 ms.
Support contains 165 out of 1308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1308/1308 places, 2138/2138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1308 transition count 2136
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 1306 transition count 2133
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 1303 transition count 2133
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 10 place count 1303 transition count 2124
Deduced a syphon composed of 9 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 30 place count 1292 transition count 2124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 1292 transition count 2123
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 1290 transition count 2123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 1289 transition count 2122
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 1289 transition count 2122
Applied a total of 35 rules in 96 ms. Remains 1289 /1308 variables (removed 19) and now considering 2122/2138 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 1289/1308 places, 2122/2138 transitions.
RANDOM walk for 40000 steps (259 resets) in 369 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 276 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (38 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (38 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (35 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (34 resets) in 322 ms. (123 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 145378 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 5
Probabilistic random walk after 145378 steps, saw 68052 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 2122 rows 1289 cols
[2025-05-30 10:05:12] [INFO ] Computed 214 invariants in 28 ms
[2025-05-30 10:05:12] [INFO ] State equation strengthened by 5 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/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 269/434 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 32/466 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 803/1269 variables, 157/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1269 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6/1275 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1275 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 14/1289 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1289 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2122/3411 variables, 1289/1503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3411 variables, 5/1508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3411 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/3411 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3411/3411 variables, and 1508 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3853 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 162/162 constraints, State Equation: 1289/1289 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 269/434 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 32/466 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 803/1269 variables, 157/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:16] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:16] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:17] [INFO ] Deduced a trap composed of 24 places in 345 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:17] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:17] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1269 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:18] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1269 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:19] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 59 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1269 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1269 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/1275 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1275 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 14/1289 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1289 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2122/3411 variables, 1289/1510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3411 variables, 5/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3411 variables, 3/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3411 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/3411 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3411/3411 variables, and 1518 constraints, problems are : Problem set: 0 solved, 5 unsolved in 11732 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 162/162 constraints, State Equation: 1289/1289 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15638ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4360 ms.
Support contains 165 out of 1289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1289/1289 places, 2122/2122 transitions.
Applied a total of 0 rules in 37 ms. Remains 1289 /1289 variables (removed 0) and now considering 2122/2122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1289/1289 places, 2122/2122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1289/1289 places, 2122/2122 transitions.
Applied a total of 0 rules in 36 ms. Remains 1289 /1289 variables (removed 0) and now considering 2122/2122 (removed 0) transitions.
[2025-05-30 10:05:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:05:33] [INFO ] Implicit Places using invariants in 954 ms returned [1, 24, 28, 40, 60, 79, 127, 141, 177, 190, 193, 194, 217, 237, 311, 332, 348, 349, 355, 356, 378, 397, 422, 471, 472, 483, 484, 493, 495, 506, 507, 508, 532, 575, 597, 598, 632, 639, 654, 676, 695, 717, 736, 754, 773, 778, 779, 792, 795, 814, 833, 876, 896, 909, 920, 927, 945, 946, 949, 973, 991, 1033, 1050, 1064, 1082, 1087, 1090, 1103, 1149, 1154, 1172, 1173, 1174, 1175, 1193, 1199, 1205, 1211, 1217, 1223, 1229, 1235, 1241, 1247, 1253]
[2025-05-30 10:05:33] [INFO ] Actually due to overlaps returned [40, 60, 217, 378, 532, 676, 814, 973, 1154, 795, 949, 193, 355, 507, 945, 1172, 194, 356, 508, 654, 792, 946, 1103, 1149, 1173, 1, 332, 493, 639, 778, 779, 927, 1087, 24, 79, 190, 237, 348, 506, 833, 991, 1174, 1241, 1253, 28, 177, 349, 397, 422, 495, 575, 632, 695, 717, 773, 1090, 1175, 1193, 1199, 1205, 1211, 1217, 1223, 1229, 1235, 1247]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 969 ms to find 66 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1223/1289 places, 2122/2122 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 1213 transition count 2056
Reduce places removed 66 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 85 rules applied. Total rules applied 161 place count 1147 transition count 2037
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 180 place count 1128 transition count 2037
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 180 place count 1128 transition count 2009
Deduced a syphon composed of 28 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 237 place count 1099 transition count 2009
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 1098 transition count 2009
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 250 place count 1086 transition count 1997
Iterating global reduction 4 with 12 rules applied. Total rules applied 262 place count 1086 transition count 1997
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 262 place count 1086 transition count 1996
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 1085 transition count 1996
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 266 place count 1083 transition count 1994
Iterating global reduction 4 with 2 rules applied. Total rules applied 268 place count 1083 transition count 1994
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 269 place count 1082 transition count 1992
Iterating global reduction 4 with 1 rules applied. Total rules applied 270 place count 1082 transition count 1992
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 370 place count 1032 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 373 place count 1029 transition count 1937
Iterating global reduction 4 with 3 rules applied. Total rules applied 376 place count 1029 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 377 place count 1029 transition count 1936
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 380 place count 1029 transition count 1933
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 383 place count 1026 transition count 1933
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 398 place count 1026 transition count 1918
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 413 place count 1011 transition count 1918
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 414 place count 1011 transition count 1917
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 432 place count 1011 transition count 1917
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 436 place count 1011 transition count 1917
Applied a total of 436 rules in 388 ms. Remains 1011 /1223 variables (removed 212) and now considering 1917/2122 (removed 205) transitions.
// Phase 1: matrix 1917 rows 1011 cols
[2025-05-30 10:05:33] [INFO ] Computed 136 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:05:34] [INFO ] Implicit Places using invariants in 595 ms returned [131, 136, 143, 144, 231, 238, 241, 244, 259, 366, 375, 376, 379, 384, 385, 489, 490, 511, 524, 525, 625, 725, 736, 743, 824, 858, 991, 995, 999, 1003, 1007]
[2025-05-30 10:05:34] [INFO ] Actually due to overlaps returned [143, 524, 144, 525, 231, 238, 244, 366, 375, 384, 725, 131, 136, 259, 489, 511, 625, 736, 743, 824, 858, 991, 995, 999, 1003, 1007]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 598 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 985/1289 places, 1917/2122 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 984 transition count 1916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 983 transition count 1916
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 973 transition count 1906
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 973 transition count 1906
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 969 transition count 1899
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 969 transition count 1899
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 966 transition count 1896
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 966 transition count 1896
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 966 transition count 1893
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 962 transition count 1889
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 962 transition count 1888
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 962 transition count 1886
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 960 transition count 1886
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 960 transition count 1885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 959 transition count 1885
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 56 place count 959 transition count 1885
Applied a total of 56 rules in 218 ms. Remains 959 /985 variables (removed 26) and now considering 1885/1917 (removed 32) transitions.
// Phase 1: matrix 1885 rows 959 cols
[2025-05-30 10:05:34] [INFO ] Computed 109 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:05:34] [INFO ] Implicit Places using invariants in 512 ms returned [228, 357, 360, 365]
[2025-05-30 10:05:34] [INFO ] Actually due to overlaps returned [357, 365, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 514 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 956/1289 places, 1885/2122 transitions.
Applied a total of 0 rules in 24 ms. Remains 956 /956 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2748 ms. Remains : 956/1289 places, 1885/2122 transitions.
RANDOM walk for 40000 steps (296 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (45 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (46 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (43 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (41 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (42 resets) in 320 ms. (124 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 131817 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 5
Probabilistic random walk after 131817 steps, saw 74968 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 1885 rows 956 cols
[2025-05-30 10:05:38] [INFO ] Computed 106 invariants in 14 ms
[2025-05-30 10:05:38] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 104/269 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 683/952 variables, 83/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/953 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/956 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/956 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1885/2841 variables, 956/1062 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2841 variables, 4/1066 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2841 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2841 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2841/2841 variables, and 1066 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2860 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 956/956 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 104/269 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:41] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 683/952 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:41] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:41] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:42] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:42] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:42] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:42] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/952 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:43] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:43] [INFO ] Deduced a trap composed of 27 places in 382 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:44] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:44] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:44] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:44] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/953 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/956 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/956 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1885/2841 variables, 956/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2841 variables, 4/1079 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2841 variables, 3/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:51] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:52] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:52] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:52] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:53] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:53] [INFO ] Deduced a trap composed of 81 places in 303 ms of which 62 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2841 variables, 6/1088 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2841 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:05:58] [INFO ] Deduced a trap composed of 81 places in 310 ms of which 64 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/2841 variables, 1/1089 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2841 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/2841 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2841/2841 variables, and 1089 constraints, problems are : Problem set: 0 solved, 5 unsolved in 27352 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 956/956 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30260ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2879 ms.
Support contains 165 out of 956 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 956/956 places, 1885/1885 transitions.
Applied a total of 0 rules in 23 ms. Remains 956 /956 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 956/956 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 956/956 places, 1885/1885 transitions.
Applied a total of 0 rules in 23 ms. Remains 956 /956 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-05-30 10:06:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:06:11] [INFO ] Implicit Places using invariants in 518 ms returned [358]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 520 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 955/956 places, 1885/1885 transitions.
Applied a total of 0 rules in 31 ms. Remains 955 /955 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 575 ms. Remains : 955/956 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (294 resets) in 231 ms. (172 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (43 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (45 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (44 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (40 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (43 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 134512 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 5
Probabilistic random walk after 134512 steps, saw 89212 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 1885 rows 955 cols
[2025-05-30 10:06:15] [INFO ] Computed 105 invariants in 14 ms
[2025-05-30 10:06:15] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 112/277 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 672/949 variables, 79/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/950 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/955 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1885/2840 variables, 955/1060 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2840 variables, 4/1064 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2840 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2840 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2840/2840 variables, and 1064 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2862 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 955/955 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 112/277 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 672/949 variables, 79/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:18] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:18] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:18] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:19] [INFO ] Deduced a trap composed of 24 places in 353 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:19] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:20] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:20] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:20] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:20] [INFO ] Deduced a trap composed of 27 places in 365 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:21] [INFO ] Deduced a trap composed of 87 places in 421 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:21] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:22] [INFO ] Deduced a trap composed of 87 places in 462 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:22] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/949 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/950 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 5/955 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:24] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:06:24] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/955 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/955 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1885/2840 variables, 955/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2840 variables, 4/1079 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2840 variables, 3/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2840 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2840 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2840/2840 variables, and 1082 constraints, problems are : Problem set: 0 solved, 5 unsolved in 17715 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 955/955 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20612ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9826 ms.
Support contains 165 out of 955 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 955/955 places, 1885/1885 transitions.
Applied a total of 0 rules in 23 ms. Remains 955 /955 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 955/955 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 955/955 places, 1885/1885 transitions.
Applied a total of 0 rules in 23 ms. Remains 955 /955 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2025-05-30 10:06:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:06:46] [INFO ] Implicit Places using invariants in 489 ms returned []
[2025-05-30 10:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:06:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:06:49] [INFO ] Implicit Places using invariants and state equation in 3788 ms returned []
Implicit Place search using SMT with State Equation took 4279 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:06:50] [INFO ] Redundant transitions in 124 ms returned []
Running 1861 sub problems to find dead transitions.
[2025-05-30 10:06:50] [INFO ] Invariant cache hit.
[2025-05-30 10:06:50] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/944 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/944 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1861 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:07:20] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 944/2840 variables, and 65 constraints, problems are : Problem set: 0 solved, 1861 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/22 constraints, Generalized P Invariants (flows): 54/83 constraints, State Equation: 0/955 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1861/1861 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1861 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/944 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/944 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1861 unsolved
Problem TDEAD1326 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/944 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 1860 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:07:44] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:07:45] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:07:50] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 6 ms to minimize.
Problem TDEAD1669 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 944/2840 variables, and 68 constraints, problems are : Problem set: 2 solved, 1859 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/22 constraints, Generalized P Invariants (flows): 54/83 constraints, State Equation: 0/955 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1861 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60754ms problems are : Problem set: 2 solved, 1859 unsolved
Search for dead transitions found 2 dead transitions in 60762ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 955/955 places, 1883/1885 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 955 transition count 1883
Applied a total of 1 rules in 46 ms. Remains 955 /955 variables (removed 0) and now considering 1883/1883 (removed 0) transitions.
// Phase 1: matrix 1883 rows 955 cols
[2025-05-30 10:07:50] [INFO ] Computed 105 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:07:51] [INFO ] Implicit Places using invariants in 666 ms returned []
[2025-05-30 10:07:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:07:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:07:54] [INFO ] Implicit Places using invariants and state equation in 3344 ms returned []
Implicit Place search using SMT with State Equation took 4029 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 955/955 places, 1883/1885 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69283 ms. Remains : 955/955 places, 1883/1885 transitions.
RANDOM walk for 40000 steps (297 resets) in 342 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 171 ms. (232 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (41 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (42 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (40 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 129818 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 5
Probabilistic random walk after 129818 steps, saw 86101 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2025-05-30 10:07:58] [INFO ] Invariant cache hit.
[2025-05-30 10:07:58] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 112/277 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 672/949 variables, 79/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/950 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/955 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1883/2838 variables, 955/1060 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2838 variables, 4/1064 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2838 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2838 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2838/2838 variables, and 1064 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2893 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 955/955 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 112/277 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 672/949 variables, 79/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:01] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:01] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:02] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:02] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:02] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:02] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/949 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/950 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:03] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/950 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 5/955 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:04] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/955 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/955 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1883/2838 variables, 955/1068 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2838 variables, 4/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2838 variables, 3/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2838 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/2838 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2838/2838 variables, and 1075 constraints, problems are : Problem set: 0 solved, 5 unsolved in 15165 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 955/955 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18081ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3632 ms.
Support contains 165 out of 955 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 955/955 places, 1883/1883 transitions.
Applied a total of 0 rules in 23 ms. Remains 955 /955 variables (removed 0) and now considering 1883/1883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 955/955 places, 1883/1883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 955/955 places, 1883/1883 transitions.
Applied a total of 0 rules in 23 ms. Remains 955 /955 variables (removed 0) and now considering 1883/1883 (removed 0) transitions.
[2025-05-30 10:08:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:08:20] [INFO ] Implicit Places using invariants in 502 ms returned []
[2025-05-30 10:08:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:08:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:08:24] [INFO ] Implicit Places using invariants and state equation in 3355 ms returned []
Implicit Place search using SMT with State Equation took 3883 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:08:24] [INFO ] Redundant transitions in 111 ms returned []
Running 1859 sub problems to find dead transitions.
[2025-05-30 10:08:24] [INFO ] Invariant cache hit.
[2025-05-30 10:08:24] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/944 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1859 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/944 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1859 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:08:49] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 5.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 4.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 12.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 5.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 1.0)
(s422 25.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 944/2838 variables, and 65 constraints, problems are : Problem set: 0 solved, 1859 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/22 constraints, Generalized P Invariants (flows): 54/83 constraints, State Equation: 0/955 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1859/1859 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1859 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/944 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1859 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/944 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1859 unsolved
Problem TDEAD770 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD917 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/944 variables, 1/65 constraints. Problems are: Problem set: 4 solved, 1855 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:12] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:19] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:20] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 944/2838 variables, and 68 constraints, problems are : Problem set: 4 solved, 1855 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/22 constraints, Generalized P Invariants (flows): 54/83 constraints, State Equation: 0/955 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1859 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60654ms problems are : Problem set: 4 solved, 1855 unsolved
Search for dead transitions found 4 dead transitions in 60659ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 955/955 places, 1879/1883 transitions.
Applied a total of 0 rules in 23 ms. Remains 955 /955 variables (removed 0) and now considering 1879/1879 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:09:24] [INFO ] Redundant transitions in 44 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64757 ms. Remains : 955/955 places, 1879/1883 transitions.
RANDOM walk for 40000 steps (301 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (46 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (46 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (37 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (40 resets) in 333 ms. (119 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 133061 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 5
Probabilistic random walk after 133061 steps, saw 88246 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 1879 rows 955 cols
[2025-05-30 10:09:28] [INFO ] Computed 106 invariants in 22 ms
[2025-05-30 10:09:28] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 112/277 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 672/949 variables, 80/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/950 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/955 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1879/2834 variables, 955/1061 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2834 variables, 4/1065 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2834 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2834 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2834/2834 variables, and 1065 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 955/955 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 112/277 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 672/949 variables, 80/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:31] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:32] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:32] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:32] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:32] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:33] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/949 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:33] [INFO ] Deduced a trap composed of 24 places in 345 ms of which 45 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/949 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/949 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/950 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/950 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/955 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/955 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1879/2834 variables, 955/1068 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2834 variables, 4/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2834 variables, 3/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2834 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/2834 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2834/2834 variables, and 1075 constraints, problems are : Problem set: 0 solved, 5 unsolved in 12168 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 955/955 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15022ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5747 ms.
Support contains 51 out of 955 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 955/955 places, 1879/1879 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 955 transition count 1838
Reduce places removed 42 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 85 place count 913 transition count 1836
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 89 place count 911 transition count 1834
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 909 transition count 1834
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 91 place count 909 transition count 1768
Deduced a syphon composed of 66 places in 3 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 133 rules applied. Total rules applied 224 place count 842 transition count 1768
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 226 place count 841 transition count 1767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 840 transition count 1767
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 227 place count 840 transition count 1763
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 235 place count 836 transition count 1763
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 240 place count 831 transition count 1754
Iterating global reduction 6 with 5 rules applied. Total rules applied 245 place count 831 transition count 1754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 245 place count 831 transition count 1753
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 247 place count 830 transition count 1753
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 275 place count 816 transition count 1739
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 276 place count 816 transition count 1738
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 278 place count 814 transition count 1727
Iterating global reduction 7 with 2 rules applied. Total rules applied 280 place count 814 transition count 1727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 282 place count 813 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 283 place count 812 transition count 1725
Iterating global reduction 8 with 1 rules applied. Total rules applied 284 place count 812 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 285 place count 811 transition count 1724
Iterating global reduction 8 with 1 rules applied. Total rules applied 286 place count 811 transition count 1724
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 292 place count 808 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 293 place count 807 transition count 1720
Iterating global reduction 8 with 1 rules applied. Total rules applied 294 place count 807 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 295 place count 806 transition count 1718
Iterating global reduction 8 with 1 rules applied. Total rules applied 296 place count 806 transition count 1718
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 297 place count 806 transition count 1717
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 305 place count 806 transition count 1709
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 315 place count 798 transition count 1707
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 316 place count 798 transition count 1706
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 318 place count 798 transition count 1704
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 321 place count 795 transition count 1704
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 321 place count 795 transition count 1701
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 327 place count 792 transition count 1701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 329 place count 791 transition count 1700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 330 place count 791 transition count 1699
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 332 place count 791 transition count 1699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 334 place count 789 transition count 1697
Applied a total of 334 rules in 350 ms. Remains 789 /955 variables (removed 166) and now considering 1697/1879 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 789/955 places, 1697/1879 transitions.
RANDOM walk for 40000 steps (442 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (64 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (63 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (67 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (55 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 175248 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 4
Probabilistic random walk after 175248 steps, saw 102482 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 1697 rows 789 cols
[2025-05-30 10:09:52] [INFO ] Computed 101 invariants in 17 ms
[2025-05-30 10:09:52] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 165.0 s and query timeout 16500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 154/205 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 539/744 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/749 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 40/789 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1697/2486 variables, 789/890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2486 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2486 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2486 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2486/2486 variables, and 893 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 789/789 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 165.0 s and query timeout 16500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 154/205 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 539/744 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:54] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5/749 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:55] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:55] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 40/789 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:56] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:09:56] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 17 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1697/2486 variables, 789/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2486 variables, 3/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2486 variables, 3/901 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2486 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/2486 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2486/2486 variables, and 901 constraints, problems are : Problem set: 0 solved, 4 unsolved in 12933 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 789/789 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14901ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 4195 ms.
Support contains 47 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1697/1697 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 789 transition count 1696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 788 transition count 1696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 788 transition count 1695
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 787 transition count 1695
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 786 transition count 1694
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 784 transition count 1692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 783 transition count 1692
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 783 transition count 1690
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 781 transition count 1690
Applied a total of 13 rules in 73 ms. Remains 781 /789 variables (removed 8) and now considering 1690/1697 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 781/789 places, 1690/1697 transitions.
RANDOM walk for 40000 steps (481 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (71 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (71 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 201068 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 3
Probabilistic random walk after 201068 steps, saw 120987 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 1690 rows 781 cols
[2025-05-30 10:10:15] [INFO ] Computed 100 invariants in 12 ms
Starting Z3 with timeout 180.0 s and query timeout 18000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/208 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 522/730 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/737 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/781 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/781 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1690/2471 variables, 781/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2471 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2471 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2471/2471 variables, and 881 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 180.0 s and query timeout 18000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/208 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 522/730 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:10:16] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/737 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/737 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 44/781 variables, 15/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/781 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1690/2471 variables, 781/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2471 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2471 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2471 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2471/2471 variables, and 884 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5292 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6414ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1399 ms.
Support contains 47 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1690/1690 transitions.
Applied a total of 0 rules in 21 ms. Remains 781 /781 variables (removed 0) and now considering 1690/1690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 781/781 places, 1690/1690 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1690/1690 transitions.
Applied a total of 0 rules in 21 ms. Remains 781 /781 variables (removed 0) and now considering 1690/1690 (removed 0) transitions.
[2025-05-30 10:10:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:23] [INFO ] Implicit Places using invariants in 494 ms returned [80, 99, 105, 108, 114, 115, 196, 217, 294, 311, 345, 391, 396, 401, 474, 480, 564, 572, 579, 581, 672, 676, 687]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 509 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 758/781 places, 1690/1690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 758 transition count 1673
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 741 transition count 1673
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 34 place count 741 transition count 1671
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 739 transition count 1671
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 733 transition count 1665
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 733 transition count 1665
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 730 transition count 1662
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 730 transition count 1662
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 88 place count 714 transition count 1646
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 714 transition count 1639
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 102 place count 707 transition count 1639
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 707 transition count 1630
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 120 place count 698 transition count 1630
Applied a total of 120 rules in 119 ms. Remains 698 /758 variables (removed 60) and now considering 1630/1690 (removed 60) transitions.
// Phase 1: matrix 1630 rows 698 cols
[2025-05-30 10:10:23] [INFO ] Computed 77 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:24] [INFO ] Implicit Places using invariants in 463 ms returned [269, 270, 512, 513]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 477 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 694/781 places, 1630/1690 transitions.
Applied a total of 0 rules in 20 ms. Remains 694 /694 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1146 ms. Remains : 694/781 places, 1630/1690 transitions.
RANDOM walk for 40000 steps (530 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (79 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (81 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (80 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 168427 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 3
Probabilistic random walk after 168427 steps, saw 119284 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 1630 rows 694 cols
[2025-05-30 10:10:27] [INFO ] Computed 73 invariants in 10 ms
Starting Z3 with timeout 195.0 s and query timeout 19500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/137 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/150 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 503/653 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/656 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 38/694 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1630/2324 variables, 694/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2324 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2324 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2324/2324 variables, and 767 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 694/694 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 195.0 s and query timeout 19500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/137 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/150 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 503/653 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/656 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 38/694 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1630/2324 variables, 694/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2324 variables, 2/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:10:34] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:10:35] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 25 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2324 variables, 2/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2324 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2324 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2324/2324 variables, and 771 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7431 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 694/694 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8968ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1429 ms.
Support contains 3 out of 694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1630/1630 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 694 transition count 1622
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 686 transition count 1622
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 16 place count 686 transition count 1600
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 61 place count 663 transition count 1600
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 662 transition count 1600
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 662 transition count 1599
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 661 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 659 transition count 1591
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 659 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 658 transition count 1583
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 658 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 657 transition count 1575
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 657 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 656 transition count 1567
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 656 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 655 transition count 1559
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 655 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 654 transition count 1551
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 654 transition count 1551
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 653 transition count 1543
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 653 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 652 transition count 1535
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 652 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 651 transition count 1527
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 651 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 650 transition count 1519
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 650 transition count 1519
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 649 transition count 1511
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 649 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 648 transition count 1503
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 648 transition count 1503
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 647 transition count 1495
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 647 transition count 1495
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 646 transition count 1487
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 646 transition count 1487
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 645 transition count 1479
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 645 transition count 1479
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 644 transition count 1471
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 644 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 643 transition count 1463
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 643 transition count 1463
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 118 place count 634 transition count 1454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 634 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 633 transition count 1452
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 633 transition count 1452
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 632 transition count 1450
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 632 transition count 1450
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 632 transition count 1448
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 129 place count 630 transition count 1446
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 135 place count 630 transition count 1440
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 141 place count 624 transition count 1440
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 624 transition count 1440
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 623 transition count 1439
Applied a total of 143 rules in 375 ms. Remains 623 /694 variables (removed 71) and now considering 1439/1630 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 623/694 places, 1439/1630 transitions.
RANDOM walk for 40000 steps (628 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (123 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (114 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 229375 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 229375 steps, saw 151290 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 1439 rows 623 cols
[2025-05-30 10:10:41] [INFO ] Computed 71 invariants in 10 ms
Starting Z3 with timeout 210.0 s and query timeout 21000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/89 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 97/186 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/188 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/332 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 15/347 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 173/520 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 37/557 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/558 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/558 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 65/623 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/623 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1439/2062 variables, 623/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2062 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2062 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2062/2062 variables, and 694 constraints, problems are : Problem set: 0 solved, 2 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 623/623 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 210.0 s and query timeout 21000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/88 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/89 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 97/186 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/188 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/332 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 15/347 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 173/520 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:10:42] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 37/557 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:10:42] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/558 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 65/623 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/623 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1439/2062 variables, 623/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2062 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2062 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/2062 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2062/2062 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3673 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 623/623 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4512ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1194 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1439/1439 transitions.
Applied a total of 0 rules in 18 ms. Remains 623 /623 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 623/623 places, 1439/1439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1439/1439 transitions.
Applied a total of 0 rules in 18 ms. Remains 623 /623 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
[2025-05-30 10:10:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:47] [INFO ] Implicit Places using invariants in 429 ms returned [17, 144, 164, 169, 170, 308, 392, 393, 459, 536, 542, 557, 575]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 443 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 610/623 places, 1439/1439 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 610 transition count 1435
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 606 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 605 transition count 1434
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 14 place count 601 transition count 1430
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 601 transition count 1430
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 21 place count 598 transition count 1427
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 598 transition count 1427
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 42 place count 589 transition count 1418
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 587 transition count 1419
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 587 transition count 1415
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 54 place count 583 transition count 1415
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 583 transition count 1414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 582 transition count 1414
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 57 place count 582 transition count 1414
Applied a total of 57 rules in 125 ms. Remains 582 /610 variables (removed 28) and now considering 1414/1439 (removed 25) transitions.
// Phase 1: matrix 1414 rows 582 cols
[2025-05-30 10:10:47] [INFO ] Computed 58 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:47] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-05-30 10:10:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:49] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 582/623 places, 1414/1439 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2310 ms. Remains : 582/623 places, 1414/1439 transitions.
RANDOM walk for 40000 steps (701 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (122 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (120 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 287632 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287632 steps, saw 114342 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2025-05-30 10:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 225.0 s and query timeout 22500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/107 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 138/247 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/249 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 140/389 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/395 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/408 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/442 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 107/549 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 22/571 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/571 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 11/582 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/582 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1414/1996 variables, 582/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1996 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1996 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1996/1996 variables, and 640 constraints, problems are : Problem set: 0 solved, 2 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 225.0 s and query timeout 22500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/107 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 138/247 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/249 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 140/389 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/395 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/408 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/442 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 107/549 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 22/571 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/571 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 11/582 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/582 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1414/1996 variables, 582/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1996 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1996 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1996 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1996/1996 variables, and 642 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2477 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3404ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1800 ms.
Support contains 3 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1414/1414 transitions.
Applied a total of 0 rules in 17 ms. Remains 582 /582 variables (removed 0) and now considering 1414/1414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 582/582 places, 1414/1414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 1414/1414 transitions.
Applied a total of 0 rules in 17 ms. Remains 582 /582 variables (removed 0) and now considering 1414/1414 (removed 0) transitions.
[2025-05-30 10:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:57] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-05-30 10:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:59] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:10:59] [INFO ] Redundant transitions in 19 ms returned []
Running 1377 sub problems to find dead transitions.
[2025-05-30 10:10:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:11:22] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:11:25] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:11:25] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:11:25] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1996 variables, and 58 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 43/44 constraints, State Equation: 0/582 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:11:49] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:11:49] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/1996 variables, and 60 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 43/44 constraints, State Equation: 0/582 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60476ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62238 ms. Remains : 582/582 places, 1414/1414 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 17 ms. Remains 582 /582 variables (removed 0) and now considering 1414/1414 (removed 0) transitions.
Running SMT prover for 2 properties.
[2025-05-30 10:11:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 10:11:59] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-05-30 10:11:59] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 25 ms returned sat
[2025-05-30 10:11:59] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 10:12:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-30 10:12:00] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 19 ms returned sat
[2025-05-30 10:12:01] [INFO ] After 1514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-30 10:12:02] [INFO ] After 2246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 10:12:02] [INFO ] After 2962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-30 10:12:03] [INFO ] Flatten gal took : 72 ms
[2025-05-30 10:12:03] [INFO ] Flatten gal took : 69 ms
[2025-05-30 10:12:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6047754624970066312.gal : 10 ms
[2025-05-30 10:12:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11666205892921959037.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6047754624970066312.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11666205892921959037.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11666205892921959037.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 486
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :486 after 39366
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :39366 after 2.05491e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.05491e+07 after 2.91527e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.91527e+07 after 2.96347e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.96347e+07 after 2.96428e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.96428e+07 after 7.34734e+08
Invariant property ASLink-PT-07b-ReachabilityFireability-2025-05 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.34734e+08 after 7.48158e+09
Reachability property ASLink-PT-07b-ReachabilityFireability-2025-04 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.65129e+10,2.17684,66336,2,50564,19,142223,6,0,3745,106533,0
Total reachable state count : 46512947555

Verifying 2 reachability properties.
Reachability property ASLink-PT-07b-ReachabilityFireability-2025-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-07b-ReachabilityFireability-2025-04,1,2.1932,66336,2,583,19,142223,7,0,3748,106533,0
Invariant property ASLink-PT-07b-ReachabilityFireability-2025-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-07b-ReachabilityFireability-2025-05,1,2.20943,66336,2,583,19,142223,8,0,3753,106533,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 5547 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 10:12:05] [INFO ] Flatten gal took : 108 ms
[2025-05-30 10:12:05] [INFO ] Applying decomposition
[2025-05-30 10:12:05] [INFO ] Flatten gal took : 111 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17133538363785536684.txt' '-o' '/tmp/graph17133538363785536684.bin' '-w' '/tmp/graph17133538363785536684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17133538363785536684.bin' '-l' '-1' '-v' '-w' '/tmp/graph17133538363785536684.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:12:06] [INFO ] Decomposing Gal with order
[2025-05-30 10:12:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:12:06] [INFO ] Removed a total of 2881 redundant transitions.
[2025-05-30 10:12:06] [INFO ] Flatten gal took : 282 ms
[2025-05-30 10:12:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 46 ms.
[2025-05-30 10:12:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8905584626648796343.gal : 39 ms
[2025-05-30 10:12:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3514251716756403155.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8905584626648796343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3514251716756403155.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3514251716756403155.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 7.54173e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7.54173e+06 after 4.47705e+21
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.07505e+44 after 1.62818e+45
Detected timeout of ITS tools.
[2025-05-30 10:42:07] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17720023677480994494
[2025-05-30 10:42:07] [INFO ] Computing symmetric may disable matrix : 1414 transitions.
[2025-05-30 10:42:07] [INFO ] Applying decomposition
[2025-05-30 10:42:07] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:42:07] [INFO ] Computing symmetric may enable matrix : 1414 transitions.
[2025-05-30 10:42:07] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:42:07] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3250516462895557317.txt' '-o' '/tmp/graph3250516462895557317.bin' '-w' '/tmp/graph3250516462895557317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3250516462895557317.bin' '-l' '-1' '-v' '-w' '/tmp/graph3250516462895557317.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:42:07] [INFO ] Decomposing Gal with order
[2025-05-30 10:42:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:42:08] [INFO ] Removed a total of 2787 redundant transitions.
[2025-05-30 10:42:08] [INFO ] Flatten gal took : 88 ms
[2025-05-30 10:42:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 13 ms.
[2025-05-30 10:42:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15216368655651311933.gal : 7 ms
[2025-05-30 10:42:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13686277304830057398.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability15216368655651311933.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13686277304830057398.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability13686277304830057398.prop.
[2025-05-30 10:42:08] [INFO ] Computing Do-Not-Accords matrix : 1414 transitions.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 1458
[2025-05-30 10:42:08] [INFO ] Computation of Completed DNA matrix. took 66 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1458 after 4.92469e+07
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4.92469e+07 after 8.96364e+07
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.96364e+07 after 2.29937e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.29937e+08 after 3.18156e+08
[2025-05-30 10:42:08] [INFO ] Built C files in 486ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17720023677480994494
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.18156e+08 after 4.18067e+08
Running compilation step : cd /tmp/ltsmin17720023677480994494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.18067e+08 after 5.67933e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.67933e+08 after 1.32364e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.32364e+09 after 2.90513e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.96303e+17 after 4.209e+17
Compilation finished in 5158 ms.
Running link step : cd /tmp/ltsmin17720023677480994494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 2078 ms.
Running LTSmin : cd /tmp/ltsmin17720023677480994494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT07bReachabilityFireability202504==true'
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7.23568e+18 after 9.71169e+18
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :9.71169e+18 after 1.19693e+19
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.46995e+21,145.552,1946672,2055,2521,3.1592e+06,575309,1710,4.50474e+06,507,4.73926e+06,0
Total reachable state count : 1469951990590062802944

Verifying 2 reachability properties.
Reachability property ASLink-PT-07b-ReachabilityFireability-2025-04 is true.
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-07b-ReachabilityFireability-2025-04,8.61421e+11,146.071,1946672,320,394,3.1592e+06,575309,1710,4.50474e+06,509,4.73926e+06,0
Invariant property ASLink-PT-07b-ReachabilityFireability-2025-05 does not hold.
FORMULA ASLink-PT-07b-ReachabilityFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-07b-ReachabilityFireability-2025-05,5.59924e+12,146.076,1946672,324,437,3.1592e+06,575309,1710,4.50474e+06,510,4.73926e+06,41
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2708253 ms.

BK_STOP 1748602046340

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-07b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-07b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729200391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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