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.r012-smll-171620123700028.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 greatspnxred
Input is ASLink-PT-03a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620123700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 357K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716243189162

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 22:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:13:11] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2024-05-20 22:13:11] [INFO ] Transformed 821 places.
[2024-05-20 22:13:11] [INFO ] Transformed 1281 transitions.
[2024-05-20 22:13:11] [INFO ] Found NUPN structural information;
[2024-05-20 22:13:11] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 458 ms.
Structural test allowed to assert that 91 places are NOT stable. Took 14 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
RANDOM walk for 40000 steps (342 resets) in 4421 ms. (9 steps per ms) remains 187/730 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 187/187 properties
// Phase 1: matrix 1268 rows 821 cols
[2024-05-20 22:13:13] [INFO ] Computed 156 invariants in 88 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 9/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 19/215 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 33/248 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 3.0 17.0))
(s2 (/ 1.0 34.0))
(s3 (/ 1.0 34.0))
(s4 (/ 1.0 34.0))
(s5 (/ 1.0 34.0))
(s6 (/ 1.0 34.0))
(s7 (/ 1.0 34.0))
(s8 (/ 1.0 34.0))
(s9 (/ 1.0 34.0))
(s10 (/ 1.0 34.0))
(s11 (/ 1.0 34.0))
(s12 (/ 1.0 34.0))
(s13 (/ 1.0 34.0))
(s14 (/ 1.0 34.0))
(s15 (/ 1.0 34.0))
(s16 (/ 1.0 34.0))
(s17 (/ 1.0 34.0))
(s19 (/ 1.0 17.0))
(s20 (/ 3.0 34.0))
(s21 (/ 29.0 34.0))
(s23 (/ 1.0 34.0))
(s24 (/ 1.0 34.0))
(s25 (/ 1.0 34.0))
(s26 (/ 1.0 34.0))
(s27 (/ 1.0 34.0))
(s28 (/ 1.0 34.0))
(s29 (/ 1.0 34.0))
(s30 (/ 1.0 34.0))
(s31 (/ 1.0 34.0))
(s32 (/ 1.0 34.0))
(s33 (/ 1.0 34.0))
(s34 (/ 1.0 34.0))
(s35 (/ 1.0 34.0))
(s36 (/ 1.0 34.0))
(s37 (/ 1.0 34.0))
(s38 (/ 1.0 34.0))
(s39 (/ 1.0 34.0))
(s40 (/ 1.0 34.0))
(s41 (/ 1.0 34.0))
(s42 (/ 1.0 34.0))
(s43 (/ 1.0 34.0))
(s44 (/ 1.0 34.0))
(s45 (/ 1.0 34.0))
(s46 (/ 1.0 34.0))
(s47 (/ 1.0 34.0))
(s48 (/ 1.0 34.0))
(s49 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 220/2089 variables, and 250 constraints, problems are : Problem set: 0 solved, 187 unsolved in 5112 ms.
Refiners :[Domain max(s): 220/821 constraints, Positive P Invariants (semi-flows): 19/36 constraints, Generalized P Invariants (flows): 11/120 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 9/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 19/215 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 33/248 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 94/314 variables, 17/267 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 94/361 constraints. Problems are: Problem set: 0 solved, 187 unsolved
(s1 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/2089 variables, and 361 constraints, problems are : Problem set: 0 solved, 187 unsolved in 5017 ms.
Refiners :[Domain max(s): 314/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 11/120 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 0/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 10438ms problems are : Problem set: 0 solved, 187 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 187 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 6 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 810 transition count 1214
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 119 place count 756 transition count 1214
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 119 place count 756 transition count 1152
Deduced a syphon composed of 62 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 266 place count 671 transition count 1152
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 2 with 1 rules applied. Total rules applied 267 place count 671 transition count 1151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 670 transition count 1151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 271 place count 667 transition count 1135
Iterating global reduction 4 with 3 rules applied. Total rules applied 274 place count 667 transition count 1135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 4 rules applied. Total rules applied 278 place count 666 transition count 1132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 280 place count 664 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 281 place count 663 transition count 1124
Iterating global reduction 6 with 1 rules applied. Total rules applied 282 place count 663 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 662 transition count 1116
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 662 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 285 place count 661 transition count 1108
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 661 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 660 transition count 1100
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 660 transition count 1100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 289 place count 659 transition count 1092
Iterating global reduction 6 with 1 rules applied. Total rules applied 290 place count 659 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 291 place count 658 transition count 1084
Iterating global reduction 6 with 1 rules applied. Total rules applied 292 place count 658 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 293 place count 657 transition count 1076
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 657 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 295 place count 656 transition count 1068
Iterating global reduction 6 with 1 rules applied. Total rules applied 296 place count 656 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 297 place count 655 transition count 1060
Iterating global reduction 6 with 1 rules applied. Total rules applied 298 place count 655 transition count 1060
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 299 place count 654 transition count 1052
Iterating global reduction 6 with 1 rules applied. Total rules applied 300 place count 654 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 301 place count 653 transition count 1044
Iterating global reduction 6 with 1 rules applied. Total rules applied 302 place count 653 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 303 place count 652 transition count 1036
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 652 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 305 place count 651 transition count 1028
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 651 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 650 transition count 1020
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 650 transition count 1020
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 309 place count 649 transition count 1012
Iterating global reduction 6 with 1 rules applied. Total rules applied 310 place count 649 transition count 1012
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 311 place count 648 transition count 1004
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 648 transition count 1004
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 344 place count 632 transition count 988
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 345 place count 632 transition count 987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 346 place count 631 transition count 987
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 347 place count 631 transition count 987
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 348 place count 630 transition count 986
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 350 place count 628 transition count 986
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 350 place count 628 transition count 982
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 358 place count 624 transition count 982
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 359 place count 623 transition count 982
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 361 place count 622 transition count 981
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 362 place count 621 transition count 980
Iterating global reduction 9 with 1 rules applied. Total rules applied 363 place count 621 transition count 980
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 364 place count 621 transition count 979
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 365 place count 620 transition count 979
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 366 place count 620 transition count 979
Applied a total of 366 rules in 849 ms. Remains 620 /821 variables (removed 201) and now considering 979/1268 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 865 ms. Remains : 620/821 places, 979/1268 transitions.
RANDOM walk for 4000000 steps (57968 resets) in 71943 ms. (55 steps per ms) remains 114/187 properties
BEST_FIRST walk for 40003 steps (155 resets) in 171 ms. (232 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (156 resets) in 210 ms. (189 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (156 resets) in 170 ms. (233 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (156 resets) in 243 ms. (163 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (154 resets) in 169 ms. (235 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (155 resets) in 167 ms. (238 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (155 resets) in 171 ms. (232 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (159 resets) in 159 ms. (250 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (152 resets) in 177 ms. (224 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (152 resets) in 210 ms. (189 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (154 resets) in 212 ms. (187 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (164 resets) in 210 ms. (189 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (168 resets) in 204 ms. (195 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (163 resets) in 199 ms. (200 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (161 resets) in 217 ms. (183 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (159 resets) in 201 ms. (198 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (164 resets) in 201 ms. (198 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (159 resets) in 171 ms. (232 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (155 resets) in 167 ms. (238 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (159 resets) in 168 ms. (236 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (154 resets) in 170 ms. (233 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (155 resets) in 166 ms. (239 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (157 resets) in 164 ms. (242 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (152 resets) in 173 ms. (229 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (161 resets) in 161 ms. (246 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (161 resets) in 162 ms. (245 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (158 resets) in 172 ms. (231 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (159 resets) in 178 ms. (223 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (153 resets) in 214 ms. (186 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (158 resets) in 209 ms. (190 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (165 resets) in 209 ms. (190 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (168 resets) in 198 ms. (201 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (160 resets) in 211 ms. (188 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (152 resets) in 209 ms. (190 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (157 resets) in 216 ms. (184 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (157 resets) in 185 ms. (215 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (142 resets) in 174 ms. (228 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (153 resets) in 163 ms. (243 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (155 resets) in 168 ms. (236 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (163 resets) in 164 ms. (242 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (160 resets) in 167 ms. (238 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (160 resets) in 163 ms. (243 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (162 resets) in 165 ms. (240 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (159 resets) in 158 ms. (251 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (159 resets) in 168 ms. (236 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (153 resets) in 172 ms. (231 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (153 resets) in 183 ms. (217 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (151 resets) in 219 ms. (181 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (154 resets) in 215 ms. (185 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (168 resets) in 206 ms. (193 steps per ms) remains 114/114 properties
// Phase 1: matrix 979 rows 620 cols
[2024-05-20 22:13:48] [INFO ] Computed 118 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 15/129 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 149/279 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 8/287 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 129/416 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 79/495 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (OVERLAPS) 4/499 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/499 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (OVERLAPS) 118/617 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/617 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 19 (OVERLAPS) 1/618 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/618 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 21 (OVERLAPS) 2/620 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/620 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 23 (OVERLAPS) 979/1599 variables, 620/738 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1599 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 25 (OVERLAPS) 0/1599 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1599/1599 variables, and 738 constraints, problems are : Problem set: 0 solved, 114 unsolved in 38632 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 15/129 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 149/279 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-20 22:14:29] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 44 ms to minimize.
[2024-05-20 22:14:29] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-05-20 22:14:30] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 8/287 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 129/416 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (OVERLAPS) 79/495 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/495 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (OVERLAPS) 4/499 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/499 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 18 (OVERLAPS) 118/617 variables, 31/118 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/617 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 20 (OVERLAPS) 1/618 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/618 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 22 (OVERLAPS) 2/620 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/620 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 24 (OVERLAPS) 979/1599 variables, 620/741 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1599 variables, 114/855 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1599/1599 variables, and 855 constraints, problems are : Problem set: 0 solved, 114 unsolved in 45029 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 3/3 constraints]
After SMT, in 83814ms problems are : Problem set: 0 solved, 114 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 114 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 979/979 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 618 transition count 975
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 613 transition count 975
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 613 transition count 971
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 609 transition count 971
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 608 transition count 971
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 607 transition count 965
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 607 transition count 965
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 602 transition count 960
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 601 transition count 959
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 601 transition count 959
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 601 transition count 958
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 600 transition count 957
Applied a total of 37 rules in 129 ms. Remains 600 /620 variables (removed 20) and now considering 957/979 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 600/620 places, 957/979 transitions.
RANDOM walk for 4000000 steps (59432 resets) in 50932 ms. (78 steps per ms) remains 107/114 properties
BEST_FIRST walk for 40004 steps (165 resets) in 156 ms. (254 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (164 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (159 resets) in 163 ms. (243 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (173 resets) in 156 ms. (254 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (162 resets) in 162 ms. (245 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (161 resets) in 158 ms. (251 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (163 resets) in 158 ms. (251 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (160 resets) in 170 ms. (233 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (173 resets) in 157 ms. (253 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (174 resets) in 153 ms. (259 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (164 resets) in 160 ms. (248 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (154 resets) in 167 ms. (238 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (160 resets) in 156 ms. (254 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (168 resets) in 167 ms. (238 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (156 resets) in 158 ms. (251 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (172 resets) in 155 ms. (256 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (165 resets) in 163 ms. (243 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (169 resets) in 153 ms. (259 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (166 resets) in 157 ms. (253 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (167 resets) in 163 ms. (243 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (165 resets) in 156 ms. (254 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (153 resets) in 167 ms. (238 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (164 resets) in 171 ms. (232 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (165 resets) in 165 ms. (240 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (163 resets) in 160 ms. (248 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (165 resets) in 164 ms. (242 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (169 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (160 resets) in 159 ms. (250 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (162 resets) in 163 ms. (243 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (162 resets) in 167 ms. (238 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (167 resets) in 156 ms. (254 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (150 resets) in 160 ms. (248 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (163 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (162 resets) in 165 ms. (240 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (165 resets) in 160 ms. (248 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (157 resets) in 163 ms. (243 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (157 resets) in 159 ms. (250 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (156 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (163 resets) in 169 ms. (235 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (164 resets) in 163 ms. (243 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (158 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (150 resets) in 170 ms. (233 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (163 resets) in 157 ms. (253 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (159 resets) in 155 ms. (256 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (157 resets) in 165 ms. (240 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (164 resets) in 166 ms. (239 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (155 resets) in 162 ms. (245 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (169 resets) in 168 ms. (236 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (165 resets) in 156 ms. (254 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (157 resets) in 161 ms. (246 steps per ms) remains 107/107 properties
Interrupted probabilistic random walk after 2068653 steps, run timeout after 45001 ms. (steps per millisecond=45 ) properties seen :18 out of 107
Probabilistic random walk after 2068653 steps, saw 770221 distinct states, run finished after 45010 ms. (steps per millisecond=45 ) properties seen :18
// Phase 1: matrix 957 rows 600 cols
[2024-05-20 22:16:12] [INFO ] Computed 114 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 9/98 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 76/175 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 8/183 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 100/283 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 31/314 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 121/435 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/435 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (OVERLAPS) 54/489 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (OVERLAPS) 2/491 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/491 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (OVERLAPS) 106/597 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/597 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 23 (OVERLAPS) 1/598 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/598 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 25 (OVERLAPS) 2/600 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/600 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 27 (OVERLAPS) 957/1557 variables, 600/714 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1557 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 29 (OVERLAPS) 0/1557 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1557/1557 variables, and 714 constraints, problems are : Problem set: 0 solved, 89 unsolved in 19756 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 81/81 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 9/98 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 76/175 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:16:34] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 8/183 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 100/283 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 31/314 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (OVERLAPS) 121/435 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/435 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (OVERLAPS) 54/489 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 20 (OVERLAPS) 2/491 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/491 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (OVERLAPS) 106/597 variables, 28/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/597 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 24 (OVERLAPS) 1/598 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/598 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 26 (OVERLAPS) 2/600 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/600 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 28 (OVERLAPS) 957/1557 variables, 600/715 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1557 variables, 89/804 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1557/1557 variables, and 804 constraints, problems are : Problem set: 0 solved, 89 unsolved in 75017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 81/81 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
After SMT, in 94838ms problems are : Problem set: 0 solved, 89 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 957/957 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 599 transition count 952
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 593 transition count 952
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 593 transition count 948
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 587 transition count 948
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 586 transition count 948
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 585 transition count 947
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 584 transition count 946
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 584 transition count 946
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 584 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 583 transition count 945
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 583 transition count 945
Applied a total of 30 rules in 120 ms. Remains 583 /600 variables (removed 17) and now considering 945/957 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 583/600 places, 945/957 transitions.
RANDOM walk for 4000000 steps (57805 resets) in 44777 ms. (89 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1634 resets) in 3301 ms. (121 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1589 resets) in 4734 ms. (84 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1583 resets) in 4273 ms. (93 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1621 resets) in 4075 ms. (98 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1595 resets) in 4042 ms. (98 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1586 resets) in 4631 ms. (86 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1613 resets) in 4031 ms. (99 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1590 resets) in 4256 ms. (93 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1565 resets) in 4394 ms. (91 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1594 resets) in 4307 ms. (92 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1568 resets) in 3837 ms. (104 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1602 resets) in 3918 ms. (102 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1566 resets) in 4823 ms. (82 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1612 resets) in 5069 ms. (78 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1614 resets) in 4349 ms. (91 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1560 resets) in 4305 ms. (92 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1591 resets) in 4172 ms. (95 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1594 resets) in 4613 ms. (86 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1596 resets) in 5028 ms. (79 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1597 resets) in 3700 ms. (108 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1573 resets) in 4252 ms. (94 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1577 resets) in 4453 ms. (89 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1572 resets) in 4144 ms. (96 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1580 resets) in 4439 ms. (90 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1602 resets) in 3898 ms. (102 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1596 resets) in 3548 ms. (112 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1626 resets) in 3640 ms. (109 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1592 resets) in 3945 ms. (101 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1584 resets) in 3875 ms. (103 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1592 resets) in 3754 ms. (106 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1587 resets) in 3775 ms. (105 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1574 resets) in 3981 ms. (100 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1602 resets) in 3786 ms. (105 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1599 resets) in 3953 ms. (101 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1595 resets) in 3966 ms. (100 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1607 resets) in 4406 ms. (90 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1609 resets) in 4010 ms. (99 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1627 resets) in 4443 ms. (90 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1590 resets) in 4876 ms. (82 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1564 resets) in 4665 ms. (85 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1599 resets) in 3834 ms. (104 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1592 resets) in 3546 ms. (112 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1600 resets) in 4331 ms. (92 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1583 resets) in 4766 ms. (83 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1575 resets) in 3502 ms. (114 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1549 resets) in 4107 ms. (97 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1573 resets) in 4252 ms. (94 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1574 resets) in 5306 ms. (75 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1571 resets) in 3999 ms. (100 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1615 resets) in 3944 ms. (101 steps per ms) remains 89/89 properties
Interrupted probabilistic random walk after 8517163 steps, run timeout after 249001 ms. (steps per millisecond=34 ) properties seen :4 out of 89
Probabilistic random walk after 8517163 steps, saw 2761141 distinct states, run finished after 249003 ms. (steps per millisecond=34 ) properties seen :4
// Phase 1: matrix 945 rows 583 cols
[2024-05-20 22:23:20] [INFO ] Computed 109 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/93 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 80/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 6/239 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (OVERLAPS) 64/303 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (OVERLAPS) 35/338 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/338 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 19 (OVERLAPS) 2/340 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/340 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 21 (OVERLAPS) 1/341 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/341 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (OVERLAPS) 127/468 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/468 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 25 (OVERLAPS) 45/513 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/513 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 27 (OVERLAPS) 68/581 variables, 23/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/581 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 29 (OVERLAPS) 1/582 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/582 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 31 (OVERLAPS) 1/583 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/583 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 33 (OVERLAPS) 945/1528 variables, 583/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1528 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 35 (OVERLAPS) 0/1528 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1528/1528 variables, and 692 constraints, problems are : Problem set: 0 solved, 85 unsolved in 23354 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/93 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 80/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-20 22:23:46] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 14 (OVERLAPS) 6/239 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 16 (OVERLAPS) 64/303 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 18 (OVERLAPS) 35/338 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/338 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 20 (OVERLAPS) 2/340 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/340 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 22 (OVERLAPS) 1/341 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/341 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 24 (OVERLAPS) 127/468 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/468 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 26 (OVERLAPS) 45/513 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/513 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 28 (OVERLAPS) 68/581 variables, 23/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/581 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 30 (OVERLAPS) 1/582 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/582 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 32 (OVERLAPS) 1/583 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/583 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 34 (OVERLAPS) 945/1528 variables, 583/693 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1528 variables, 85/778 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-20 22:24:18] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1528 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1528 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 38 (OVERLAPS) 0/1528 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1528/1528 variables, and 779 constraints, problems are : Problem set: 0 solved, 85 unsolved in 84425 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
After SMT, in 107855ms problems are : Problem set: 0 solved, 85 unsolved
Fused 85 Parikh solutions to 80 different solutions.
Parikh walk visited 0 properties in 30421 ms.
Support contains 85 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 945/945 transitions.
Applied a total of 0 rules in 21 ms. Remains 583 /583 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 583/583 places, 945/945 transitions.
RANDOM walk for 3589222 steps (51907 resets) in 117690 ms. (30 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1600 resets) in 4424 ms. (90 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1592 resets) in 3529 ms. (113 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1571 resets) in 3923 ms. (101 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1609 resets) in 4437 ms. (90 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1612 resets) in 3987 ms. (100 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1608 resets) in 4337 ms. (92 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1614 resets) in 4233 ms. (94 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1609 resets) in 3604 ms. (110 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1597 resets) in 4816 ms. (83 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1601 resets) in 4551 ms. (87 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1618 resets) in 4350 ms. (91 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1560 resets) in 4302 ms. (92 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1564 resets) in 4288 ms. (93 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1593 resets) in 4253 ms. (94 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1605 resets) in 3773 ms. (105 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (1571 resets) in 3846 ms. (103 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1596 resets) in 4150 ms. (96 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1611 resets) in 4342 ms. (92 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1591 resets) in 4232 ms. (94 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1602 resets) in 3818 ms. (104 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1611 resets) in 3291 ms. (121 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1606 resets) in 3522 ms. (113 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1574 resets) in 3853 ms. (103 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (1580 resets) in 3616 ms. (110 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1597 resets) in 3917 ms. (102 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1603 resets) in 4042 ms. (98 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1583 resets) in 3793 ms. (105 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1621 resets) in 3313 ms. (120 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1573 resets) in 4147 ms. (96 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1593 resets) in 3550 ms. (112 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1580 resets) in 3786 ms. (105 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (1599 resets) in 3921 ms. (101 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1599 resets) in 3928 ms. (101 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1597 resets) in 4012 ms. (99 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1588 resets) in 4291 ms. (93 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1553 resets) in 3848 ms. (103 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1562 resets) in 3970 ms. (100 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1602 resets) in 3601 ms. (111 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1587 resets) in 3183 ms. (125 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1622 resets) in 3748 ms. (106 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1611 resets) in 3706 ms. (107 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1573 resets) in 4558 ms. (87 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1621 resets) in 3771 ms. (106 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1585 resets) in 3756 ms. (106 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1601 resets) in 3387 ms. (118 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1597 resets) in 3602 ms. (111 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (1595 resets) in 4230 ms. (94 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (1575 resets) in 3866 ms. (103 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (1582 resets) in 4096 ms. (97 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (1588 resets) in 4208 ms. (95 steps per ms) remains 85/85 properties
Interrupted probabilistic random walk after 9667610 steps, run timeout after 291001 ms. (steps per millisecond=33 ) properties seen :12 out of 85
Probabilistic random walk after 9667610 steps, saw 3069695 distinct states, run finished after 291004 ms. (steps per millisecond=33 ) properties seen :12
[2024-05-20 22:32:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 46/123 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 11/134 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 60/194 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 3/197 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 69/266 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 15 (OVERLAPS) 24/290 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/290 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 17 (OVERLAPS) 19/309 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 19 (OVERLAPS) 3/312 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/312 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 21 (OVERLAPS) 1/313 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/313 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 23 (OVERLAPS) 155/468 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/468 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 25 (OVERLAPS) 45/513 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/513 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 27 (OVERLAPS) 68/581 variables, 23/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/581 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 29 (OVERLAPS) 1/582 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/582 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 31 (OVERLAPS) 1/583 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/583 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 33 (OVERLAPS) 945/1528 variables, 583/692 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1528 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 35 (OVERLAPS) 0/1528 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1528/1528 variables, and 692 constraints, problems are : Problem set: 0 solved, 73 unsolved in 18982 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 46/123 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 11/134 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 60/194 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 3/197 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 69/266 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 15 (OVERLAPS) 24/290 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/290 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 17 (OVERLAPS) 19/309 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 19 (OVERLAPS) 3/312 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/312 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 21 (OVERLAPS) 1/313 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/313 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 23 (OVERLAPS) 155/468 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/468 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 25 (OVERLAPS) 45/513 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/513 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 27 (OVERLAPS) 68/581 variables, 23/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/581 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 29 (OVERLAPS) 1/582 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/582 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 31 (OVERLAPS) 1/583 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/583 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 33 (OVERLAPS) 945/1528 variables, 583/692 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1528 variables, 73/765 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1528 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1528/1528 variables, and 765 constraints, problems are : Problem set: 0 solved, 73 unsolved in 105029 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 124049ms problems are : Problem set: 0 solved, 73 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 945/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 583 transition count 942
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 580 transition count 942
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 580 transition count 939
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 575 transition count 939
Applied a total of 14 rules in 56 ms. Remains 575 /583 variables (removed 8) and now considering 939/945 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 575/583 places, 939/945 transitions.
RANDOM walk for 4000000 steps (57828 resets) in 51078 ms. (78 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1612 resets) in 3594 ms. (111 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1597 resets) in 3357 ms. (119 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1587 resets) in 3411 ms. (117 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1601 resets) in 3877 ms. (103 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1602 resets) in 3554 ms. (112 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1597 resets) in 3901 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1619 resets) in 4059 ms. (98 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1603 resets) in 3256 ms. (122 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1609 resets) in 3972 ms. (100 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1610 resets) in 5109 ms. (78 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1582 resets) in 3938 ms. (101 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1604 resets) in 3411 ms. (117 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1600 resets) in 3691 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1600 resets) in 4282 ms. (93 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1590 resets) in 3865 ms. (103 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1638 resets) in 3613 ms. (110 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400001 steps (1570 resets) in 3079 ms. (129 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1609 resets) in 3969 ms. (100 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1601 resets) in 4762 ms. (83 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1592 resets) in 4583 ms. (87 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1585 resets) in 3384 ms. (118 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1594 resets) in 3457 ms. (115 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1593 resets) in 3643 ms. (109 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1610 resets) in 4017 ms. (99 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1631 resets) in 3667 ms. (109 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1598 resets) in 3949 ms. (101 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1606 resets) in 3888 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1588 resets) in 3671 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1580 resets) in 3877 ms. (103 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1610 resets) in 3716 ms. (107 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1576 resets) in 3809 ms. (104 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1625 resets) in 3722 ms. (107 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1597 resets) in 3813 ms. (104 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1621 resets) in 3876 ms. (103 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1569 resets) in 3687 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1589 resets) in 4102 ms. (97 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1599 resets) in 3667 ms. (109 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1563 resets) in 3576 ms. (111 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1578 resets) in 3589 ms. (111 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1623 resets) in 4223 ms. (94 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400000 steps (1561 resets) in 3465 ms. (115 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1597 resets) in 3758 ms. (106 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1581 resets) in 3896 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1578 resets) in 3725 ms. (107 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1607 resets) in 3279 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (1585 resets) in 3675 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (1588 resets) in 4167 ms. (95 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1550 resets) in 3567 ms. (112 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1597 resets) in 3195 ms. (125 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (1584 resets) in 3765 ms. (106 steps per ms) remains 73/73 properties
Interrupted probabilistic random walk after 8619245 steps, run timeout after 243001 ms. (steps per millisecond=35 ) properties seen :0 out of 73
Probabilistic random walk after 8619245 steps, saw 2541326 distinct states, run finished after 243004 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 939 rows 575 cols
[2024-05-20 22:39:35] [INFO ] Computed 107 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 63/140 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 4/144 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 80/224 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 7/231 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 64/295 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 15 (OVERLAPS) 35/330 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 17 (OVERLAPS) 2/332 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 19 (OVERLAPS) 1/333 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/333 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 21 (OVERLAPS) 127/460 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/460 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 23 (OVERLAPS) 44/504 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 25 (OVERLAPS) 68/572 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/572 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 27 (OVERLAPS) 1/573 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/573 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 29 (OVERLAPS) 2/575 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/575 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 31 (OVERLAPS) 939/1514 variables, 575/682 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1514 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 33 (OVERLAPS) 0/1514 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1514/1514 variables, and 682 constraints, problems are : Problem set: 0 solved, 73 unsolved in 22819 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 575/575 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 4/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 63/140 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 4/144 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 80/224 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 7/231 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 64/295 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 15 (OVERLAPS) 35/330 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 17 (OVERLAPS) 2/332 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 19 (OVERLAPS) 1/333 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/333 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 21 (OVERLAPS) 127/460 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/460 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 23 (OVERLAPS) 44/504 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 25 (OVERLAPS) 68/572 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/572 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 27 (OVERLAPS) 1/573 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/573 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 29 (OVERLAPS) 2/575 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/575 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 31 (OVERLAPS) 939/1514 variables, 575/682 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1514 variables, 73/755 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 8)
(t1 170)
(t2 0)
(t3 0)
(t4 0)
(t5 0)
(t6 0)
(t7 0)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 0)
(t13 239)
(t14 0)
(t15 0)
(t16 81)
(t17 0)
(t18 0)
(t19 0)
(t20 0)
(t21 0)
(t22 0)
(t23 0)
(t24 3)
(t25 0)
(t26 171)
(t27 8)
(t28 0)
(t29 0)
(t30 1)
(t31 11)
(t32 39)
(t33 0)
(t34 0)
(t35 80)
(t36 0)
(t37 0)
(t38 0)
(t39 3)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 238)
(t47 0)
(t48 1)
(t49 238)
(t50 0)
(t51 1)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 239)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 1)
(t66 0)
(t67 0)
(t68 1)
(t69 0)
(t70 0)
(t71 0)
(t72 237)
(t73 1)
(t74 0)
(t75 0)
(t76 0)
(t77 238)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 238)
(t87 0)
(t88 1)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 1)
(t96 237)
(t97 0)
(t98 1)
(t99 0)
(t100 237)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 238)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 238)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 238)
(t125 0)
(t126 0)
(t127 0)
(t128 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/1514 variables, and 755 constraints, problems are : Problem set: 0 solved, 73 unsolved in 120017 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 575/575 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 142877ms problems are : Problem set: 0 solved, 73 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 939/939 transitions.
Applied a total of 0 rules in 30 ms. Remains 575 /575 variables (removed 0) and now considering 939/939 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 575/575 places, 939/939 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 939/939 transitions.
Applied a total of 0 rules in 24 ms. Remains 575 /575 variables (removed 0) and now considering 939/939 (removed 0) transitions.
[2024-05-20 22:41:58] [INFO ] Invariant cache hit.
[2024-05-20 22:41:59] [INFO ] Implicit Places using invariants in 881 ms returned [20, 53, 71, 154, 171, 176, 177, 178, 196, 214, 233, 283, 284, 295, 296, 297, 315, 333, 402, 406, 407, 410, 421, 422, 423, 441, 443, 446, 464, 465, 466, 467, 479, 485, 491, 497, 503, 509, 515, 521, 527, 533, 539]
[2024-05-20 22:41:59] [INFO ] Actually due to overlaps returned [441, 423, 53, 196, 297, 315, 446, 178, 177, 296, 422, 465, 176, 295, 421, 443, 464, 20, 283, 284, 406, 407, 71, 171, 333, 467, 509, 527, 539, 154, 214, 233, 410, 466, 479, 485, 491, 497, 503, 515, 521, 533]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 898 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 533/575 places, 939/939 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 532 transition count 875
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 468 transition count 875
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 129 place count 468 transition count 855
Deduced a syphon composed of 20 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 170 place count 447 transition count 855
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 182 place count 443 transition count 847
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 190 place count 435 transition count 847
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 205 place count 420 transition count 832
Iterating global reduction 4 with 15 rules applied. Total rules applied 220 place count 420 transition count 832
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 223 place count 420 transition count 829
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 223 place count 420 transition count 828
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 419 transition count 828
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 228 place count 416 transition count 825
Iterating global reduction 5 with 3 rules applied. Total rules applied 231 place count 416 transition count 825
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 232 place count 415 transition count 824
Iterating global reduction 5 with 1 rules applied. Total rules applied 233 place count 415 transition count 824
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 234 place count 414 transition count 823
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 414 transition count 823
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 295 place count 384 transition count 793
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 297 place count 384 transition count 791
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 298 place count 383 transition count 790
Iterating global reduction 6 with 1 rules applied. Total rules applied 299 place count 383 transition count 790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 300 place count 383 transition count 789
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 307 place count 383 transition count 782
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 315 place count 375 transition count 782
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 324 place count 375 transition count 782
Applied a total of 324 rules in 171 ms. Remains 375 /533 variables (removed 158) and now considering 782/939 (removed 157) transitions.
// Phase 1: matrix 782 rows 375 cols
[2024-05-20 22:41:59] [INFO ] Computed 58 invariants in 9 ms
[2024-05-20 22:42:00] [INFO ] Implicit Places using invariants in 540 ms returned [112, 118, 121, 123, 124, 143, 144, 215, 221, 224, 226, 231, 232, 284, 301, 307, 310, 312]
[2024-05-20 22:42:00] [INFO ] Actually due to overlaps returned [143, 231, 144, 232, 112, 118, 123, 215, 221, 226, 301, 307, 312, 124, 284]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 545 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 360/575 places, 782/939 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 347 transition count 769
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 347 transition count 769
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 344 transition count 766
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 344 transition count 766
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 0 with 8 rules applied. Total rules applied 40 place count 340 transition count 762
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 340 transition count 752
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 60 place count 330 transition count 752
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 330 transition count 751
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 329 transition count 751
Applied a total of 62 rules in 106 ms. Remains 329 /360 variables (removed 31) and now considering 751/782 (removed 31) transitions.
// Phase 1: matrix 751 rows 329 cols
[2024-05-20 22:42:00] [INFO ] Computed 43 invariants in 7 ms
[2024-05-20 22:42:00] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-20 22:42:00] [INFO ] Invariant cache hit.
[2024-05-20 22:42:01] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 329/575 places, 751/939 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2911 ms. Remains : 329/575 places, 751/939 transitions.
RANDOM walk for 3989999 steps (84397 resets) in 105177 ms. (37 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2938 resets) in 3726 ms. (107 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2896 resets) in 4241 ms. (94 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2940 resets) in 3413 ms. (117 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2983 resets) in 3996 ms. (100 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400001 steps (2932 resets) in 3841 ms. (104 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2907 resets) in 3717 ms. (107 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400001 steps (2877 resets) in 4666 ms. (85 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2917 resets) in 3635 ms. (110 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2901 resets) in 3946 ms. (101 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2947 resets) in 4765 ms. (83 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2916 resets) in 4667 ms. (85 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2958 resets) in 3929 ms. (101 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (2959 resets) in 3923 ms. (101 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2901 resets) in 5351 ms. (74 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (2857 resets) in 4529 ms. (88 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2963 resets) in 3644 ms. (109 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2946 resets) in 3532 ms. (113 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (2920 resets) in 3870 ms. (103 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2925 resets) in 4421 ms. (90 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (2946 resets) in 3877 ms. (103 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2931 resets) in 4731 ms. (84 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400001 steps (2908 resets) in 4112 ms. (97 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2926 resets) in 4524 ms. (88 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (2921 resets) in 3770 ms. (106 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400001 steps (2904 resets) in 4657 ms. (85 steps per ms) remains 65/73 properties

BK_TIME_CONFINEMENT_REACHED

--------------------
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 StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-03a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 greatspnxred"
echo " Input is ASLink-PT-03a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620123700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03a.tgz
mv ASLink-PT-03a execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;