Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000318.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-03a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729000318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 357K 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-03a-ReachabilityCardinality-2023-08
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2023-11
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2023-14
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-15
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-00
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-01
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-02
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-03
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-04
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-05
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-06
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-07
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-09
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-10
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-12
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2025-13

=== Now, execution of the tool begins

BK_START 1748571879159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 02:24:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 02:24:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 02:24:40] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2025-05-30 02:24:40] [INFO ] Transformed 821 places.
[2025-05-30 02:24:40] [INFO ] Transformed 1281 transitions.
[2025-05-30 02:24:40] [INFO ] Found NUPN structural information;
[2025-05-30 02:24:40] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (338 resets) in 1252 ms. (31 steps per ms) remains 8/15 properties
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (74 resets) in 331 ms. (120 steps per ms) remains 8/8 properties
[2025-05-30 02:24:41] [INFO ] Flatten gal took : 270 ms
BEST_FIRST walk for 40003 steps (74 resets) in 504 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (95 resets) in 286 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
[2025-05-30 02:24:41] [INFO ] Flatten gal took : 182 ms
BEST_FIRST walk for 40003 steps (64 resets) in 233 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (81 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (77 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
[2025-05-30 02:24:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1708044466290002367.gal : 99 ms
BEST_FIRST walk for 40002 steps (63 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
[2025-05-30 02:24:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15222300928994705786.prop : 3 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/ReachabilityCardinality1708044466290002367.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15222300928994705786.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
// Phase 1: matrix 1268 rows 821 cols
[2025-05-30 02:24:41] [INFO ] Computed 156 invariants in 59 ms
Loading property file /tmp/ReachabilityCardinality15222300928994705786.prop.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 100/198 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 100/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 51/249 variables, 14/234 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 51/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 34
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :34 after 60
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :60 after 93
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :93 after 186
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :186 after 34646
Problem ASLink-PT-03a-ReachabilityCardinality-2025-06 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 567/816 variables, 118/403 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :34646 after 3.13649e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 567/970 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.13649e+07 after 1.11459e+09
Reachability property ASLink-PT-03a-ReachabilityCardinality-2025-07 is true.
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1.11459e+09 after 1.15528e+09
At refinement iteration 10 (INCLUDED_ONLY) 0/816 variables, 0/970 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Reachability property ASLink-PT-03a-ReachabilityCardinality-2025-01 is true.
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.15528e+09 after 1.15528e+09
At refinement iteration 11 (OVERLAPS) 5/821 variables, 2/972 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/821 variables, 5/977 constraints. Problems are: Problem set: 3 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.15528e+09 after 1.15649e+09
At refinement iteration 13 (INCLUDED_ONLY) 0/821 variables, 0/977 constraints. Problems are: Problem set: 3 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.15649e+09 after 6.00469e+09
At refinement iteration 14 (OVERLAPS) 1268/2089 variables, 821/1798 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2089 variables, 0/1798 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/2089 variables, 0/1798 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2089/2089 variables, and 1798 constraints, problems are : Problem set: 3 solved, 5 unsolved in 2614 ms.
Refiners :[Domain max(s): 821/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 120/120 constraints, State Equation: 821/821 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :6.00469e+09 after 1.1647e+10
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 97/183 variables, 19/105 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 97/202 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 58/241 variables, 17/219 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 58/277 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem ASLink-PT-03a-ReachabilityCardinality-2025-03 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityCardinality-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 575/816 variables, 118/395 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 575/970 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:45] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 37 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/816 variables, 1/971 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:46] [INFO ] Deduced a trap composed of 54 places in 381 ms of which 54 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 1/972 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.1647e+10 after 1.3954e+11
At refinement iteration 12 (INCLUDED_ONLY) 0/816 variables, 0/972 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/821 variables, 2/974 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/821 variables, 5/979 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/821 variables, 0/979 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1268/2089 variables, 821/1800 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2089/2089 variables, and 1804 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5016 ms.
Refiners :[Domain max(s): 821/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 120/120 constraints, State Equation: 821/821 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7800ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 803 transition count 1208
Reduce places removed 60 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 63 rules applied. Total rules applied 141 place count 743 transition count 1205
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 144 place count 740 transition count 1205
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 144 place count 740 transition count 1141
Deduced a syphon composed of 64 places in 2 ms
Ensure Unique test removed 26 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 298 place count 650 transition count 1141
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 300 place count 649 transition count 1140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 648 transition count 1140
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 307 place count 642 transition count 1111
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 314 place count 641 transition count 1111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 320 place count 640 transition count 1106
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 323 place count 637 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 324 place count 636 transition count 1098
Iterating global reduction 7 with 1 rules applied. Total rules applied 325 place count 636 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 326 place count 635 transition count 1090
Iterating global reduction 7 with 1 rules applied. Total rules applied 327 place count 635 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 328 place count 634 transition count 1082
Iterating global reduction 7 with 1 rules applied. Total rules applied 329 place count 634 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 330 place count 633 transition count 1074
Iterating global reduction 7 with 1 rules applied. Total rules applied 331 place count 633 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 332 place count 632 transition count 1066
Iterating global reduction 7 with 1 rules applied. Total rules applied 333 place count 632 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 334 place count 631 transition count 1058
Iterating global reduction 7 with 1 rules applied. Total rules applied 335 place count 631 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 336 place count 630 transition count 1050
Iterating global reduction 7 with 1 rules applied. Total rules applied 337 place count 630 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 338 place count 629 transition count 1042
Iterating global reduction 7 with 1 rules applied. Total rules applied 339 place count 629 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 340 place count 628 transition count 1034
Iterating global reduction 7 with 1 rules applied. Total rules applied 341 place count 628 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 342 place count 627 transition count 1026
Iterating global reduction 7 with 1 rules applied. Total rules applied 343 place count 627 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 344 place count 626 transition count 1018
Iterating global reduction 7 with 1 rules applied. Total rules applied 345 place count 626 transition count 1018
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 346 place count 625 transition count 1010
Iterating global reduction 7 with 1 rules applied. Total rules applied 347 place count 625 transition count 1010
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 348 place count 624 transition count 1002
Iterating global reduction 7 with 1 rules applied. Total rules applied 349 place count 624 transition count 1002
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 350 place count 623 transition count 994
Iterating global reduction 7 with 1 rules applied. Total rules applied 351 place count 623 transition count 994
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 352 place count 622 transition count 986
Iterating global reduction 7 with 1 rules applied. Total rules applied 353 place count 622 transition count 986
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 393 place count 602 transition count 966
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 396 place count 602 transition count 963
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 399 place count 599 transition count 963
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 402 place count 599 transition count 963
Applied a total of 402 rules in 641 ms. Remains 599 /821 variables (removed 222) and now considering 963/1268 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 599/821 places, 963/1268 transitions.
RANDOM walk for 40000 steps (499 resets) in 560 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (128 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (137 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (103 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :1.3954e+11 after 3.27291e+12
Interrupted probabilistic random walk after 250258 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 4
Probabilistic random walk after 250258 steps, saw 100024 distinct states, run finished after 3006 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 963 rows 599 cols
[2025-05-30 02:24:53] [INFO ] Computed 109 invariants in 15 ms
[2025-05-30 02:24:53] [INFO ] State equation strengthened by 15 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/152 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/191 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 399/590 variables, 78/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/599 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 963/1562 variables, 599/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1562 variables, 15/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1562/1562 variables, and 723 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 599/599 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 4/4 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/152 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/191 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 399/590 variables, 78/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/599 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 963/1562 variables, 599/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1562 variables, 15/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :3.27291e+12 after 1.07024e+13
At refinement iteration 11 (INCLUDED_ONLY) 0/1562 variables, 4/727 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 02:25:03] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 29 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1562 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1562 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1562 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 728 constraints, problems are : Problem set: 0 solved, 4 unsolved in 11665 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 599/599 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12747ms problems are : Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :1.07024e+13 after 2.9189e+13
Parikh walk visited 0 properties in 8591 ms.
Support contains 44 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 963/963 transitions.
Applied a total of 0 rules in 72 ms. Remains 599 /599 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 599/599 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 963/963 transitions.
Applied a total of 0 rules in 25 ms. Remains 599 /599 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2025-05-30 02:25:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:15] [INFO ] Implicit Places using invariants in 463 ms returned [1, 19, 20, 22, 32, 50, 68, 150, 163, 166, 168, 186, 204, 287, 300, 301, 302, 303, 304, 322, 340, 420, 425, 436, 441, 442, 443, 462, 464, 467, 485, 486, 487, 500, 506, 518, 530, 536, 542, 548, 554, 561]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 472 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 557/599 places, 963/963 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 557 transition count 918
Reduce places removed 45 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 58 rules applied. Total rules applied 103 place count 512 transition count 905
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 116 place count 499 transition count 905
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 116 place count 499 transition count 888
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 150 place count 482 transition count 888
Discarding 7 places :
Implicit places reduction removed 7 places
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 3 with 11 rules applied. Total rules applied 161 place count 475 transition count 884
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 166 place count 471 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 470 transition count 883
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 174 place count 463 transition count 876
Iterating global reduction 6 with 7 rules applied. Total rules applied 181 place count 463 transition count 876
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 183 place count 461 transition count 874
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 461 transition count 874
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 186 place count 461 transition count 873
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 254 place count 427 transition count 839
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 255 place count 426 transition count 838
Iterating global reduction 7 with 1 rules applied. Total rules applied 256 place count 426 transition count 838
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 257 place count 426 transition count 837
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 262 place count 426 transition count 832
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 267 place count 421 transition count 832
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 9 with 18 rules applied. Total rules applied 285 place count 421 transition count 814
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 303 place count 403 transition count 814
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 304 place count 403 transition count 813
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 312 place count 403 transition count 813
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 313 place count 403 transition count 813
Applied a total of 313 rules in 148 ms. Remains 403 /557 variables (removed 154) and now considering 813/963 (removed 150) transitions.
// Phase 1: matrix 813 rows 403 cols
[2025-05-30 02:25:15] [INFO ] Computed 60 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:15] [INFO ] Implicit Places using invariants in 270 ms returned [109, 118, 125, 126, 181, 200, 207, 210, 216, 221, 223, 300, 303, 305, 308, 376, 381, 394, 396, 400, 402]
[2025-05-30 02:25:15] [INFO ] Actually due to overlaps returned [216, 221, 223, 200, 207, 300, 305, 109, 118, 181, 210, 308, 376, 381, 394, 400]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 272 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 387/599 places, 813/963 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 381 transition count 807
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 381 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 380 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 380 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 377 transition count 803
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 377 transition count 800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 374 transition count 800
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 374 transition count 799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 373 transition count 799
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 373 transition count 799
Applied a total of 31 rules in 138 ms. Remains 373 /387 variables (removed 14) and now considering 799/813 (removed 14) transitions.
// Phase 1: matrix 799 rows 373 cols
[2025-05-30 02:25:16] [INFO ] Computed 44 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:16] [INFO ] Implicit Places using invariants in 229 ms returned [122, 123, 367]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 232 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 370/599 places, 799/963 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 369 transition count 798
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 369 transition count 798
Applied a total of 2 rules in 20 ms. Remains 369 /370 variables (removed 1) and now considering 798/799 (removed 1) transitions.
// Phase 1: matrix 798 rows 369 cols
[2025-05-30 02:25:16] [INFO ] Computed 41 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:16] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-30 02:25:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:25:17] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 369/599 places, 798/963 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2239 ms. Remains : 369/599 places, 798/963 transitions.
RANDOM walk for 40000 steps (654 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (160 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (199 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (204 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (153 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 383851 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 4
Probabilistic random walk after 383851 steps, saw 157111 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2025-05-30 02:25:20] [INFO ] Invariant cache hit.
[2025-05-30 02:25:20] [INFO ] State equation strengthened by 4 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/176 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/180 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 189/369 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 798/1167 variables, 369/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1167 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1167 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1167 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 414 constraints, problems are : Problem set: 0 solved, 4 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/176 variables, 15/15 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 02:25:21] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:25:21] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:25:21] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:25:21] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/180 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 189/369 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 798/1167 variables, 369/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1167 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1167 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :2.9189e+13 after 5.12289e+13
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:25:34] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1167 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1167 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1167 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 423 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37566 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38069ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 38533 ms.
Support contains 44 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 798/798 transitions.
Applied a total of 0 rules in 22 ms. Remains 369 /369 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 369/369 places, 798/798 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 798/798 transitions.
Applied a total of 0 rules in 10 ms. Remains 369 /369 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2025-05-30 02:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:26:37] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 02:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:26:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:26:38] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:26:38] [INFO ] Redundant transitions in 49 ms returned []
Running 797 sub problems to find dead transitions.
[2025-05-30 02:26:38] [INFO ] Invariant cache hit.
[2025-05-30 02:26:38] [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/368 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 797 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:26:57] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 5 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :5.12289e+13 after 1.11986e+14
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:01] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:01] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:01] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:03] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:03] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:03] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:04] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:05] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:05] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 797 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/1167 variables, and 51 constraints, problems are : Problem set: 0 solved, 797 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 797/797 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 797 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 797 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 6 (OVERLAPS) 798/1167 variables, 369/420 constraints. Problems are: Problem set: 118 solved, 679 unsolved
SMT process timed out in 60318ms, After SMT, problems are : Problem set: 118 solved, 679 unsolved
Search for dead transitions found 118 dead transitions in 60323ms
Found 118 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 118 transitions
Dead transitions reduction (with SMT) removed 118 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 369/369 places, 680/798 transitions.
Ensure Unique test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 354 transition count 668
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 40 place count 342 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 341 transition count 667
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 41 place count 341 transition count 666
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 340 transition count 666
Applied a total of 43 rules in 15 ms. Remains 340 /369 variables (removed 29) and now considering 666/680 (removed 14) transitions.
// Phase 1: matrix 666 rows 340 cols
[2025-05-30 02:27:38] [INFO ] Computed 40 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:27:38] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-05-30 02:27:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:27:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:27:39] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 340/369 places, 666/798 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62279 ms. Remains : 340/369 places, 666/798 transitions.
RANDOM walk for 40000 steps (638 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (161 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (199 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (199 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 405119 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 4
Probabilistic random walk after 405119 steps, saw 159793 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2025-05-30 02:27:42] [INFO ] Invariant cache hit.
[2025-05-30 02:27:42] [INFO ] State equation strengthened by 4 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/121 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/125 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 215/340 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 666/1006 variables, 340/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1006 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1006 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1006/1006 variables, and 384 constraints, problems are : Problem set: 0 solved, 4 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 340/340 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/121 variables, 12/12 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 02:27:43] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/125 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 215/340 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 666/1006 variables, 340/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1006 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1006 variables, 4/389 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 02:27:45] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:46] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:46] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:27:46] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1006 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1006 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1006 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1006/1006 variables, and 393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4862 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 340/340 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5471ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 10147 ms.
Support contains 44 out of 340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 666/666 transitions.
Applied a total of 0 rules in 9 ms. Remains 340 /340 variables (removed 0) and now considering 666/666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 340/340 places, 666/666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 666/666 transitions.
Applied a total of 0 rules in 7 ms. Remains 340 /340 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2025-05-30 02:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:27:58] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-05-30 02:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:27:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:27:59] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:27:59] [INFO ] Redundant transitions in 8 ms returned []
Running 665 sub problems to find dead transitions.
[2025-05-30 02:27:59] [INFO ] Invariant cache hit.
[2025-05-30 02:27:59] [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/339 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (OVERLAPS) 1/340 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:13] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:13] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 10 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:13] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 14 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:15] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:16] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:16] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:16] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:17] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:18] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:18] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:19] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:19] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:20] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:20] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 14/54 constraints. Problems are: Problem set: 12 solved, 653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1006 variables, and 54 constraints, problems are : Problem set: 12 solved, 653 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/340 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 653 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 19/19 constraints. Problems are: Problem set: 12 solved, 653 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/19 constraints. Problems are: Problem set: 12 solved, 653 unsolved
At refinement iteration 2 (OVERLAPS) 1/340 variables, 13/32 constraints. Problems are: Problem set: 12 solved, 653 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 8/40 constraints. Problems are: Problem set: 12 solved, 653 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 14/54 constraints. Problems are: Problem set: 12 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:28:38] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 1/55 constraints. Problems are: Problem set: 12 solved, 653 unsolved
SDD proceeding with computation,6 properties remain. new max is 1048576
SDD size :1.11986e+14 after 1.80075e+14
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/55 constraints. Problems are: Problem set: 12 solved, 653 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 7 (OVERLAPS) 666/1006 variables, 340/395 constraints. Problems are: Problem set: 119 solved, 546 unsolved
SMT process timed out in 60160ms, After SMT, problems are : Problem set: 119 solved, 546 unsolved
Search for dead transitions found 119 dead transitions in 60162ms
Found 119 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 119 transitions
Dead transitions reduction (with SMT) removed 119 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 340/340 places, 547/666 transitions.
Ensure Unique test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 325 transition count 535
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 40 place count 313 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 312 transition count 534
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 41 place count 312 transition count 533
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 311 transition count 533
Applied a total of 43 rules in 19 ms. Remains 311 /340 variables (removed 29) and now considering 533/547 (removed 14) transitions.
// Phase 1: matrix 533 rows 311 cols
[2025-05-30 02:28:59] [INFO ] Computed 39 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:28:59] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-30 02:28:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:28:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:28:59] [INFO ] Implicit Places using invariants and state equation in 420 ms returned [117]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 603 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 310/340 places, 533/666 transitions.
Applied a total of 0 rules in 8 ms. Remains 310 /310 variables (removed 0) and now considering 533/533 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 61639 ms. Remains : 310/340 places, 533/666 transitions.
RANDOM walk for 40000 steps (648 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (160 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (184 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (185 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (150 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 361641 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 4
Probabilistic random walk after 361641 steps, saw 146855 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 533 rows 310 cols
[2025-05-30 02:29:03] [INFO ] Computed 38 invariants in 3 ms
[2025-05-30 02:29:03] [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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/145 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/149 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 155/304 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 533/837 variables, 304/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/843 variables, 6/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/843 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/843 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/843 variables, and 352 constraints, problems are : Problem set: 0 solved, 4 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 310/310 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 101/145 variables, 15/15 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 02:29:03] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:03] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:03] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:03] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/149 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 155/304 variables, 22/42 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 02:29:03] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 533/837 variables, 304/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/837 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/837 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/837 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/843 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/843 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/843 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/843 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/843 variables, and 361 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2273 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 310/310 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2755ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5711 ms.
Support contains 44 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 533/533 transitions.
Applied a total of 0 rules in 6 ms. Remains 310 /310 variables (removed 0) and now considering 533/533 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 310/310 places, 533/533 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 533/533 transitions.
Applied a total of 0 rules in 7 ms. Remains 310 /310 variables (removed 0) and now considering 533/533 (removed 0) transitions.
[2025-05-30 02:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:29:11] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-05-30 02:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:29:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:29:12] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:29:12] [INFO ] Redundant transitions in 5 ms returned []
Running 532 sub problems to find dead transitions.
[2025-05-30 02:29:12] [INFO ] Invariant cache hit.
[2025-05-30 02:29:12] [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/309 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:23] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:24] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:24] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:24] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:24] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:24] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:25] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:25] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:26] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:26] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:27] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:27] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 12/50 constraints. Problems are: Problem set: 7 solved, 525 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/50 constraints. Problems are: Problem set: 7 solved, 525 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
At refinement iteration 6 (OVERLAPS) 533/843 variables, 310/360 constraints. Problems are: Problem set: 56 solved, 476 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 4/364 constraints. Problems are: Problem set: 56 solved, 476 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:29:40] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 843/843 variables, and 365 constraints, problems are : Problem set: 56 solved, 476 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 310/310 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 476 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 19/19 constraints. Problems are: Problem set: 56 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/19 constraints. Problems are: Problem set: 56 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 16/35 constraints. Problems are: Problem set: 56 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 3/38 constraints. Problems are: Problem set: 56 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 13/51 constraints. Problems are: Problem set: 56 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/51 constraints. Problems are: Problem set: 56 solved, 476 unsolved
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
At refinement iteration 6 (OVERLAPS) 533/843 variables, 310/361 constraints. Problems are: Problem set: 175 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 4/365 constraints. Problems are: Problem set: 175 solved, 357 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 357/722 constraints. Problems are: Problem set: 181 solved, 351 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:07] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/843 variables, and 723 constraints, problems are : Problem set: 181 solved, 351 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 310/310 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 357/532 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 181 solved, 351 unsolved
Search for dead transitions found 181 dead transitions in 60134ms
Found 181 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 181 transitions
Dead transitions reduction (with SMT) removed 181 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 310/310 places, 352/533 transitions.
Ensure Unique test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 294 transition count 341
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 39 place count 283 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 282 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 40 place count 282 transition count 339
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 281 transition count 339
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 281 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 280 transition count 338
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 280 transition count 338
Applied a total of 45 rules in 36 ms. Remains 280 /310 variables (removed 30) and now considering 338/352 (removed 14) transitions.
// Phase 1: matrix 338 rows 280 cols
[2025-05-30 02:30:12] [INFO ] Computed 38 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:30:12] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-30 02:30:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:30:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:30:12] [INFO ] Implicit Places using invariants and state equation in 348 ms returned [8, 9, 10, 127]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 497 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 276/310 places, 338/533 transitions.
Applied a total of 0 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 61325 ms. Remains : 276/310 places, 338/533 transitions.
RANDOM walk for 40000 steps (868 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (146 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (224 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (212 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (171 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 394245 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 4
Probabilistic random walk after 394245 steps, saw 185734 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
// Phase 1: matrix 338 rows 276 cols
[2025-05-30 02:30:15] [INFO ] Computed 35 invariants in 2 ms
[2025-05-30 02:30: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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 90/134 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/138 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 115/253 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 289/542 variables, 253/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 22/564 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 50/614 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/614 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/614 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 315 constraints, problems are : Problem set: 0 solved, 4 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 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 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 90/134 variables, 14/14 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 02:30:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:16] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/138 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 115/253 variables, 20/37 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 02:30:16] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 289/542 variables, 253/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 22/564 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 50/614 variables, 20/322 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 02:30:17] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:17] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 3/325 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 02:30:17] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/614 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/614 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 326 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2374ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 14350 ms.
Support contains 44 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 338/338 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 276/276 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 338/338 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2025-05-30 02:30:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:30:32] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 02:30:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:30:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:30:33] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:30:33] [INFO ] Redundant transitions in 1 ms returned []
Running 337 sub problems to find dead transitions.
[2025-05-30 02:30:33] [INFO ] Invariant cache hit.
[2025-05-30 02:30:33] [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/275 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:39] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:39] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:39] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:39] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:41] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:41] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:41] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:41] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:41] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:42] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:42] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:42] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:44] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:45] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:30:47] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 9 (OVERLAPS) 338/614 variables, 276/327 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 4/331 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 0/331 constraints. Problems are: Problem set: 36 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/614 variables, and 331 constraints, problems are : Problem set: 36 solved, 301 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 16/16 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/16 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 15/31 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 4/35 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 16/51 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/51 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 338/614 variables, 276/327 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 4/331 constraints. Problems are: Problem set: 36 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 301/632 constraints. Problems are: Problem set: 36 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:10] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:10] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:10] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 3/635 constraints. Problems are: Problem set: 36 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/614 variables, and 635 constraints, problems are : Problem set: 36 solved, 301 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 276/276 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 301/337 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 36 solved, 301 unsolved
Search for dead transitions found 36 dead transitions in 60075ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 276/276 places, 302/338 transitions.
Ensure Unique test removed 8 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 267 transition count 292
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 29 place count 257 transition count 292
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 257 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 256 transition count 291
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 256 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 255 transition count 290
Applied a total of 33 rules in 42 ms. Remains 255 /276 variables (removed 21) and now considering 290/302 (removed 12) transitions.
// Phase 1: matrix 290 rows 255 cols
[2025-05-30 02:31:33] [INFO ] Computed 36 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:31:33] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-30 02:31:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:31:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:31:33] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/276 places, 290/338 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60990 ms. Remains : 255/276 places, 290/338 transitions.
RANDOM walk for 40000 steps (949 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (149 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (204 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (213 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (184 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 370629 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 4
Probabilistic random walk after 370629 steps, saw 175373 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2025-05-30 02:31:36] [INFO ] Invariant cache hit.
[2025-05-30 02:31:36] [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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 104/148 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/152 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 102/254 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 290/544 variables, 254/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/545 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/545 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 295 constraints, problems are : Problem set: 0 solved, 4 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 255/255 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 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 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 104/148 variables, 16/16 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 02:31:37] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:37] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/152 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 102/254 variables, 19/38 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 02:31:37] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/39 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 02:31:37] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/40 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 02:31:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 290/544 variables, 254/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/545 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/545 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/545 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 304 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1716 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 255/255 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2110ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7188 ms.
Support contains 44 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 290/290 transitions.
Applied a total of 0 rules in 5 ms. Remains 255 /255 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 255/255 places, 290/290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 290/290 transitions.
Applied a total of 0 rules in 5 ms. Remains 255 /255 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2025-05-30 02:31:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:31:46] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-30 02:31:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:31:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:31:46] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:31:46] [INFO ] Redundant transitions in 1 ms returned []
Running 289 sub problems to find dead transitions.
[2025-05-30 02:31:46] [INFO ] Invariant cache hit.
[2025-05-30 02:31:46] [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/254 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:51] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:51] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:52] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:52] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:52] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:52] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:52] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:53] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:53] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:54] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:55] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:55] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:31:55] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD289 is UNSAT
At refinement iteration 8 (OVERLAPS) 290/545 variables, 255/306 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 4/310 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/545 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 310 constraints, problems are : Problem set: 1 solved, 288 unsolved in 28042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 255/255 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 17/31 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 5/36 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 15/51 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 290/545 variables, 255/306 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 4/310 constraints. Problems are: Problem set: 1 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 288/598 constraints. Problems are: Problem set: 1 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:26] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 599 constraints, problems are : Problem set: 1 solved, 288 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 255/255 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 288/289 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58107ms problems are : Problem set: 1 solved, 288 unsolved
Search for dead transitions found 1 dead transitions in 58107ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 255/255 places, 289/290 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 255 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 288
Applied a total of 2 rules in 18 ms. Remains 254 /255 variables (removed 1) and now considering 288/289 (removed 1) transitions.
// Phase 1: matrix 288 rows 254 cols
[2025-05-30 02:32:44] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:32:44] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 02:32:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:32:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:32:45] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 254/255 places, 288/290 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58970 ms. Remains : 254/255 places, 288/290 transitions.
RANDOM walk for 40000 steps (935 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (160 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (209 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (224 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (193 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 297752 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 4
Probabilistic random walk after 297752 steps, saw 189462 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2025-05-30 02:32:48] [INFO ] Invariant cache hit.
[2025-05-30 02:32:48] [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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/142 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/146 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 108/254 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 288/542 variables, 254/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/542 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 295 constraints, problems are : Problem set: 0 solved, 4 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 254/254 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 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 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/142 variables, 16/16 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 02:32:48] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:48] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/146 variables, 1/19 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 02:32:48] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 108/254 variables, 20/40 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 02:32:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 288/542 variables, 254/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/542 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 304 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 254/254 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1667ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3448 ms.
Support contains 44 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 288/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 254/254 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2025-05-30 02:32:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:32:53] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 02:32:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:32:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:32:53] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:32:53] [INFO ] Redundant transitions in 19 ms returned []
Running 287 sub problems to find dead transitions.
[2025-05-30 02:32:53] [INFO ] Invariant cache hit.
[2025-05-30 02:32:53] [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/253 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:58] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:58] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:59] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:59] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:59] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:32:59] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:00] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:00] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:00] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:01] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:01] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:01] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:01] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 288/542 variables, 254/306 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:07] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 11 (OVERLAPS) 0/542 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 311 constraints, problems are : Problem set: 0 solved, 287 unsolved in 28522 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 254/254 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (OVERLAPS) 288/542 variables, 254/307 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 287/598 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:32] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 599 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 254/254 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58588ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 58590ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59012 ms. Remains : 254/254 places, 288/288 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 253 transition count 287
Applied a total of 2 rules in 6 ms. Remains 253 /254 variables (removed 1) and now considering 287/288 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 287 rows 253 cols
[2025-05-30 02:33:52] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 02:33:52] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 02:33:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-05-30 02:33:52] [INFO ] [Nat]Absence check using 15 positive and 22 generalized place invariants in 9 ms returned sat
[2025-05-30 02:33:52] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:52] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
[2025-05-30 02:33:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:53] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
[2025-05-30 02:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:53] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 5 ms to minimize.
[2025-05-30 02:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:33:53] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
[2025-05-30 02:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
TRAPS : Iteration 2
[2025-05-30 02:33:53] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-30 02:33:53] [INFO ] After 1274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-05-30 02:33:53] [INFO ] Flatten gal took : 16 ms
[2025-05-30 02:33:53] [INFO ] Flatten gal took : 15 ms
[2025-05-30 02:33:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5610480234670571625.gal : 3 ms
[2025-05-30 02:33:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1792607744382573082.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5610480234670571625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1792607744382573082.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1792607744382573082.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :9 after 12
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :12 after 190
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :190 after 29944
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :29944 after 30822
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :30822 after 87869
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :87869 after 1.12898e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.12898e+06 after 4.25009e+06
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.25009e+06 after 1.41451e+07
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.41451e+07 after 1.14466e+08
Detected timeout of ITS tools.
[2025-05-30 02:34:08] [INFO ] Flatten gal took : 26 ms
[2025-05-30 02:34:08] [INFO ] Applying decomposition
[2025-05-30 02:34:08] [INFO ] Flatten gal took : 20 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/graph1305317850295495465.txt' '-o' '/tmp/graph1305317850295495465.bin' '-w' '/tmp/graph1305317850295495465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1305317850295495465.bin' '-l' '-1' '-v' '-w' '/tmp/graph1305317850295495465.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:34:09] [INFO ] Decomposing Gal with order
[2025-05-30 02:34:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:34:09] [INFO ] Removed a total of 168 redundant transitions.
[2025-05-30 02:34:09] [INFO ] Flatten gal took : 58 ms
[2025-05-30 02:34:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 16 ms.
[2025-05-30 02:34:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4309051528819571693.gal : 4 ms
[2025-05-30 02:34:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality489002794237067300.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/ReachabilityCardinality4309051528819571693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality489002794237067300.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 ...306
Loading property file /tmp/ReachabilityCardinality489002794237067300.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 190
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :190 after 15121
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :15121 after 400202
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.30047e+08 after 4.03436e+08
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5.62905e+09 after 1.05104e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31796 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 02:34:24] [INFO ] Flatten gal took : 55 ms
[2025-05-30 02:34:24] [INFO ] Applying decomposition
[2025-05-30 02:34:24] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6600154130205731478.txt' '-o' '/tmp/graph6600154130205731478.bin' '-w' '/tmp/graph6600154130205731478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6600154130205731478.bin' '-l' '-1' '-v' '-w' '/tmp/graph6600154130205731478.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:34:24] [INFO ] Decomposing Gal with order
[2025-05-30 02:34:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:34:25] [INFO ] Removed a total of 1824 redundant transitions.
[2025-05-30 02:34:25] [INFO ] Flatten gal took : 89 ms
[2025-05-30 02:34:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 22 ms.
[2025-05-30 02:34:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17263508524308070233.gal : 14 ms
[2025-05-30 02:34:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11904702009200089081.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17263508524308070233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11904702009200089081.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/ReachabilityCardinality11904702009200089081.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 750
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :750 after 4.66053e+09
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :4.66053e+09 after 8.37103e+10
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8.37103e+10 after 3.48117e+11
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.48117e+11 after 9.41886e+11
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.25504e+12 after 1.33482e+13
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.03295e+14 after 2.51119e+14
Detected timeout of ITS tools.
[2025-05-30 03:04:25] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9204059062679423910
[2025-05-30 03:04:25] [INFO ] Applying decomposition
[2025-05-30 03:04:25] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:04:25] [INFO ] Computing symmetric may disable matrix : 288 transitions.
[2025-05-30 03:04:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:04:25] [INFO ] Computing symmetric may enable matrix : 288 transitions.
[2025-05-30 03:04:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph4653713199901504681.txt' '-o' '/tmp/graph4653713199901504681.bin' '-w' '/tmp/graph4653713199901504681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4653713199901504681.bin' '-l' '-1' '-v' '-w' '/tmp/graph4653713199901504681.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:04:25] [INFO ] Decomposing Gal with order
[2025-05-30 03:04:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:04:25] [INFO ] Removed a total of 165 redundant transitions.
[2025-05-30 03:04:25] [INFO ] Flatten gal took : 22 ms
[2025-05-30 03:04:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2025-05-30 03:04:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4068384125410117126.gal : 3 ms
[2025-05-30 03:04:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15557703380671400384.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/ReachabilityCardinality4068384125410117126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15557703380671400384.prop' '--nowitness'
[2025-05-30 03:04:25] [INFO ] Computing Do-Not-Accords matrix : 288 transitions.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2025-05-30 03:04:25] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Loading property file /tmp/ReachabilityCardinality15557703380671400384.prop.
[2025-05-30 03:04:25] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9204059062679423910
Running compilation step : cd /tmp/ltsmin9204059062679423910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 68
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :68 after 948
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :948 after 204445
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :204445 after 2.29767e+06
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.29767e+06 after 9.4889e+06
Compilation finished in 749 ms.
Running link step : cd /tmp/ltsmin9204059062679423910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202308==true'
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :9.4889e+06 after 2.14718e+07
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.53012e+07 after 3.42226e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :9.78721e+08 after 1.23266e+09
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202308==true'
Running LTSmin : cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202311==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202311==true'
Running LTSmin : cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202314==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202314==true'
Running LTSmin : cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202415==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202415==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9204059062679423910;'/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' 'ASLinkPT03aReachabilityCardinality202308==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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