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.r466-smll-171620124300028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-03a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124300028
=====================================================================

--------------------
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 1717182617519

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:10:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 19:10:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:10:20] [INFO ] Load time of PNML (sax parser for PT used): 452 ms
[2024-05-31 19:10:20] [INFO ] Transformed 821 places.
[2024-05-31 19:10:20] [INFO ] Transformed 1281 transitions.
[2024-05-31 19:10:20] [INFO ] Found NUPN structural information;
[2024-05-31 19:10:20] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 724 ms.
Structural test allowed to assert that 91 places are NOT stable. Took 23 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
RANDOM walk for 40000 steps (334 resets) in 4932 ms. (8 steps per ms) remains 226/730 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 226/226 properties
// Phase 1: matrix 1268 rows 821 cols
[2024-05-31 19:10:22] [INFO ] Computed 156 invariants in 103 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 11/237 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 (/ 3.0 16.0))
(s2 (/ 1.0 32.0))
(s3 (/ 1.0 32.0))
(s4 (/ 1.0 32.0))
(s5 (/ 1.0 32.0))
(s6 (/ 1.0 32.0))
(s7 (/ 1.0 32.0))
(s8 (/ 1.0 32.0))
(s9 (/ 1.0 32.0))
(s10 (/ 1.0 32.0))
(s11 (/ 1.0 32.0))
(s12 (/ 1.0 32.0))
(s13 (/ 1.0 32.0))
(s14 (/ 1.0 32.0))
(s15 (/ 1.0 32.0))
(s16 (/ 1.0 32.0))
(s17 (/ 1.0 32.0))
(s19 (/ 1.0 16.0))
(s20 (/ 3.0 32.0))
(s23 (/ 1.0 32.0))
(s24 (/ 1.0 32.0))
(s25 (/ 1.0 32.0))
(s26 (/ 1.0 32.0))
(s27 (/ 1.0 32.0))
(s28 (/ 1.0 32.0))
(s29 (/ 1.0 32.0))
(s30 (/ 1.0 32.0))
(s31 (/ 1.0 32.0))
(s32 (/ 1.0 32.0))
(s33 (/ 1.0 32.0))
(s34 (/ 1.0 32.0))
(s35 (/ 1.0 32.0))
(s36 (/ 1.0 32.0))
(s37 (/ 1.0 32.0))
(s38 (/ 1.0 32.0))
(s39 (/ 1.0 32.0))
(s40 (/ 1.0 32.0))
(s41 (/ 1.0 32.0))
(s42 (/ 1.0 32.0))
(s43 (/ 1.0 32.0))
(s44 (/ 1.0 32.0))
(s45 (/ 1.0 32.0))
(s46 (/ 1.0 32.0))
(s47 (/ 1.0 32.0))
(s48 (/ 1.0 32.0))
(s49 (/ 1.0 32.0))
(s50 (/ 1.0 32.0))
(s51 (/ 1.0 32.0))
(s52 (/ 1.0 32.0))
(s73 (/ 1.0 32.0))
(s74 (/ 1.0 32.0))
(s75 (/ 1.0 32.0))
(s76 (/ 1.0 32.0))
(s77 (/ 1.0 32.0))
(s78 (/ 1.0 32.0))
(s79 (/ 1.0 32.0))
(s80 (/ 1.0 32.0))
(s81 (/ 1.0 32.0))
(s82 (/ 1.0 32.0))
(s83 (/ 1.0 32.0))
(s84 (/ 1.0 32.0))
(s85 (/ 1.0 32.0))
(s86 (/ 1.0 32.0))
(s87 (/ 1.0 32.0))
(s88 (/ 1.0 32.0))
(s89 (/ 1.0 32.0))
(s90 (/ 1.0 32.0))
(s91 (/ 1.0 32.0))
(s92 (/ 1.0 32.0))
(s93 (/ 1.0 32.0))
(s94 (/ 1.0 32.0))
(s95 (/ 1.0 32.0))
(s103 (/ 1.0 32.0))
(s104 (/ 1.0 32.0))
(s105 (/ 1.0 32.0))
(s106 (/ 1.0 32.0))
(s107 (/ 1.0 32.0))
(s108 (/ 1.0 32.0))
(s109 (/ 1.0 32.0))
(s110 (/ 1.0 32.0))
(s111 (/ 1.0 32.0))
(s112 (/ 1.0 32.0))
(s113 (/ 1.0 32.0))
(s114 (/ 1.0 32.0))
(s115 (/ 1.0 32.0))
(s116 (/ 1.0 32.0))
(s117 (/ 1.0 32.0))
(s118 (/ 1.0 32.0))
(s119 (/ 1.0 32.0))
(s120 (/ 1.0 32.0))
(s124 (/ 1.0 32.0))
(s125 (/ 1.0 32.0))
(s126 (/ 1.0 32.0))
(s127 (/ 1.0 32.0))
(s128 (/ 1.0 32.0))
(s150 (/ 1.0 32.0))
(s194 (/ 1.0 32.0))
(s195 (/ 1.0 32.0))
(s196 (/ 1.0 32.0))
(s197 (/ 1.0 32.0))
(s198 (/ 1.0 32.0))
(s199 (/ 1.0 32.0))
(s200 (/ 1.0 32.0))
(s201 (/ 1.0 32.0))
(s202 (/ 1.0 2.0))
(s203 (/ 1.0 32.0))
(s205 (/ 1.0 32.0))
(s206 (/ 1.0 32.0))
(s207 (/ 1.0 32.0))
(s208 (/ 1.0 32.0))
(s209 (/ 1.0 32.0))
(s211 (/ 1.0 32.0))
(s212 (/ 1.0 32.0))
(s213 (/ 1.0 32.0))
(s220 (/ 1.0 32.0))
(s223 (/ 1.0 32.0))
(s224 (/ 1.0 32.0))
(s225 (/ 1.0 32.0))
(s229 (/ 1.0 32.0))
(s230 (/ 1.0 32.0))
(s231 (/ 1.0 32.0))
(s232 (/ 1.0 32.0))
(s233 (/ 1.0 32.0))
(s234 (/ 1.0 32.0))
(s235 (/ 1.0 32.0))
(s236 (/ 1.0 32.0))
(s237 (/ 1.0 32.0))
(s238 (/ 1.0 32.0))
(s239 (/ 1.0 32.0))
(s240 (/ 1.0 32.0))
(s241 (/ 1.0 32.0))
(s242 (/ 1.0 32.0))
(s243 (/ 1.0 32.0))
(s244 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 226/2089 variables, and 237 constraints, problems are : Problem set: 0 solved, 226 unsolved in 5094 ms.
Refiners :[Domain max(s): 226/821 constraints, Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 11/120 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 11/237 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 37/263 variables, 22/259 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 37/296 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 226 unsolved
SMT process timed out in 10501ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 226 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 5 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 64 rules applied. Total rules applied 64 place count 811 transition count 1214
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 118 place count 757 transition count 1214
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 118 place count 757 transition count 1151
Deduced a syphon composed of 63 places in 6 ms
Ensure Unique test removed 23 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 149 rules applied. Total rules applied 267 place count 671 transition count 1151
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 268 place count 671 transition count 1150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 670 transition count 1150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 272 place count 667 transition count 1134
Iterating global reduction 4 with 3 rules applied. Total rules applied 275 place count 667 transition count 1134
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 279 place count 666 transition count 1131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 281 place count 664 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 282 place count 663 transition count 1123
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 663 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 284 place count 662 transition count 1115
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 662 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 286 place count 661 transition count 1107
Iterating global reduction 6 with 1 rules applied. Total rules applied 287 place count 661 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 288 place count 660 transition count 1099
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 660 transition count 1099
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 290 place count 659 transition count 1091
Iterating global reduction 6 with 1 rules applied. Total rules applied 291 place count 659 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 292 place count 658 transition count 1083
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 658 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 294 place count 657 transition count 1075
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 657 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 296 place count 656 transition count 1067
Iterating global reduction 6 with 1 rules applied. Total rules applied 297 place count 656 transition count 1067
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 298 place count 655 transition count 1059
Iterating global reduction 6 with 1 rules applied. Total rules applied 299 place count 655 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 300 place count 654 transition count 1051
Iterating global reduction 6 with 1 rules applied. Total rules applied 301 place count 654 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 302 place count 653 transition count 1043
Iterating global reduction 6 with 1 rules applied. Total rules applied 303 place count 653 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 304 place count 652 transition count 1035
Iterating global reduction 6 with 1 rules applied. Total rules applied 305 place count 652 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 306 place count 651 transition count 1027
Iterating global reduction 6 with 1 rules applied. Total rules applied 307 place count 651 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 308 place count 650 transition count 1019
Iterating global reduction 6 with 1 rules applied. Total rules applied 309 place count 650 transition count 1019
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 310 place count 649 transition count 1011
Iterating global reduction 6 with 1 rules applied. Total rules applied 311 place count 649 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 312 place count 648 transition count 1003
Iterating global reduction 6 with 1 rules applied. Total rules applied 313 place count 648 transition count 1003
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 343 place count 633 transition count 988
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 633 transition count 987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 345 place count 632 transition count 987
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 346 place count 631 transition count 986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 347 place count 630 transition count 986
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 347 place count 630 transition count 985
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 349 place count 629 transition count 985
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 350 place count 628 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 352 place count 627 transition count 984
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 353 place count 626 transition count 983
Iterating global reduction 9 with 1 rules applied. Total rules applied 354 place count 626 transition count 983
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 355 place count 626 transition count 982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 356 place count 625 transition count 982
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 357 place count 625 transition count 982
Applied a total of 357 rules in 1100 ms. Remains 625 /821 variables (removed 196) and now considering 982/1268 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1119 ms. Remains : 625/821 places, 982/1268 transitions.
RANDOM walk for 4000000 steps (56083 resets) in 65977 ms. (60 steps per ms) remains 108/226 properties
BEST_FIRST walk for 40004 steps (154 resets) in 180 ms. (221 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (143 resets) in 235 ms. (169 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (144 resets) in 222 ms. (179 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (157 resets) in 218 ms. (182 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (144 resets) in 230 ms. (173 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (145 resets) in 305 ms. (130 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (153 resets) in 375 ms. (106 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (142 resets) in 337 ms. (118 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (151 resets) in 249 ms. (160 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (144 resets) in 244 ms. (163 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (148 resets) in 246 ms. (161 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (151 resets) in 232 ms. (171 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (152 resets) in 148 ms. (268 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (149 resets) in 150 ms. (264 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (149 resets) in 157 ms. (253 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (141 resets) in 154 ms. (258 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (149 resets) in 145 ms. (273 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (158 resets) in 151 ms. (263 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (151 resets) in 159 ms. (250 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (143 resets) in 157 ms. (253 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (143 resets) in 159 ms. (250 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (131 resets) in 151 ms. (263 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (143 resets) in 154 ms. (258 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (149 resets) in 162 ms. (245 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (138 resets) in 161 ms. (246 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (148 resets) in 153 ms. (259 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40000 steps (136 resets) in 159 ms. (250 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (147 resets) in 159 ms. (250 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (160 resets) in 148 ms. (268 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (146 resets) in 157 ms. (253 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (151 resets) in 159 ms. (250 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (148 resets) in 155 ms. (256 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (145 resets) in 155 ms. (256 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (150 resets) in 161 ms. (246 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (146 resets) in 160 ms. (248 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (143 resets) in 177 ms. (224 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (136 resets) in 215 ms. (185 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (148 resets) in 202 ms. (197 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (151 resets) in 201 ms. (198 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (148 resets) in 200 ms. (199 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (147 resets) in 202 ms. (197 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (156 resets) in 197 ms. (202 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (144 resets) in 214 ms. (186 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (150 resets) in 192 ms. (207 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (154 resets) in 198 ms. (201 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (147 resets) in 207 ms. (192 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (139 resets) in 213 ms. (186 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (147 resets) in 195 ms. (204 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (154 resets) in 205 ms. (194 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (140 resets) in 214 ms. (186 steps per ms) remains 108/108 properties
// Phase 1: matrix 982 rows 625 cols
[2024-05-31 19:10:55] [INFO ] Computed 120 invariants in 51 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 16/124 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 2/126 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 169/295 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 7/302 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 57/359 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 21/380 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (OVERLAPS) 15/395 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/395 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (OVERLAPS) 4/399 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/399 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 19 (OVERLAPS) 109/508 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/508 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 21 (OVERLAPS) 46/554 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/554 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 23 (OVERLAPS) 68/622 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 25 (OVERLAPS) 1/623 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/623 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 27 (OVERLAPS) 2/625 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/625 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 29 (OVERLAPS) 982/1607 variables, 625/745 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1607 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 31 (OVERLAPS) 0/1607 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1607/1607 variables, and 745 constraints, problems are : Problem set: 0 solved, 108 unsolved in 34101 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 625/625 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 16/124 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 2/126 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 169/295 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 19:11:31] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 33 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 7/302 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 19:11:35] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 57/359 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (OVERLAPS) 21/380 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (OVERLAPS) 15/395 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/395 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 19 (OVERLAPS) 4/399 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/399 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 21 (OVERLAPS) 109/508 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/508 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 23 (OVERLAPS) 46/554 variables, 8/97 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/554 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 25 (OVERLAPS) 68/622 variables, 22/119 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/622 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 27 (OVERLAPS) 1/623 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/623 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 29 (OVERLAPS) 2/625 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/625 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 31 (OVERLAPS) 982/1607 variables, 625/747 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1607 variables, 108/855 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1607/1607 variables, and 855 constraints, problems are : Problem set: 0 solved, 108 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 625/625 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
After SMT, in 79275ms problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 625/625 places, 982/982 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 621 transition count 976
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 612 transition count 976
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 19 place count 612 transition count 969
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 33 place count 605 transition count 969
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 603 transition count 969
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 602 transition count 963
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 602 transition count 963
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 601 transition count 963
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 54 place count 593 transition count 955
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 56 place count 591 transition count 953
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 591 transition count 953
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 591 transition count 950
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 65 place count 588 transition count 949
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 588 transition count 949
Applied a total of 66 rules in 132 ms. Remains 588 /625 variables (removed 37) and now considering 949/982 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 588/625 places, 949/982 transitions.
RANDOM walk for 4000000 steps (57421 resets) in 51548 ms. (77 steps per ms) remains 106/108 properties
BEST_FIRST walk for 40003 steps (153 resets) in 168 ms. (236 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (171 resets) in 159 ms. (250 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (152 resets) in 166 ms. (239 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (151 resets) in 162 ms. (245 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (157 resets) in 162 ms. (245 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (163 resets) in 156 ms. (254 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (148 resets) in 174 ms. (228 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (152 resets) in 176 ms. (226 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (162 resets) in 163 ms. (243 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (162 resets) in 167 ms. (238 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (153 resets) in 169 ms. (235 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (150 resets) in 165 ms. (240 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (148 resets) in 164 ms. (242 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40001 steps (157 resets) in 165 ms. (240 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (163 resets) in 160 ms. (248 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (159 resets) in 163 ms. (243 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (164 resets) in 159 ms. (250 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (165 resets) in 164 ms. (242 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (161 resets) in 161 ms. (246 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (161 resets) in 158 ms. (251 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (159 resets) in 161 ms. (246 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (161 resets) in 162 ms. (245 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (156 resets) in 167 ms. (238 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (151 resets) in 172 ms. (231 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (157 resets) in 162 ms. (245 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40001 steps (155 resets) in 172 ms. (231 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (163 resets) in 161 ms. (246 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (165 resets) in 163 ms. (243 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (150 resets) in 167 ms. (238 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (150 resets) in 173 ms. (229 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (153 resets) in 167 ms. (238 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (155 resets) in 170 ms. (233 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (155 resets) in 177 ms. (224 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (158 resets) in 160 ms. (248 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (168 resets) in 160 ms. (248 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (152 resets) in 175 ms. (227 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (159 resets) in 169 ms. (235 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (150 resets) in 167 ms. (238 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (161 resets) in 159 ms. (250 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (159 resets) in 260 ms. (153 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (154 resets) in 249 ms. (160 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (149 resets) in 240 ms. (165 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40001 steps (153 resets) in 354 ms. (112 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (153 resets) in 252 ms. (158 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (159 resets) in 234 ms. (170 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (154 resets) in 295 ms. (135 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (159 resets) in 293 ms. (136 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (162 resets) in 300 ms. (132 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (155 resets) in 298 ms. (133 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (157 resets) in 354 ms. (112 steps per ms) remains 106/106 properties
Interrupted probabilistic random walk after 1823669 steps, run timeout after 48001 ms. (steps per millisecond=37 ) properties seen :16 out of 106
Probabilistic random walk after 1823669 steps, saw 593137 distinct states, run finished after 48012 ms. (steps per millisecond=37 ) properties seen :16
// Phase 1: matrix 949 rows 588 cols
[2024-05-31 19:13:19] [INFO ] Computed 110 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/100 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 112/213 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 15/228 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 66/294 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (OVERLAPS) 3/297 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 15 (OVERLAPS) 62/359 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 17 (OVERLAPS) 21/380 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 19 (OVERLAPS) 93/473 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/473 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 21 (OVERLAPS) 45/518 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/518 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 23 (OVERLAPS) 68/586 variables, 23/108 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/586 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 25 (OVERLAPS) 1/587 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/587 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 27 (OVERLAPS) 1/588 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/588 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 29 (OVERLAPS) 949/1537 variables, 588/698 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1537 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 31 (OVERLAPS) 0/1537 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1537/1537 variables, and 698 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/100 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 112/213 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-31 19:13:50] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 15/228 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 66/294 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (OVERLAPS) 3/297 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 16 (OVERLAPS) 62/359 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 18 (OVERLAPS) 21/380 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/380 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 20 (OVERLAPS) 93/473 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/473 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 22 (OVERLAPS) 45/518 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/518 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 24 (OVERLAPS) 68/586 variables, 23/109 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/586 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 26 (OVERLAPS) 1/587 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/587 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 28 (OVERLAPS) 1/588 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/588 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 30 (OVERLAPS) 949/1537 variables, 588/699 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1537 variables, 90/789 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-31 19:14:56] [INFO ] Deduced a trap composed of 205 places in 802 ms of which 10 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1537 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1537/1537 variables, and 790 constraints, problems are : Problem set: 0 solved, 90 unsolved in 75029 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 2/2 constraints]
After SMT, in 105102ms problems are : Problem set: 0 solved, 90 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 90 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 949/949 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 588 transition count 946
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 585 transition count 946
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 585 transition count 943
Deduced a syphon composed of 3 places in 2 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 580 transition count 943
Applied a total of 14 rules in 52 ms. Remains 580 /588 variables (removed 8) and now considering 943/949 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 580/588 places, 943/949 transitions.
RANDOM walk for 4000000 steps (57685 resets) in 70062 ms. (57 steps per ms) remains 89/90 properties
BEST_FIRST walk for 400002 steps (1599 resets) in 2757 ms. (145 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1579 resets) in 2671 ms. (149 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1575 resets) in 2465 ms. (162 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1589 resets) in 2819 ms. (141 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1603 resets) in 3201 ms. (124 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1569 resets) in 2949 ms. (135 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1603 resets) in 2942 ms. (135 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1601 resets) in 3100 ms. (128 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1561 resets) in 2516 ms. (158 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1621 resets) in 2859 ms. (139 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1595 resets) in 2306 ms. (173 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1594 resets) in 2889 ms. (138 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1593 resets) in 2433 ms. (164 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1584 resets) in 3236 ms. (123 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1599 resets) in 2599 ms. (153 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1618 resets) in 2397 ms. (166 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1601 resets) in 2803 ms. (142 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1574 resets) in 2265 ms. (176 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1582 resets) in 2656 ms. (150 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1570 resets) in 2802 ms. (142 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1590 resets) in 2693 ms. (148 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1548 resets) in 2564 ms. (155 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1588 resets) in 2679 ms. (149 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1595 resets) in 2563 ms. (156 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1584 resets) in 2694 ms. (148 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1580 resets) in 2895 ms. (138 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1541 resets) in 2370 ms. (168 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1567 resets) in 2683 ms. (149 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1580 resets) in 2507 ms. (159 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1596 resets) in 2839 ms. (140 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1578 resets) in 2601 ms. (153 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1584 resets) in 2353 ms. (169 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1608 resets) in 2674 ms. (149 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1598 resets) in 2750 ms. (145 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1597 resets) in 2840 ms. (140 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1595 resets) in 3692 ms. (108 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1587 resets) in 2925 ms. (136 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1618 resets) in 2635 ms. (151 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1604 resets) in 2939 ms. (136 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1556 resets) in 2535 ms. (157 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1592 resets) in 2711 ms. (147 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1602 resets) in 2361 ms. (169 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1581 resets) in 2427 ms. (164 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1566 resets) in 2351 ms. (170 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1620 resets) in 2764 ms. (144 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1565 resets) in 2878 ms. (138 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1569 resets) in 2960 ms. (135 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1617 resets) in 2324 ms. (172 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1587 resets) in 2339 ms. (170 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1595 resets) in 2959 ms. (135 steps per ms) remains 89/89 properties
Interrupted probabilistic random walk after 8988721 steps, run timeout after 195001 ms. (steps per millisecond=46 ) properties seen :0 out of 89
Probabilistic random walk after 8988721 steps, saw 2467376 distinct states, run finished after 195001 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 943 rows 580 cols
[2024-05-31 19:19:24] [INFO ] Computed 108 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) 8/97 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 77/175 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 3/178 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 56/234 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 6/240 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 63/303 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (OVERLAPS) 18/321 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/321 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (OVERLAPS) 114/435 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/435 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (OVERLAPS) 54/489 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/489 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 23 (OVERLAPS) 6/495 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/495 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 25 (OVERLAPS) 84/579 variables, 25/107 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/579 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 27 (OVERLAPS) 1/580 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/580 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 29 (OVERLAPS) 943/1523 variables, 580/688 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1523 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 31 (OVERLAPS) 0/1523 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1523/1523 variables, and 688 constraints, problems are : Problem set: 0 solved, 89 unsolved in 25878 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 580/580 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) 8/97 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 77/175 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 3/178 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 56/234 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-31 19:19:53] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 6/240 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (OVERLAPS) 63/303 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (OVERLAPS) 18/321 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/321 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (OVERLAPS) 114/435 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 23 (OVERLAPS) 54/489 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/489 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 25 (OVERLAPS) 6/495 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/495 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 27 (OVERLAPS) 84/579 variables, 25/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/579 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 29 (OVERLAPS) 1/580 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/580 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 31 (OVERLAPS) 943/1523 variables, 580/690 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1523 variables, 89/779 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1523/1523 variables, and 779 constraints, problems are : Problem set: 0 solved, 89 unsolved in 90012 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 115947ms problems are : Problem set: 0 solved, 89 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 943/943 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 579 transition count 942
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 579 transition count 942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 579 transition count 941
Applied a total of 3 rules in 57 ms. Remains 579 /580 variables (removed 1) and now considering 941/943 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 579/580 places, 941/943 transitions.
RANDOM walk for 4000000 steps (57688 resets) in 76312 ms. (52 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1590 resets) in 2575 ms. (155 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1606 resets) in 3278 ms. (121 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1563 resets) in 2804 ms. (142 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1605 resets) in 2706 ms. (147 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1600 resets) in 2445 ms. (163 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1598 resets) in 2349 ms. (170 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1595 resets) in 3147 ms. (127 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1573 resets) in 2446 ms. (163 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1581 resets) in 3267 ms. (122 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1604 resets) in 2987 ms. (133 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1613 resets) in 2936 ms. (136 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1603 resets) in 2669 ms. (149 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1597 resets) in 2909 ms. (137 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1589 resets) in 3257 ms. (122 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1613 resets) in 2598 ms. (153 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1618 resets) in 2906 ms. (137 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1598 resets) in 2934 ms. (136 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1592 resets) in 2736 ms. (146 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1579 resets) in 3019 ms. (132 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1581 resets) in 3012 ms. (132 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400000 steps (1608 resets) in 2174 ms. (183 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1586 resets) in 3528 ms. (113 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1598 resets) in 2906 ms. (137 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1586 resets) in 2755 ms. (145 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1594 resets) in 2403 ms. (166 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1600 resets) in 3033 ms. (131 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1604 resets) in 2365 ms. (169 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1593 resets) in 2377 ms. (168 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400000 steps (1584 resets) in 2965 ms. (134 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1581 resets) in 2751 ms. (145 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1583 resets) in 3055 ms. (130 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1596 resets) in 2678 ms. (149 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1597 resets) in 3114 ms. (128 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1592 resets) in 2504 ms. (159 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1595 resets) in 2625 ms. (152 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1556 resets) in 3113 ms. (128 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1610 resets) in 2448 ms. (163 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1620 resets) in 2768 ms. (144 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1588 resets) in 3166 ms. (126 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1600 resets) in 2473 ms. (161 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1547 resets) in 2549 ms. (156 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1589 resets) in 2799 ms. (142 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1588 resets) in 2730 ms. (146 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1577 resets) in 3064 ms. (130 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1614 resets) in 2926 ms. (136 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (1607 resets) in 2879 ms. (138 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1596 resets) in 2311 ms. (173 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400002 steps (1596 resets) in 2395 ms. (166 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400001 steps (1638 resets) in 2688 ms. (148 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400004 steps (1577 resets) in 2627 ms. (152 steps per ms) remains 89/89 properties
Interrupted probabilistic random walk after 9022771 steps, run timeout after 207001 ms. (steps per millisecond=43 ) properties seen :0 out of 89
Probabilistic random walk after 9022771 steps, saw 2480691 distinct states, run finished after 207003 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 941 rows 579 cols
[2024-05-31 19:25:57] [INFO ] Computed 108 invariants in 14 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) 8/97 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 76/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 6/239 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 63/302 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (OVERLAPS) 18/320 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (OVERLAPS) 114/434 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/434 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (OVERLAPS) 53/487 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/487 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 23 (OVERLAPS) 2/489 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/489 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 25 (OVERLAPS) 87/576 variables, 24/105 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/576 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 27 (OVERLAPS) 1/577 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/577 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 29 (OVERLAPS) 2/579 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/579 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 31 (OVERLAPS) 941/1520 variables, 579/687 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1520 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 33 (OVERLAPS) 0/1520 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1520/1520 variables, and 687 constraints, problems are : Problem set: 0 solved, 89 unsolved in 30602 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 579/579 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) 8/97 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 76/174 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 3/177 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 56/233 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-31 19:26:31] [INFO ] Deduced a trap composed of 30 places in 125 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, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 6/239 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (OVERLAPS) 63/302 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/302 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (OVERLAPS) 18/320 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 20 (OVERLAPS) 114/434 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/434 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (OVERLAPS) 53/487 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/487 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 24 (OVERLAPS) 2/489 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/489 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 26 (OVERLAPS) 87/576 variables, 24/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/576 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 28 (OVERLAPS) 1/577 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/577 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 30 (OVERLAPS) 2/579 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/579 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 32 (OVERLAPS) 941/1520 variables, 579/688 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1520 variables, 89/777 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1520 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 35 (OVERLAPS) 0/1520 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1520/1520 variables, and 777 constraints, problems are : Problem set: 0 solved, 89 unsolved in 56519 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 579/579 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
After SMT, in 87172ms problems are : Problem set: 0 solved, 89 unsolved
Fused 89 Parikh solutions to 84 different solutions.
Parikh walk visited 8 properties in 30297 ms.
Support contains 81 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 941/941 transitions.
Ensure Unique test removed 2 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 0 with 4 rules applied. Total rules applied 4 place count 577 transition count 939
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 574 transition count 939
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 574 transition count 938
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 573 transition count 938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 572 transition count 932
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 572 transition count 932
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 571 transition count 932
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 570 transition count 931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 569 transition count 930
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 569 transition count 930
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 569 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 568 transition count 929
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 19 place count 568 transition count 929
Applied a total of 19 rules in 137 ms. Remains 568 /579 variables (removed 11) and now considering 929/941 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 568/579 places, 929/941 transitions.
RANDOM walk for 4000000 steps (56096 resets) in 73396 ms. (54 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1549 resets) in 2336 ms. (171 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1546 resets) in 2473 ms. (161 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1553 resets) in 2542 ms. (157 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1514 resets) in 2654 ms. (150 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1527 resets) in 2624 ms. (152 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1525 resets) in 2365 ms. (169 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1554 resets) in 2507 ms. (159 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1578 resets) in 2389 ms. (167 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1522 resets) in 2157 ms. (185 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1564 resets) in 2465 ms. (162 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1516 resets) in 2525 ms. (158 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (1522 resets) in 2991 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1540 resets) in 2372 ms. (168 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (1558 resets) in 2514 ms. (159 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1532 resets) in 2438 ms. (164 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1542 resets) in 2412 ms. (165 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1524 resets) in 2515 ms. (158 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (1582 resets) in 2668 ms. (149 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1549 resets) in 2713 ms. (147 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1575 resets) in 2903 ms. (137 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1555 resets) in 2902 ms. (137 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1542 resets) in 2307 ms. (173 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1570 resets) in 2710 ms. (147 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1525 resets) in 2548 ms. (156 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1553 resets) in 3046 ms. (131 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1569 resets) in 2160 ms. (185 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1542 resets) in 2151 ms. (185 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1539 resets) in 2536 ms. (157 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1542 resets) in 2615 ms. (152 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1518 resets) in 2556 ms. (156 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1544 resets) in 3018 ms. (132 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1588 resets) in 3268 ms. (122 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1555 resets) in 2557 ms. (156 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1540 resets) in 2815 ms. (142 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1568 resets) in 2660 ms. (150 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1540 resets) in 2435 ms. (164 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1563 resets) in 2316 ms. (172 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1543 resets) in 2575 ms. (155 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1557 resets) in 2083 ms. (191 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1549 resets) in 2371 ms. (168 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1554 resets) in 2553 ms. (156 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (1543 resets) in 2281 ms. (175 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1572 resets) in 2504 ms. (159 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1564 resets) in 2522 ms. (158 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (1546 resets) in 2628 ms. (152 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1550 resets) in 2661 ms. (150 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (1533 resets) in 2394 ms. (167 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1554 resets) in 2679 ms. (149 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1588 resets) in 2509 ms. (159 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (1567 resets) in 2793 ms. (143 steps per ms) remains 81/81 properties
Interrupted probabilistic random walk after 8749874 steps, run timeout after 198001 ms. (steps per millisecond=44 ) properties seen :0 out of 81
Probabilistic random walk after 8749874 steps, saw 2428840 distinct states, run finished after 198004 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 929 rows 568 cols
[2024-05-31 19:32:19] [INFO ] Computed 104 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 29/110 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 70/181 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 3/184 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 38/222 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 6/228 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 15 (OVERLAPS) 63/291 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 17 (OVERLAPS) 18/309 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 19 (OVERLAPS) 114/423 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 21 (OVERLAPS) 54/477 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/477 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 23 (OVERLAPS) 2/479 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/479 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 25 (OVERLAPS) 87/566 variables, 25/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/566 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 27 (OVERLAPS) 1/567 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 29 (OVERLAPS) 1/568 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/568 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 31 (OVERLAPS) 929/1497 variables, 568/672 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1497 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 33 (OVERLAPS) 0/1497 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1497/1497 variables, and 672 constraints, problems are : Problem set: 0 solved, 81 unsolved in 18934 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 568/568 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 29/110 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 70/181 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 3/184 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 38/222 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 6/228 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 15 (OVERLAPS) 63/291 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 17 (OVERLAPS) 18/309 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 19 (OVERLAPS) 114/423 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 21 (OVERLAPS) 54/477 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/477 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 23 (OVERLAPS) 2/479 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/479 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 25 (OVERLAPS) 87/566 variables, 25/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/566 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 27 (OVERLAPS) 1/567 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 29 (OVERLAPS) 1/568 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/568 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 31 (OVERLAPS) 929/1497 variables, 568/672 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1497 variables, 81/753 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1497 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 34 (OVERLAPS) 0/1497 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1497/1497 variables, and 753 constraints, problems are : Problem set: 0 solved, 81 unsolved in 93116 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 568/568 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 112113ms problems are : Problem set: 0 solved, 81 unsolved
Fused 81 Parikh solutions to 74 different solutions.
Parikh walk visited 0 properties in 31356 ms.
Support contains 81 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 929/929 transitions.
Applied a total of 0 rules in 29 ms. Remains 568 /568 variables (removed 0) and now considering 929/929 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 568/568 places, 929/929 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 929/929 transitions.
Applied a total of 0 rules in 17 ms. Remains 568 /568 variables (removed 0) and now considering 929/929 (removed 0) transitions.
[2024-05-31 19:34:43] [INFO ] Invariant cache hit.
[2024-05-31 19:34:44] [INFO ] Implicit Places using invariants in 706 ms returned [20, 34, 52, 70, 154, 173, 174, 175, 193, 211, 230, 280, 281, 292, 293, 294, 312, 330, 349, 399, 400, 403, 414, 415, 416, 434, 436, 439, 457, 458, 459, 460, 472, 478, 484, 490, 496, 502, 508, 514, 520, 526, 532]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 724 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 525/568 places, 929/929 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 525 transition count 866
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 462 transition count 866
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 126 place count 462 transition count 849
Deduced a syphon composed of 17 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 161 place count 444 transition count 849
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 173 place count 440 transition count 841
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 432 transition count 841
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 196 place count 417 transition count 826
Iterating global reduction 4 with 15 rules applied. Total rules applied 211 place count 417 transition count 826
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 417 transition count 823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 214 place count 417 transition count 822
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 216 place count 416 transition count 822
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 413 transition count 819
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 413 transition count 819
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 412 transition count 818
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 412 transition count 818
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 225 place count 411 transition count 817
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 411 transition count 817
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 290 place count 379 transition count 785
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 292 place count 379 transition count 783
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 301 place count 379 transition count 774
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 311 place count 369 transition count 774
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 320 place count 369 transition count 774
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 321 place count 369 transition count 774
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 369 transition count 773
Applied a total of 322 rules in 203 ms. Remains 369 /525 variables (removed 156) and now considering 773/929 (removed 156) transitions.
// Phase 1: matrix 773 rows 369 cols
[2024-05-31 19:34:44] [INFO ] Computed 55 invariants in 11 ms
[2024-05-31 19:34:44] [INFO ] Implicit Places using invariants in 577 ms returned [115, 121, 124, 126, 142, 143, 212, 218, 221, 223, 228, 229, 295, 301, 304, 306]
[2024-05-31 19:34:44] [INFO ] Actually due to overlaps returned [142, 228, 143, 229, 115, 121, 126, 212, 218, 223, 295, 301, 306]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 585 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 356/568 places, 773/929 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 344 transition count 761
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 344 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 341 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 341 transition count 758
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 338 transition count 755
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 338 transition count 746
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 329 transition count 746
Applied a total of 54 rules in 79 ms. Remains 329 /356 variables (removed 27) and now considering 746/773 (removed 27) transitions.
// Phase 1: matrix 746 rows 329 cols
[2024-05-31 19:34:44] [INFO ] Computed 42 invariants in 11 ms
[2024-05-31 19:34:45] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-31 19:34:45] [INFO ] Invariant cache hit.
[2024-05-31 19:34:46] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 329/568 places, 746/929 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2962 ms. Remains : 329/568 places, 746/929 transitions.
RANDOM walk for 4000000 steps (84029 resets) in 61512 ms. (65 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2922 resets) in 2554 ms. (156 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2911 resets) in 2781 ms. (143 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2934 resets) in 2745 ms. (145 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2888 resets) in 2324 ms. (172 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (2909 resets) in 3005 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2926 resets) in 2847 ms. (140 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2961 resets) in 2890 ms. (138 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2935 resets) in 2691 ms. (148 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2944 resets) in 2664 ms. (150 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2914 resets) in 3333 ms. (119 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2954 resets) in 2661 ms. (150 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2924 resets) in 3006 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2929 resets) in 2739 ms. (145 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2921 resets) in 3051 ms. (131 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2943 resets) in 2701 ms. (148 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2848 resets) in 2299 ms. (173 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2899 resets) in 2833 ms. (141 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2902 resets) in 2288 ms. (174 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2924 resets) in 3285 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2966 resets) in 2534 ms. (157 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400000 steps (2968 resets) in 2644 ms. (151 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2907 resets) in 3004 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (2945 resets) in 2615 ms. (152 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (2965 resets) in 2622 ms. (152 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2939 resets) in 2826 ms. (141 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2931 resets) in 2990 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2903 resets) in 3160 ms. (126 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (2924 resets) in 2796 ms. (143 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2959 resets) in 2338 ms. (171 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2935 resets) in 3076 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2909 resets) in 3198 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2934 resets) in 2519 ms. (158 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (2927 resets) in 2143 ms. (186 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (2925 resets) in 2940 ms. (136 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2883 resets) in 2375 ms. (168 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (2927 resets) in 2633 ms. (151 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2887 resets) in 2521 ms. (158 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2915 resets) in 2851 ms. (140 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2868 resets) in 2321 ms. (172 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2877 resets) in 2281 ms. (175 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2929 resets) in 2602 ms. (153 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2961 resets) in 3295 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2903 resets) in 2815 ms. (142 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2944 resets) in 3046 ms. (131 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (2950 resets) in 3459 ms. (115 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2922 resets) in 3137 ms. (127 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400002 steps (2877 resets) in 2854 ms. (140 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (2927 resets) in 2567 ms. (155 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2901 resets) in 2360 ms. (169 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (2883 resets) in 2559 ms. (156 steps per ms) remains 81/81 properties
Interrupted probabilistic random walk after 37108587 steps, run timeout after 204001 ms. (steps per millisecond=181 ) properties seen :80 out of 81
Probabilistic random walk after 37108587 steps, saw 9745662 distinct states, run finished after 204001 ms. (steps per millisecond=181 ) properties seen :80
[2024-05-31 19:39:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/35 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 181/216 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/253 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/329 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 746/1075 variables, 329/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1075 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1075 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1075/1075 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/35 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 181/216 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/253 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/329 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 746/1075 variables, 329/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1075 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1075 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1075 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1075/1075 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 984ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 746/746 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 327 transition count 735
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 315 transition count 735
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 25 place count 315 transition count 729
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 40 place count 306 transition count 729
Discarding 2 places :
Implicit places reduction removed 2 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 2 with 4 rules applied. Total rules applied 44 place count 304 transition count 727
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 302 transition count 727
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 46 place count 302 transition count 725
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 50 place count 300 transition count 725
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 52 place count 298 transition count 723
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 297 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 59 place count 297 transition count 719
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 61 place count 295 transition count 719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 61 place count 295 transition count 718
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 63 place count 294 transition count 718
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 67 place count 292 transition count 716
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 292 transition count 716
Applied a total of 68 rules in 108 ms. Remains 292 /329 variables (removed 37) and now considering 716/746 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 292/329 places, 716/746 transitions.
RANDOM walk for 4000000 steps (84403 resets) in 10626 ms. (376 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (29254 resets) in 4742 ms. (843 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2184192 steps, run timeout after 12001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 2184192 steps, saw 889231 distinct states, run finished after 12001 ms. (steps per millisecond=182 ) properties seen :0
// Phase 1: matrix 716 rows 292 cols
[2024-05-31 19:39:35] [INFO ] Computed 33 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/63 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 132/209 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/257 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 35/292 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 716/1008 variables, 292/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1008 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1008 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/63 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 132/209 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/257 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 35/292 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 716/1008 variables, 292/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1008 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1008 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1008 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 716/716 transitions.
Applied a total of 0 rules in 17 ms. Remains 292 /292 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 292/292 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 716/716 transitions.
Applied a total of 0 rules in 16 ms. Remains 292 /292 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-31 19:39:37] [INFO ] Invariant cache hit.
[2024-05-31 19:39:37] [INFO ] Implicit Places using invariants in 568 ms returned [0, 18, 77]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 582 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 289/292 places, 716/716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 289 transition count 714
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 287 transition count 714
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 286 transition count 713
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 286 transition count 712
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 285 transition count 712
Applied a total of 8 rules in 44 ms. Remains 285 /289 variables (removed 4) and now considering 712/716 (removed 4) transitions.
// Phase 1: matrix 712 rows 285 cols
[2024-05-31 19:39:37] [INFO ] Computed 30 invariants in 9 ms
[2024-05-31 19:39:38] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-05-31 19:39:38] [INFO ] Invariant cache hit.
[2024-05-31 19:39:39] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 285/292 places, 712/716 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2506 ms. Remains : 285/292 places, 712/716 transitions.
RANDOM walk for 4000000 steps (85148 resets) in 9020 ms. (443 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (29198 resets) in 4002 ms. (999 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1588526 steps, run timeout after 9001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 1588526 steps, saw 914408 distinct states, run finished after 9001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-31 19:39:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/99 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/106 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/119 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/152 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 99/251 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/269 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/285 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 712/997 variables, 285/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/997 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/997 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 997/997 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/99 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/106 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/119 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/152 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 99/251 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/269 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/285 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 712/997 variables, 285/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/997 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/997 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/997 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 997/997 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 964ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 712/712 transitions.
Applied a total of 0 rules in 18 ms. Remains 285 /285 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 285/285 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 712/712 transitions.
Applied a total of 0 rules in 16 ms. Remains 285 /285 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2024-05-31 19:39:53] [INFO ] Invariant cache hit.
[2024-05-31 19:39:53] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-31 19:39:53] [INFO ] Invariant cache hit.
[2024-05-31 19:39:54] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2024-05-31 19:39:54] [INFO ] Redundant transitions in 71 ms returned []
Running 694 sub problems to find dead transitions.
[2024-05-31 19:39:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (OVERLAPS) 1/285 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-05-31 19:40:16] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 4 ms to minimize.
[2024-05-31 19:40:17] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 3 ms to minimize.

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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ltsminxred"
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 ltsminxred"
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 r466-smll-171620124300028"
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 ;