Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117700039.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is ASLink-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 417K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717188085294

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:41:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:41:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:41:28] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2024-05-31 20:41:28] [INFO ] Transformed 1242 places.
[2024-05-31 20:41:28] [INFO ] Transformed 1621 transitions.
[2024-05-31 20:41:28] [INFO ] Found NUPN structural information;
[2024-05-31 20:41:28] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 767 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (157 resets) in 2451 ms. (16 steps per ms) remains 11/16 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 754 ms. (52 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 524 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (36 resets) in 974 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (27 resets) in 1051 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (30 resets) in 251 ms. (158 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 240 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (32 resets) in 348 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
// Phase 1: matrix 1621 rows 1242 cols
[2024-05-31 20:41:31] [INFO ] Computed 121 invariants in 217 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 259/449 variables, 21/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 259/470 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 33/482 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 33/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 747/1229 variables, 90/599 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 747/1346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 13/1242 variables, 4/1350 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 13/1363 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1621/2863 variables, 1242/2605 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 2605 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5065 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 259/449 variables, 21/211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 259/470 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 20:41:37] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 33/482 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 33/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 747/1229 variables, 90/600 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 747/1347 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 20:41:39] [INFO ] Deduced a trap composed of 99 places in 779 ms of which 15 ms to minimize.
[2024-05-31 20:41:40] [INFO ] Deduced a trap composed of 53 places in 880 ms of which 12 ms to minimize.
[2024-05-31 20:41:41] [INFO ] Deduced a trap composed of 67 places in 857 ms of which 12 ms to minimize.
[2024-05-31 20:41:42] [INFO ] Deduced a trap composed of 56 places in 625 ms of which 10 ms to minimize.
SMT process timed out in 11200ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1242 transition count 1416
Reduce places removed 205 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 212 rules applied. Total rules applied 417 place count 1037 transition count 1409
Reduce places removed 1 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 21 rules applied. Total rules applied 438 place count 1036 transition count 1389
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 459 place count 1016 transition count 1388
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 234 Pre rules applied. Total rules applied 459 place count 1016 transition count 1154
Deduced a syphon composed of 234 places in 11 ms
Ensure Unique test removed 17 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 4 with 485 rules applied. Total rules applied 944 place count 765 transition count 1154
Discarding 5 places :
Implicit places reduction removed 5 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 4 with 17 rules applied. Total rules applied 961 place count 760 transition count 1142
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 14 rules applied. Total rules applied 975 place count 748 transition count 1140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 977 place count 746 transition count 1140
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 977 place count 746 transition count 1133
Deduced a syphon composed of 7 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 994 place count 736 transition count 1133
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 994 place count 736 transition count 1130
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1000 place count 733 transition count 1130
Discarding 34 places :
Symmetric choice reduction at 7 with 34 rule applications. Total rules 1034 place count 699 transition count 1096
Iterating global reduction 7 with 34 rules applied. Total rules applied 1068 place count 699 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1069 place count 699 transition count 1095
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 1069 place count 699 transition count 1085
Deduced a syphon composed of 10 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1090 place count 688 transition count 1085
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1090 place count 688 transition count 1084
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1093 place count 686 transition count 1084
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1096 place count 683 transition count 1063
Iterating global reduction 8 with 3 rules applied. Total rules applied 1099 place count 683 transition count 1063
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1099 place count 683 transition count 1061
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1103 place count 681 transition count 1061
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 8 with 127 rules applied. Total rules applied 1230 place count 617 transition count 998
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1232 place count 616 transition count 1007
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1233 place count 616 transition count 1006
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1234 place count 616 transition count 1005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1235 place count 615 transition count 1005
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1236 place count 615 transition count 1004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1237 place count 614 transition count 1004
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1240 place count 614 transition count 1004
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1241 place count 613 transition count 1003
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1243 place count 611 transition count 1003
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 1243 place count 611 transition count 1000
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1249 place count 608 transition count 1000
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 11 with 1 rules applied. Total rules applied 1250 place count 607 transition count 1000
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1254 place count 605 transition count 998
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1255 place count 605 transition count 997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1256 place count 604 transition count 997
Applied a total of 1256 rules in 1094 ms. Remains 604 /1242 variables (removed 638) and now considering 997/1621 (removed 624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1113 ms. Remains : 604/1242 places, 997/1621 transitions.
RANDOM walk for 40000 steps (336 resets) in 533 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (102 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (108 resets) in 254 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (102 resets) in 434 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (97 resets) in 260 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (110 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (101 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (106 resets) in 151 ms. (263 steps per ms) remains 9/10 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (80 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (105 resets) in 201 ms. (198 steps per ms) remains 9/9 properties
// Phase 1: matrix 997 rows 604 cols
[2024-05-31 20:41:44] [INFO ] Computed 90 invariants in 66 ms
[2024-05-31 20:41:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 192/346 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/348 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 253/601 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/603 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/604 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 997/1601 variables, 604/694 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1601 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1601 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1601 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1601/1601 variables, and 695 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3795 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 604/604 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 192/346 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:41:48] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/348 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 253/601 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:41:49] [INFO ] Deduced a trap composed of 108 places in 345 ms of which 7 ms to minimize.
[2024-05-31 20:41:50] [INFO ] Deduced a trap composed of 82 places in 379 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:41:50] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:41:51] [INFO ] Deduced a trap composed of 81 places in 520 ms of which 7 ms to minimize.
[2024-05-31 20:41:52] [INFO ] Deduced a trap composed of 107 places in 519 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:41:52] [INFO ] Deduced a trap composed of 32 places in 540 ms of which 10 ms to minimize.
[2024-05-31 20:41:53] [INFO ] Deduced a trap composed of 47 places in 404 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/603 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/603 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/604 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:41:55] [INFO ] Deduced a trap composed of 96 places in 423 ms of which 6 ms to minimize.
[2024-05-31 20:41:55] [INFO ] Deduced a trap composed of 76 places in 418 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/604 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2023-01 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-03 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-06 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-11 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-15 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 16 (OVERLAPS) 997/1601 variables, 604/704 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1601 variables, 1/705 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1601 variables, 2/707 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-31 20:42:06] [INFO ] Deduced a trap composed of 128 places in 460 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1601 variables, 1/708 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1601 variables, 0/708 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1601 variables, 0/708 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1601/1601 variables, and 708 constraints, problems are : Problem set: 7 solved, 2 unsolved in 19060 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 604/604 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 11/11 constraints]
After SMT, in 23130ms problems are : Problem set: 7 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5501 ms.
Support contains 50 out of 604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 604/604 places, 997/997 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 604 transition count 981
Reduce places removed 17 places and 0 transitions.
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 38 place count 586 transition count 977
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 583 transition count 977
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 41 place count 583 transition count 917
Deduced a syphon composed of 60 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 165 place count 519 transition count 917
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 517 transition count 917
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 515 transition count 915
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 515 transition count 915
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 514 transition count 914
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 514 transition count 914
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 195 place count 503 transition count 903
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 198 place count 503 transition count 900
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 201 place count 500 transition count 900
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 500 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 499 transition count 899
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 205 place count 497 transition count 897
Applied a total of 205 rules in 180 ms. Remains 497 /604 variables (removed 107) and now considering 897/997 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 497/604 places, 897/997 transitions.
RANDOM walk for 40000 steps (573 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (168 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (136 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 264524 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 264524 steps, saw 64006 distinct states, run finished after 3013 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 897 rows 497 cols
[2024-05-31 20:42:16] [INFO ] Computed 81 invariants in 53 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/201 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/207 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 264/471 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/476 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/497 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 897/1394 variables, 497/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1394 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:42:18] [INFO ] Deduced a trap composed of 24 places in 465 ms of which 7 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1394 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1394 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1394 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1394/1394 variables, and 579 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1783 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/201 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/207 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 264/471 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/476 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/497 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 897/1394 variables, 497/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1394 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1394 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1394 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1394/1394 variables, and 581 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3369 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 5236ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2000 ms.
Support contains 50 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 897/897 transitions.
Applied a total of 0 rules in 38 ms. Remains 497 /497 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 497/497 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 897/897 transitions.
Applied a total of 0 rules in 28 ms. Remains 497 /497 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2024-05-31 20:42:23] [INFO ] Invariant cache hit.
[2024-05-31 20:42:24] [INFO ] Implicit Places using invariants in 838 ms returned [3, 22, 43, 61, 79, 158, 162, 163, 174, 175, 177, 196, 215, 257, 296, 300, 301, 304, 316, 317, 318, 354, 356, 361, 381, 386, 387, 400, 406, 412, 418, 424, 430, 437, 443, 449, 455]
[2024-05-31 20:42:24] [INFO ] Actually due to overlaps returned [354, 318, 43, 61, 196, 361, 177, 174, 316, 175, 317, 356, 381, 3, 300, 301, 22, 79, 215, 386, 430, 449, 162, 163, 304, 387, 400, 406, 412, 418, 424, 437, 443, 455]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 853 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 463/497 places, 897/897 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 460 transition count 863
Reduce places removed 34 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 58 rules applied. Total rules applied 95 place count 426 transition count 839
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 120 place count 402 transition count 838
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 120 place count 402 transition count 829
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 138 place count 393 transition count 829
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 147 place count 384 transition count 820
Iterating global reduction 3 with 9 rules applied. Total rules applied 156 place count 384 transition count 820
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 382 transition count 816
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 382 transition count 816
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 212 place count 356 transition count 790
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 354 transition count 788
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 354 transition count 788
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 218 place count 354 transition count 786
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 353 transition count 787
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 233 place count 353 transition count 774
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 247 place count 339 transition count 774
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 339 transition count 773
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 339 transition count 773
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 252 place count 339 transition count 773
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 253 place count 338 transition count 772
Iterating global reduction 5 with 1 rules applied. Total rules applied 254 place count 338 transition count 772
Applied a total of 254 rules in 176 ms. Remains 338 /463 variables (removed 125) and now considering 772/897 (removed 125) transitions.
// Phase 1: matrix 772 rows 338 cols
[2024-05-31 20:42:24] [INFO ] Computed 43 invariants in 6 ms
[2024-05-31 20:42:25] [INFO ] Implicit Places using invariants in 331 ms returned [87, 110, 116, 119, 121, 127, 128, 187, 208, 224, 325, 328, 331, 334, 337]
[2024-05-31 20:42:25] [INFO ] Actually due to overlaps returned [127, 128, 116, 121, 87, 110, 187, 208, 224, 325, 328, 331, 334, 337]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 335 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 324/497 places, 772/897 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 323 transition count 771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 317 transition count 765
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 317 transition count 765
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 313 transition count 761
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 313 transition count 761
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 313 transition count 758
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 33 place count 309 transition count 754
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 38 place count 309 transition count 749
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 43 place count 304 transition count 749
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 304 transition count 748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 303 transition count 748
Applied a total of 45 rules in 131 ms. Remains 303 /324 variables (removed 21) and now considering 748/772 (removed 24) transitions.
// Phase 1: matrix 748 rows 303 cols
[2024-05-31 20:42:25] [INFO ] Computed 29 invariants in 7 ms
[2024-05-31 20:42:25] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-31 20:42:25] [INFO ] Invariant cache hit.
[2024-05-31 20:42:26] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 303/497 places, 748/897 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2752 ms. Remains : 303/497 places, 748/897 transitions.
RANDOM walk for 40000 steps (733 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (261 resets) in 101 ms. (392 steps per ms) remains 1/2 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (180 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2024-05-31 20:42:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/159 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 143/302 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 748/1051 variables, 303/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1051 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1051 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1051/1051 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/159 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 143/302 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 748/1051 variables, 303/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1051 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1051 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1051 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1051/1051 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 168 ms.
Support contains 23 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 748/748 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 303 transition count 742
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 297 transition count 742
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 12 place count 297 transition count 730
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 36 place count 285 transition count 730
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 284 transition count 730
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 37 place count 284 transition count 729
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 39 place count 283 transition count 729
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 281 transition count 727
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 281 transition count 727
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 54 place count 275 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 275 transition count 721
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 275 transition count 719
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 273 transition count 719
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 273 transition count 716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 270 transition count 716
Applied a total of 65 rules in 72 ms. Remains 270 /303 variables (removed 33) and now considering 716/748 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 270/303 places, 716/748 transitions.
RANDOM walk for 40000 steps (855 resets) in 1111 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (190 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 460955 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 460955 steps, saw 193533 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
// Phase 1: matrix 716 rows 270 cols
[2024-05-31 20:42:34] [INFO ] Computed 27 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/113 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/126 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/270 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 716/986 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/986 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/113 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:42:34] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/126 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/270 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 716/986 variables, 270/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/986 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/986 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 986/986 variables, and 299 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 23 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 716/716 transitions.
Applied a total of 0 rules in 14 ms. Remains 270 /270 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 270/270 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 716/716 transitions.
Applied a total of 0 rules in 12 ms. Remains 270 /270 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-31 20:42:35] [INFO ] Invariant cache hit.
[2024-05-31 20:42:35] [INFO ] Implicit Places using invariants in 325 ms returned [21, 179, 266, 267]
[2024-05-31 20:42:35] [INFO ] Actually due to overlaps returned [266, 21, 179]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 327 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 267/270 places, 716/716 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 266 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 266 transition count 715
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 266 transition count 714
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 265 transition count 714
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 263 transition count 712
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 263 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 262 transition count 711
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 262 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 261 transition count 710
Applied a total of 12 rules in 56 ms. Remains 261 /267 variables (removed 6) and now considering 710/716 (removed 6) transitions.
// Phase 1: matrix 710 rows 261 cols
[2024-05-31 20:42:35] [INFO ] Computed 24 invariants in 8 ms
[2024-05-31 20:42:36] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-31 20:42:36] [INFO ] Invariant cache hit.
[2024-05-31 20:42:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:42:37] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 261/270 places, 710/716 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1829 ms. Remains : 261/270 places, 710/716 transitions.
RANDOM walk for 40000 steps (846 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (212 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 432164 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 432164 steps, saw 182603 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2024-05-31 20:42:40] [INFO ] Invariant cache hit.
[2024-05-31 20:42:40] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/141 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/153 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/261 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 710/971 variables, 261/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/971 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 971/971 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 261/261 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/141 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:42:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/153 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 108/261 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:42:41] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 710/971 variables, 261/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/971 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/971 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/971 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/971 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 971/971 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4795 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 261/261 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 5241ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 270 ms.
Support contains 23 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 710/710 transitions.
Applied a total of 0 rules in 8 ms. Remains 261 /261 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 261/261 places, 710/710 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 710/710 transitions.
Applied a total of 0 rules in 7 ms. Remains 261 /261 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-05-31 20:42:46] [INFO ] Invariant cache hit.
[2024-05-31 20:42:46] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-31 20:42:46] [INFO ] Invariant cache hit.
[2024-05-31 20:42:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:42:47] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
[2024-05-31 20:42:47] [INFO ] Redundant transitions in 72 ms returned []
Running 692 sub problems to find dead transitions.
[2024-05-31 20:42:47] [INFO ] Invariant cache hit.
[2024-05-31 20:42:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (OVERLAPS) 2/261 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 692 unsolved
[2024-05-31 20:43:08] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 5 ms to minimize.
[2024-05-31 20:43:08] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
[2024-05-31 20:43:08] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:43:09] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2024-05-31 20:43:09] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:43:12] [INFO ] Deduced a trap composed of 109 places in 262 ms of which 4 ms to minimize.
[2024-05-31 20:43:14] [INFO ] Deduced a trap composed of 68 places in 222 ms of which 2 ms to minimize.
[2024-05-31 20:43:14] [INFO ] Deduced a trap composed of 72 places in 280 ms of which 3 ms to minimize.
[2024-05-31 20:43:15] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 1 ms to minimize.
[2024-05-31 20:43:16] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 261/971 variables, and 34 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/261 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 692 unsolved
[2024-05-31 20:43:33] [INFO ] Deduced a trap composed of 70 places in 365 ms of which 4 ms to minimize.
[2024-05-31 20:43:34] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 9 (OVERLAPS) 710/971 variables, 261/297 constraints. Problems are: Problem set: 21 solved, 671 unsolved
SMT process timed out in 60829ms, After SMT, problems are : Problem set: 21 solved, 671 unsolved
Search for dead transitions found 21 dead transitions in 60846ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 261/261 places, 689/710 transitions.
Applied a total of 0 rules in 14 ms. Remains 261 /261 variables (removed 0) and now considering 689/689 (removed 0) transitions.
[2024-05-31 20:43:48] [INFO ] Redundant transitions in 52 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62686 ms. Remains : 261/261 places, 689/710 transitions.
RANDOM walk for 40000 steps (866 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (202 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 444371 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 1
Probabilistic random walk after 444371 steps, saw 188089 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 689 rows 261 cols
[2024-05-31 20:43:51] [INFO ] Computed 24 invariants in 11 ms
[2024-05-31 20:43:51] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/141 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/153 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/261 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 689/950 variables, 261/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/950 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/950 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/950 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 950/950 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 261/261 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/141 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:43:52] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:43:52] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/153 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/261 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:43:52] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 689/950 variables, 261/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/950 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/950 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/950 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/950 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 950/950 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 261/261 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1767ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 23 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 689/689 transitions.
Applied a total of 0 rules in 12 ms. Remains 261 /261 variables (removed 0) and now considering 689/689 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 261/261 places, 689/689 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 689/689 transitions.
Applied a total of 0 rules in 19 ms. Remains 261 /261 variables (removed 0) and now considering 689/689 (removed 0) transitions.
[2024-05-31 20:43:53] [INFO ] Invariant cache hit.
[2024-05-31 20:43:53] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-31 20:43:53] [INFO ] Invariant cache hit.
[2024-05-31 20:43:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:43:54] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2024-05-31 20:43:54] [INFO ] Redundant transitions in 8 ms returned []
Running 671 sub problems to find dead transitions.
[2024-05-31 20:43:54] [INFO ] Invariant cache hit.
[2024-05-31 20:43:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-31 20:44:00] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:44:00] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-05-31 20:44:00] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
[2024-05-31 20:44:03] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 2 ms to minimize.
Problem TDEAD253 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 4/22 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/22 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 4/26 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 2/28 constraints. Problems are: Problem set: 28 solved, 643 unsolved
[2024-05-31 20:44:16] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 4 ms to minimize.
[2024-05-31 20:44:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:44:16] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:44:16] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:44:16] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:44:17] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:44:19] [INFO ] Deduced a trap composed of 101 places in 230 ms of which 3 ms to minimize.
[2024-05-31 20:44:20] [INFO ] Deduced a trap composed of 94 places in 220 ms of which 3 ms to minimize.
[2024-05-31 20:44:20] [INFO ] Deduced a trap composed of 78 places in 237 ms of which 3 ms to minimize.
[2024-05-31 20:44:21] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 3 ms to minimize.
[2024-05-31 20:44:22] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2024-05-31 20:44:23] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 timeout
0.0)
(s206 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 12/40 constraints. Problems are: Problem set: 28 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 261/950 variables, and 40 constraints, problems are : Problem set: 28 solved, 643 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/261 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 28 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 6/6 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 12/18 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 7/25 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/25 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 4/29 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 2/31 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 9/40 constraints. Problems are: Problem set: 28 solved, 643 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/40 constraints. Problems are: Problem set: 28 solved, 643 unsolved
Problem TDEAD20 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 TDEAD32 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 TDEAD40 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 TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 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 TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 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 TDEAD122 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 TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 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
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 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 TDEAD174 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 TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 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 TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 8 (OVERLAPS) 689/950 variables, 261/301 constraints. Problems are: Problem set: 196 solved, 475 unsolved
SMT process timed out in 60495ms, After SMT, problems are : Problem set: 196 solved, 475 unsolved
Search for dead transitions found 196 dead transitions in 60503ms
Found 196 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 196 transitions
Dead transitions reduction (with SMT) removed 196 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 261/261 places, 493/689 transitions.
Applied a total of 0 rules in 6 ms. Remains 261 /261 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-05-31 20:44:55] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61609 ms. Remains : 261/261 places, 493/689 transitions.
RANDOM walk for 40000 steps (864 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (221 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 532139 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 532139 steps, saw 222414 distinct states, run finished after 3006 ms. (steps per millisecond=177 ) properties seen :0
// Phase 1: matrix 493 rows 261 cols
[2024-05-31 20:44:58] [INFO ] Computed 27 invariants in 6 ms
[2024-05-31 20:44:58] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/141 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/261 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 493/754 variables, 261/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/754 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 261/261 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/141 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/261 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:44:59] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 4 ms to minimize.
[2024-05-31 20:44:59] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 5 ms to minimize.
[2024-05-31 20:45:00] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 4 ms to minimize.
[2024-05-31 20:45:00] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 493/754 variables, 261/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/754 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/754 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 261/261 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2870ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13659 ms.
Support contains 23 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 493/493 transitions.
Applied a total of 0 rules in 6 ms. Remains 261 /261 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 261/261 places, 493/493 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 493/493 transitions.
Applied a total of 0 rules in 5 ms. Remains 261 /261 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-05-31 20:45:14] [INFO ] Invariant cache hit.
[2024-05-31 20:45:15] [INFO ] Implicit Places using invariants in 375 ms returned [36, 39, 41, 43, 145, 147, 150, 151]
[2024-05-31 20:45:15] [INFO ] Actually due to overlaps returned [36, 39, 41, 43, 151]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 380 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/261 places, 493/493 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 255 transition count 492
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 253 transition count 490
Applied a total of 6 rules in 13 ms. Remains 253 /256 variables (removed 3) and now considering 490/493 (removed 3) transitions.
// Phase 1: matrix 490 rows 253 cols
[2024-05-31 20:45:15] [INFO ] Computed 22 invariants in 6 ms
[2024-05-31 20:45:15] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-31 20:45:15] [INFO ] Invariant cache hit.
[2024-05-31 20:45:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:45:16] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned [100, 103, 105, 107, 109, 111, 113]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 1415 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 246/261 places, 490/493 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 241 transition count 410
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 241 transition count 410
Applied a total of 10 rules in 14 ms. Remains 241 /246 variables (removed 5) and now considering 410/490 (removed 80) transitions.
// Phase 1: matrix 410 rows 241 cols
[2024-05-31 20:45:16] [INFO ] Computed 21 invariants in 5 ms
[2024-05-31 20:45:17] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-31 20:45:17] [INFO ] Invariant cache hit.
[2024-05-31 20:45:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:45:17] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 241/261 places, 410/493 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3099 ms. Remains : 241/261 places, 410/493 transitions.
RANDOM walk for 40000 steps (851 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (232 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 634121 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 634121 steps, saw 268325 distinct states, run finished after 3004 ms. (steps per millisecond=211 ) properties seen :0
[2024-05-31 20:45:21] [INFO ] Invariant cache hit.
[2024-05-31 20:45:21] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/227 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/228 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 409/637 variables, 228/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/637 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/651 variables, 13/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/651 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/651 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 241/241 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:45:21] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-31 20:45:21] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/151 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/227 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:45:21] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-31 20:45:21] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/228 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 409/637 variables, 228/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/637 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/651 variables, 13/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/651 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/651 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/651 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 241/241 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1390ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 23 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 410/410 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 241/241 places, 410/410 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 410/410 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2024-05-31 20:45:22] [INFO ] Invariant cache hit.
[2024-05-31 20:45:22] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-31 20:45:22] [INFO ] Invariant cache hit.
[2024-05-31 20:45:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:45:23] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2024-05-31 20:45:23] [INFO ] Redundant transitions in 5 ms returned []
Running 392 sub problems to find dead transitions.
[2024-05-31 20:45:23] [INFO ] Invariant cache hit.
[2024-05-31 20:45:23] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 2/241 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-31 20:45:32] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 3 ms to minimize.
[2024-05-31 20:45:32] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:45:32] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:45:32] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:45:32] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:45:32] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:45:33] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:45:33] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:45:33] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:45:34] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-31 20:45:34] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
[2024-05-31 20:45:34] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-31 20:45:34] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 3 ms to minimize.
[2024-05-31 20:45:34] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-31 20:45:34] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-31 20:45:34] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-31 20:45:34] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:45:35] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-31 20:45:35] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
[2024-05-31 20:45:35] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 20/41 constraints. Problems are: Problem set: 55 solved, 337 unsolved
[2024-05-31 20:45:36] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 3 ms to minimize.
[2024-05-31 20:45:37] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
[2024-05-31 20:45:37] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
[2024-05-31 20:45:39] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
Problem TDEAD329 is UNSAT
[2024-05-31 20:45:39] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:45:39] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 6/47 constraints. Problems are: Problem set: 77 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/47 constraints. Problems are: Problem set: 77 solved, 315 unsolved
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 8 (OVERLAPS) 410/651 variables, 241/288 constraints. Problems are: Problem set: 121 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 2/290 constraints. Problems are: Problem set: 121 solved, 271 unsolved
[2024-05-31 20:45:50] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:45:50] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD202 is UNSAT
[2024-05-31 20:45:51] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 3/293 constraints. Problems are: Problem set: 131 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/651 variables, and 293 constraints, problems are : Problem set: 131 solved, 261 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 241/241 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 131 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 4/4 constraints. Problems are: Problem set: 131 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 10/14 constraints. Problems are: Problem set: 131 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 18/32 constraints. Problems are: Problem set: 131 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/32 constraints. Problems are: Problem set: 131 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 2/241 variables, 6/38 constraints. Problems are: Problem set: 131 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 1/39 constraints. Problems are: Problem set: 131 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 11/50 constraints. Problems are: Problem set: 131 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/50 constraints. Problems are: Problem set: 131 solved, 261 unsolved
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD162 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 TDEAD334 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 8 (OVERLAPS) 410/651 variables, 241/291 constraints. Problems are: Problem set: 147 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 2/293 constraints. Problems are: Problem set: 147 solved, 245 unsolved
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD233 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 245/538 constraints. Problems are: Problem set: 150 solved, 242 unsolved
[2024-05-31 20:46:04] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 4 ms to minimize.
[2024-05-31 20:46:04] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 2/540 constraints. Problems are: Problem set: 150 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 540 constraints, problems are : Problem set: 150 solved, 242 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 241/241 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 245/392 constraints, Known Traps: 31/31 constraints]
After SMT, in 60262ms problems are : Problem set: 150 solved, 242 unsolved
Search for dead transitions found 150 dead transitions in 60270ms
Found 150 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 150 transitions
Dead transitions reduction (with SMT) removed 150 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 241/241 places, 260/410 transitions.
Ensure Unique test removed 21 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 216 transition count 235
Reduce places removed 25 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 32 rules applied. Total rules applied 82 place count 191 transition count 228
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 89 place count 184 transition count 228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 184 transition count 227
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 91 place count 183 transition count 227
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 183 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 181 transition count 225
Applied a total of 95 rules in 20 ms. Remains 181 /241 variables (removed 60) and now considering 225/260 (removed 35) transitions.
// Phase 1: matrix 225 rows 181 cols
[2024-05-31 20:46:23] [INFO ] Computed 23 invariants in 2 ms
[2024-05-31 20:46:24] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-31 20:46:24] [INFO ] Invariant cache hit.
[2024-05-31 20:46:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 20:46:24] [INFO ] Implicit Places using invariants and state equation in 413 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 753 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 180/241 places, 225/410 transitions.
Applied a total of 0 rules in 4 ms. Remains 180 /180 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62106 ms. Remains : 180/241 places, 225/410 transitions.
RANDOM walk for 40000 steps (921 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (240 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 923051 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :0 out of 1
Probabilistic random walk after 923051 steps, saw 347533 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
// Phase 1: matrix 225 rows 180 cols
[2024-05-31 20:46:27] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 20:46:27] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/133 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/180 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 225/405 variables, 180/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 12/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/405 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 180/180 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/133 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/180 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:28] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 225/405 variables, 180/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 12/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/405 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 180/180 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 758ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 980 ms.
Support contains 23 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 180 /180 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 180/180 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 180 /180 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-31 20:46:29] [INFO ] Invariant cache hit.
[2024-05-31 20:46:29] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-31 20:46:29] [INFO ] Invariant cache hit.
[2024-05-31 20:46:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 20:46:29] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-31 20:46:29] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-31 20:46:29] [INFO ] Invariant cache hit.
[2024-05-31 20:46:29] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/180 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-31 20:46:35] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:46:36] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Problem TDEAD48 is UNSAT
At refinement iteration 6 (OVERLAPS) 225/405 variables, 180/211 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 12/223 constraints. Problems are: Problem set: 1 solved, 206 unsolved
[2024-05-31 20:46:42] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/405 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 224 constraints, problems are : Problem set: 1 solved, 206 unsolved in 18515 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 180/180 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 12/18 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 2/20 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 2/180 variables, 4/24 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 8/32 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 225/405 variables, 180/212 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 12/224 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 206/430 constraints. Problems are: Problem set: 1 solved, 206 unsolved
[2024-05-31 20:46:54] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 1/431 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/431 constraints. Problems are: Problem set: 1 solved, 206 unsolved
At refinement iteration 12 (OVERLAPS) 0/405 variables, 0/431 constraints. Problems are: Problem set: 1 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 431 constraints, problems are : Problem set: 1 solved, 206 unsolved in 27819 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 180/180 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 206/207 constraints, Known Traps: 11/11 constraints]
After SMT, in 46426ms problems are : Problem set: 1 solved, 206 unsolved
Search for dead transitions found 1 dead transitions in 46429ms
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 : 180/180 places, 224/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 180 /180 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-31 20:47:16] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46966 ms. Remains : 180/180 places, 224/225 transitions.
RANDOM walk for 40000 steps (925 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (238 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 990221 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 1
Probabilistic random walk after 990221 steps, saw 371604 distinct states, run finished after 3004 ms. (steps per millisecond=329 ) properties seen :0
// Phase 1: matrix 224 rows 180 cols
[2024-05-31 20:47:19] [INFO ] Computed 23 invariants in 3 ms
[2024-05-31 20:47:19] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/121 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/134 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/180 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 224/404 variables, 180/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 12/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/404 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 180/180 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/121 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:19] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/134 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 46/180 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:47:19] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 224/404 variables, 180/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 12/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/404 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 180/180 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 833ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 23 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 180 /180 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 180/180 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 180 /180 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-31 20:47:20] [INFO ] Invariant cache hit.
[2024-05-31 20:47:20] [INFO ] Implicit Places using invariants in 299 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 301 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/180 places, 224/224 transitions.
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 10 rules applied. Total rules applied 10 place count 179 transition count 214
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 169 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 168 transition count 213
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 168 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 167 transition count 212
Applied a total of 24 rules in 13 ms. Remains 167 /179 variables (removed 12) and now considering 212/224 (removed 12) transitions.
// Phase 1: matrix 212 rows 167 cols
[2024-05-31 20:47:20] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 20:47:20] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-31 20:47:20] [INFO ] Invariant cache hit.
[2024-05-31 20:47:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:47:21] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 167/180 places, 212/224 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1036 ms. Remains : 167/180 places, 212/224 transitions.
RANDOM walk for 40000 steps (1046 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (258 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1006508 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 1
Probabilistic random walk after 1006508 steps, saw 377798 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2024-05-31 20:47:24] [INFO ] Invariant cache hit.
[2024-05-31 20:47:24] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/102 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/114 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/167 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 212/379 variables, 167/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/102 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/114 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/167 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 212/379 variables, 167/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/379 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 304 ms.
Support contains 23 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 167/167 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 167 /167 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-05-31 20:47:25] [INFO ] Invariant cache hit.
[2024-05-31 20:47:25] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-31 20:47:25] [INFO ] Invariant cache hit.
[2024-05-31 20:47:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:47:26] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-05-31 20:47:26] [INFO ] Redundant transitions in 1 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-31 20:47:26] [INFO ] Invariant cache hit.
[2024-05-31 20:47:26] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 2/167 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 20:47:30] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:47:30] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
[2024-05-31 20:47:30] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:47:30] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
[2024-05-31 20:47:31] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-05-31 20:47:31] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 20:47:33] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 212/379 variables, 167/196 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 20:47:38] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 20:47:44] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:47:45] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:47:45] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/379 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 202 constraints, problems are : Problem set: 0 solved, 194 unsolved in 26049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 2/167 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 212/379 variables, 167/200 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 194/396 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-31 20:47:59] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (OVERLAPS) 0/379 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 397 constraints, problems are : Problem set: 0 solved, 194 unsolved in 23901 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 12/12 constraints]
After SMT, in 50061ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 50065ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50776 ms. Remains : 167/167 places, 212/212 transitions.
[2024-05-31 20:48:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2024-05-31 20:48:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 212 transitions and 822 arcs took 9 ms.
[2024-05-31 20:48:16] [INFO ] Flatten gal took : 76 ms
Total runtime 408661 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-02b-ReachabilityFireability-2024-13

BK_STOP 1717188496746

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-02b-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/1114/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-02b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-02b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117700039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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