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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 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 921K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716315390099

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:16:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 18:16:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:16:33] [INFO ] Load time of PNML (sax parser for PT used): 812 ms
[2024-05-21 18:16:33] [INFO ] Transformed 2826 places.
[2024-05-21 18:16:33] [INFO ] Transformed 3513 transitions.
[2024-05-21 18:16:33] [INFO ] Found NUPN structural information;
[2024-05-21 18:16:33] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 1140 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (66 resets) in 3593 ms. (11 steps per ms) remains 10/16 properties
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 641 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2419 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 348 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
// Phase 1: matrix 3513 rows 2826 cols
[2024-05-21 18:16:36] [INFO ] Computed 277 invariants in 292 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 483/712 variables, 42/271 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/712 variables, 483/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/712 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 170/882 variables, 23/777 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 170/947 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/882 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-06b-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1915/2797 variables, 206/1153 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2797 variables, 1915/3068 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2797 variables, 0/3068 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 29/2826 variables, 6/3074 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2826 variables, 29/3103 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2826/6339 variables, and 3103 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5068 ms.
Refiners :[Domain max(s): 2826/2826 constraints, Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 212/212 constraints, State Equation: 0/2826 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 218/218 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 486/704 variables, 42/260 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 486/746 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 0/746 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 170/874 variables, 23/769 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 170/939 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/939 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1905/2779 variables, 204/1143 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2779 variables, 1905/3048 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 18:16:47] [INFO ] Deduced a trap composed of 27 places in 3459 ms of which 377 ms to minimize.
SMT process timed out in 11807ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 218 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 513 place count 2826 transition count 3000
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 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 1 with 534 rules applied. Total rules applied 1047 place count 2313 transition count 2979
Reduce places removed 3 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 47 rules applied. Total rules applied 1094 place count 2310 transition count 2935
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1138 place count 2266 transition count 2935
Performed 610 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 610 Pre rules applied. Total rules applied 1138 place count 2266 transition count 2325
Deduced a syphon composed of 610 places in 11 ms
Ensure Unique test removed 45 places
Reduce places removed 655 places and 0 transitions.
Iterating global reduction 4 with 1265 rules applied. Total rules applied 2403 place count 1611 transition count 2325
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 34 rules applied. Total rules applied 2437 place count 1602 transition count 2300
Reduce places removed 25 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 31 rules applied. Total rules applied 2468 place count 1577 transition count 2294
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2474 place count 1571 transition count 2294
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 2474 place count 1571 transition count 2281
Deduced a syphon composed of 13 places in 34 ms
Ensure Unique test removed 11 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 37 rules applied. Total rules applied 2511 place count 1547 transition count 2281
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2511 place count 1547 transition count 2272
Deduced a syphon composed of 9 places in 27 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2529 place count 1538 transition count 2272
Discarding 88 places :
Symmetric choice reduction at 7 with 88 rule applications. Total rules 2617 place count 1450 transition count 2184
Iterating global reduction 7 with 88 rules applied. Total rules applied 2705 place count 1450 transition count 2184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2706 place count 1450 transition count 2183
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 19 Pre rules applied. Total rules applied 2706 place count 1450 transition count 2164
Deduced a syphon composed of 19 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 39 rules applied. Total rules applied 2745 place count 1430 transition count 2164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2745 place count 1430 transition count 2163
Deduced a syphon composed of 1 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2748 place count 1428 transition count 2163
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2751 place count 1425 transition count 2145
Iterating global reduction 8 with 3 rules applied. Total rules applied 2754 place count 1425 transition count 2145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 2754 place count 1425 transition count 2143
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2758 place count 1423 transition count 2143
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 6 ms
Ensure Unique test removed 4 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 8 with 320 rules applied. Total rules applied 3078 place count 1261 transition count 1985
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 3079 place count 1260 transition count 1985
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3079 place count 1260 transition count 1984
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3081 place count 1259 transition count 1984
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3083 place count 1257 transition count 1982
Ensure Unique test removed 1 places
Iterating global reduction 9 with 3 rules applied. Total rules applied 3086 place count 1256 transition count 1982
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3087 place count 1255 transition count 1981
Iterating global reduction 9 with 1 rules applied. Total rules applied 3088 place count 1255 transition count 1981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 3090 place count 1255 transition count 1979
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3091 place count 1254 transition count 1979
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3093 place count 1253 transition count 1988
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 3096 place count 1253 transition count 1985
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 4 rules applied. Total rules applied 3100 place count 1251 transition count 1983
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 3102 place count 1249 transition count 1983
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 3110 place count 1249 transition count 1975
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 3118 place count 1241 transition count 1975
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 14 with 8 rules applied. Total rules applied 3126 place count 1241 transition count 1967
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 3134 place count 1233 transition count 1967
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 3140 place count 1233 transition count 1967
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 3141 place count 1232 transition count 1966
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 15 with 4 rules applied. Total rules applied 3145 place count 1229 transition count 1965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 3146 place count 1228 transition count 1965
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 6 Pre rules applied. Total rules applied 3146 place count 1228 transition count 1959
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 17 with 12 rules applied. Total rules applied 3158 place count 1222 transition count 1959
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 3160 place count 1220 transition count 1959
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3164 place count 1218 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3165 place count 1217 transition count 1956
Iterating global reduction 18 with 1 rules applied. Total rules applied 3166 place count 1217 transition count 1956
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3167 place count 1217 transition count 1955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3168 place count 1216 transition count 1955
Applied a total of 3168 rules in 2599 ms. Remains 1216 /2826 variables (removed 1610) and now considering 1955/3513 (removed 1558) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2617 ms. Remains : 1216/2826 places, 1955/3513 transitions.
RANDOM walk for 40000 steps (232 resets) in 499 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (36 resets) in 365 ms. (109 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (35 resets) in 476 ms. (83 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 261 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (40 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (35 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 85395 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 9
Probabilistic random walk after 85395 steps, saw 47281 distinct states, run finished after 3007 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 1955 rows 1216 cols
[2024-05-21 18:16:54] [INFO ] Computed 197 invariants in 78 ms
[2024-05-21 18:16:54] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 290/508 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 14/522 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 665/1187 variables, 140/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1187 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/1189 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1189 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 27/1216 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1216 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1955/3171 variables, 1216/1413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3171 variables, 8/1421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3171 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/3171 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3171/3171 variables, and 1421 constraints, problems are : Problem set: 0 solved, 9 unsolved in 6371 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 145/145 constraints, State Equation: 1216/1216 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 290/508 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 18:17:01] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 14/522 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 665/1187 variables, 140/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 18:17:02] [INFO ] Deduced a trap composed of 27 places in 440 ms of which 6 ms to minimize.
[2024-05-21 18:17:02] [INFO ] Deduced a trap composed of 60 places in 361 ms of which 5 ms to minimize.
[2024-05-21 18:17:03] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-05-21 18:17:03] [INFO ] Deduced a trap composed of 34 places in 654 ms of which 8 ms to minimize.
[2024-05-21 18:17:04] [INFO ] Deduced a trap composed of 74 places in 380 ms of which 6 ms to minimize.
[2024-05-21 18:17:04] [INFO ] Deduced a trap composed of 70 places in 392 ms of which 6 ms to minimize.
[2024-05-21 18:17:04] [INFO ] Deduced a trap composed of 73 places in 329 ms of which 5 ms to minimize.
[2024-05-21 18:17:05] [INFO ] Deduced a trap composed of 21 places in 380 ms of which 5 ms to minimize.
[2024-05-21 18:17:05] [INFO ] Deduced a trap composed of 126 places in 407 ms of which 9 ms to minimize.
[2024-05-21 18:17:06] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 5 ms to minimize.
[2024-05-21 18:17:06] [INFO ] Deduced a trap composed of 42 places in 462 ms of which 6 ms to minimize.
[2024-05-21 18:17:07] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1187 variables, 12/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 18:17:08] [INFO ] Deduced a trap composed of 79 places in 915 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1187 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1187 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/1189 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1189 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 27/1216 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1216 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-06b-ReachabilityFireability-2023-04 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2023-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06b-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06b-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06b-ReachabilityFireability-2023-13 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2023-13 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
Problem ASLink-PT-06b-ReachabilityFireability-2024-06 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 3171/3171 variables, and 1427 constraints, problems are : Problem set: 5 solved, 4 unsolved in 44757 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 145/145 constraints, State Equation: 1216/1216 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 14/14 constraints]
After SMT, in 51369ms problems are : Problem set: 5 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10651 ms.
Support contains 52 out of 1216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1216/1216 places, 1955/1955 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1216 transition count 1934
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 45 place count 1193 transition count 1933
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 1192 transition count 1932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 1191 transition count 1932
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 48 place count 1191 transition count 1835
Deduced a syphon composed of 97 places in 17 ms
Ensure Unique test removed 9 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 203 rules applied. Total rules applied 251 place count 1085 transition count 1835
Discarding 2 places :
Implicit places reduction removed 2 places
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 4 with 3 rules applied. Total rules applied 254 place count 1083 transition count 1834
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 257 place count 1081 transition count 1833
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 258 place count 1080 transition count 1833
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 258 place count 1080 transition count 1826
Deduced a syphon composed of 7 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 275 place count 1070 transition count 1826
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 276 place count 1069 transition count 1826
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 282 place count 1063 transition count 1797
Iterating global reduction 8 with 6 rules applied. Total rules applied 288 place count 1063 transition count 1797
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 289 place count 1062 transition count 1797
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 289 place count 1062 transition count 1794
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 295 place count 1059 transition count 1794
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 297 place count 1057 transition count 1785
Iterating global reduction 9 with 2 rules applied. Total rules applied 299 place count 1057 transition count 1785
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 301 place count 1055 transition count 1776
Iterating global reduction 9 with 2 rules applied. Total rules applied 303 place count 1055 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 304 place count 1054 transition count 1768
Iterating global reduction 9 with 1 rules applied. Total rules applied 305 place count 1054 transition count 1768
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 306 place count 1053 transition count 1760
Iterating global reduction 9 with 1 rules applied. Total rules applied 307 place count 1053 transition count 1760
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 339 place count 1037 transition count 1744
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 341 place count 1035 transition count 1742
Iterating global reduction 9 with 2 rules applied. Total rules applied 343 place count 1035 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 344 place count 1034 transition count 1741
Iterating global reduction 9 with 1 rules applied. Total rules applied 345 place count 1034 transition count 1741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 346 place count 1034 transition count 1740
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 347 place count 1034 transition count 1739
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 349 place count 1033 transition count 1738
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 350 place count 1032 transition count 1738
Free-agglomeration rule applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 357 place count 1032 transition count 1731
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 364 place count 1025 transition count 1731
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 367 place count 1025 transition count 1728
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 370 place count 1022 transition count 1728
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 371 place count 1022 transition count 1728
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 375 place count 1018 transition count 1724
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 378 place count 1015 transition count 1724
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 5 Pre rules applied. Total rules applied 378 place count 1015 transition count 1719
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 388 place count 1010 transition count 1719
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 15 with 2 rules applied. Total rules applied 390 place count 1008 transition count 1719
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 391 place count 1007 transition count 1718
Iterating global reduction 16 with 1 rules applied. Total rules applied 392 place count 1007 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 393 place count 1006 transition count 1717
Iterating global reduction 16 with 1 rules applied. Total rules applied 394 place count 1006 transition count 1717
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 398 place count 1004 transition count 1715
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 399 place count 1003 transition count 1714
Iterating global reduction 16 with 1 rules applied. Total rules applied 400 place count 1003 transition count 1714
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 401 place count 1003 transition count 1713
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 402 place count 1002 transition count 1713
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 403 place count 1002 transition count 1713
Applied a total of 403 rules in 1410 ms. Remains 1002 /1216 variables (removed 214) and now considering 1713/1955 (removed 242) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1410 ms. Remains : 1002/1216 places, 1713/1955 transitions.
RANDOM walk for 40000 steps (303 resets) in 368 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (54 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (55 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (52 resets) in 486 ms. (82 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 176515 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 176515 steps, saw 36169 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 1713 rows 1002 cols
[2024-05-21 18:18:01] [INFO ] Computed 172 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 250/302 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/323 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 479/802 variables, 87/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 22/824 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/825 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/825 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 149/974 variables, 37/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/974 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/975 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/975 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 27/1002 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1002 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1713/2715 variables, 1002/1174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2715 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2715 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2715/2715 variables, and 1174 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1783 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1002/1002 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 250/302 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 18:18:03] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/323 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 479/802 variables, 87/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 18:18:03] [INFO ] Deduced a trap composed of 92 places in 295 ms of which 5 ms to minimize.
[2024-05-21 18:18:03] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 18:18:04] [INFO ] Deduced a trap composed of 114 places in 381 ms of which 5 ms to minimize.
[2024-05-21 18:18:04] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 3 ms to minimize.
[2024-05-21 18:18:05] [INFO ] Deduced a trap composed of 69 places in 501 ms of which 8 ms to minimize.
[2024-05-21 18:18:05] [INFO ] Deduced a trap composed of 64 places in 466 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/802 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 22/824 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/824 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/825 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/825 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 149/974 variables, 37/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 18:18:06] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/974 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/974 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/975 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/975 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 27/1002 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1002 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1713/2715 variables, 1002/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2715 variables, 3/1185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 18:18:13] [INFO ] Deduced a trap composed of 107 places in 473 ms of which 6 ms to minimize.
[2024-05-21 18:18:14] [INFO ] Deduced a trap composed of 103 places in 462 ms of which 6 ms to minimize.
[2024-05-21 18:18:15] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 5 ms to minimize.
[2024-05-21 18:18:15] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2715 variables, 4/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2715 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/2715 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2715/2715 variables, and 1189 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16901 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1002/1002 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 18778ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12818 ms.
Support contains 52 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 1713/1713 transitions.
Applied a total of 0 rules in 37 ms. Remains 1002 /1002 variables (removed 0) and now considering 1713/1713 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1002/1002 places, 1713/1713 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 1713/1713 transitions.
Applied a total of 0 rules in 36 ms. Remains 1002 /1002 variables (removed 0) and now considering 1713/1713 (removed 0) transitions.
[2024-05-21 18:18:32] [INFO ] Invariant cache hit.
[2024-05-21 18:18:34] [INFO ] Implicit Places using invariants in 1447 ms returned [1, 18, 19, 31, 48, 66, 85, 106, 141, 151, 154, 173, 191, 262, 266, 267, 278, 279, 281, 298, 316, 379, 394, 409, 410, 430, 448, 522, 523, 533, 534, 545, 546, 547, 550, 588, 629, 630, 670, 685, 686, 689, 707, 725, 768, 769, 795, 810, 815, 818, 830, 831, 832, 863, 865, 869, 887, 888, 889, 890, 904, 910, 916, 922, 928, 934, 940, 946, 952, 958, 964]
[2024-05-21 18:18:34] [INFO ] Actually due to overlaps returned [863, 832, 48, 173, 298, 430, 689, 707, 869, 154, 281, 550, 31, 278, 409, 546, 685, 830, 887, 151, 279, 410, 547, 686, 831, 865, 888, 1, 18, 266, 267, 394, 533, 534, 670, 815, 191, 316, 448, 545, 588, 725, 889, 934, 952, 964, 19, 66, 85, 818, 890, 904, 910, 916, 922, 928, 940, 946, 958]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1466 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 943/1002 places, 1713/1713 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 938 transition count 1622
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 100 rules applied. Total rules applied 196 place count 847 transition count 1613
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 204 place count 839 transition count 1613
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 204 place count 839 transition count 1586
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 259 place count 811 transition count 1586
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 267 place count 807 transition count 1582
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 8 rules applied. Total rules applied 275 place count 803 transition count 1578
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 279 place count 799 transition count 1578
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 295 place count 783 transition count 1562
Iterating global reduction 6 with 16 rules applied. Total rules applied 311 place count 783 transition count 1562
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 314 place count 783 transition count 1559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 314 place count 783 transition count 1558
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 316 place count 782 transition count 1558
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 319 place count 779 transition count 1555
Iterating global reduction 7 with 3 rules applied. Total rules applied 322 place count 779 transition count 1555
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 325 place count 776 transition count 1549
Iterating global reduction 7 with 3 rules applied. Total rules applied 328 place count 776 transition count 1549
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 329 place count 775 transition count 1548
Iterating global reduction 7 with 1 rules applied. Total rules applied 330 place count 775 transition count 1548
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 331 place count 774 transition count 1546
Iterating global reduction 7 with 1 rules applied. Total rules applied 332 place count 774 transition count 1546
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 422 place count 729 transition count 1501
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 424 place count 727 transition count 1499
Iterating global reduction 7 with 2 rules applied. Total rules applied 426 place count 727 transition count 1499
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 428 place count 727 transition count 1497
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 432 place count 725 transition count 1498
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 455 place count 725 transition count 1475
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 478 place count 702 transition count 1475
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 479 place count 702 transition count 1474
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 495 place count 702 transition count 1474
Applied a total of 495 rules in 552 ms. Remains 702 /943 variables (removed 241) and now considering 1474/1713 (removed 239) transitions.
// Phase 1: matrix 1474 rows 702 cols
[2024-05-21 18:18:34] [INFO ] Computed 103 invariants in 16 ms
[2024-05-21 18:18:35] [INFO ] Implicit Places using invariants in 891 ms returned [102, 106, 109, 110, 167, 185, 191, 194, 196, 201, 202, 271, 282, 284, 287, 294, 295, 375, 381, 391, 392, 404, 405, 476, 477, 489, 498, 504, 507, 577, 591, 592, 601, 616, 701]
[2024-05-21 18:18:35] [INFO ] Actually due to overlaps returned [109, 201, 294, 404, 110, 202, 295, 405, 185, 191, 196, 271, 284, 375, 381, 601, 102, 106, 167, 287, 391, 476, 489, 498, 504, 507, 577, 591, 616, 701]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 896 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 672/1002 places, 1474/1713 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 658 transition count 1460
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 658 transition count 1460
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 654 transition count 1456
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 654 transition count 1456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 652 transition count 1454
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 652 transition count 1454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 651 transition count 1453
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 651 transition count 1453
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 645 transition count 1447
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 63 place count 645 transition count 1438
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 72 place count 636 transition count 1438
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 636 transition count 1436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 634 transition count 1436
Applied a total of 76 rules in 363 ms. Remains 634 /672 variables (removed 38) and now considering 1436/1474 (removed 38) transitions.
// Phase 1: matrix 1436 rows 634 cols
[2024-05-21 18:18:36] [INFO ] Computed 73 invariants in 26 ms
[2024-05-21 18:18:36] [INFO ] Implicit Places using invariants in 647 ms returned [352, 434, 529]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 650 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 631/1002 places, 1436/1713 transitions.
Applied a total of 0 rules in 27 ms. Remains 631 /631 variables (removed 0) and now considering 1436/1436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3990 ms. Remains : 631/1002 places, 1436/1713 transitions.
RANDOM walk for 40000 steps (364 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (75 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (77 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 178401 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 3
Probabilistic random walk after 178401 steps, saw 44397 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 1436 rows 631 cols
[2024-05-21 18:18:40] [INFO ] Computed 70 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/146 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/150 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 450/600 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/607 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 24/631 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1436/2067 variables, 631/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2067 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2067 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2067/2067 variables, and 701 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/146 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/150 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 450/600 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 18:18:42] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/607 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 24/631 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1436/2067 variables, 631/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2067 variables, 3/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 18:18:46] [INFO ] Deduced a trap composed of 73 places in 309 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2067 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2067 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/2067 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2067/2067 variables, and 706 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6315 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 8142ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3804 ms.
Support contains 52 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1436/1436 transitions.
Applied a total of 0 rules in 33 ms. Remains 631 /631 variables (removed 0) and now considering 1436/1436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 631/631 places, 1436/1436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1436/1436 transitions.
Applied a total of 0 rules in 23 ms. Remains 631 /631 variables (removed 0) and now considering 1436/1436 (removed 0) transitions.
[2024-05-21 18:18:52] [INFO ] Invariant cache hit.
[2024-05-21 18:18:52] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-05-21 18:18:52] [INFO ] Invariant cache hit.
[2024-05-21 18:18:55] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 2985 ms to find 0 implicit places.
[2024-05-21 18:18:55] [INFO ] Redundant transitions in 118 ms returned []
Running 1411 sub problems to find dead transitions.
[2024-05-21 18:18:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
[2024-05-21 18:19:15] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-21 18:19:15] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-21 18:19:15] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/2067 variables, and 55 constraints, problems are : Problem set: 0 solved, 1411 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 6/15 constraints, Generalized P Invariants (flows): 46/55 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1411/1411 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/2067 variables, and 55 constraints, problems are : Problem set: 0 solved, 1411 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/15 constraints, Generalized P Invariants (flows): 46/55 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1411 constraints, Known Traps: 3/3 constraints]
After SMT, in 61227ms problems are : Problem set: 0 solved, 1411 unsolved
Search for dead transitions found 0 dead transitions in 61250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64399 ms. Remains : 631/631 places, 1436/1436 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 631 transition count 1432
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 627 transition count 1432
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 627 transition count 1432
Applied a total of 9 rules in 45 ms. Remains 627 /631 variables (removed 4) and now considering 1432/1436 (removed 4) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1432 rows 627 cols
[2024-05-21 18:19:56] [INFO ] Computed 70 invariants in 29 ms
[2024-05-21 18:19:56] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-21 18:19:56] [INFO ] [Real]Absence check using 14 positive and 56 generalized place invariants in 55 ms returned sat
[2024-05-21 18:19:56] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 18:19:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-21 18:19:57] [INFO ] [Nat]Absence check using 14 positive and 56 generalized place invariants in 36 ms returned sat
[2024-05-21 18:20:02] [INFO ] After 5348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 18:20:03] [INFO ] Deduced a trap composed of 42 places in 685 ms of which 7 ms to minimize.
[2024-05-21 18:20:03] [INFO ] Deduced a trap composed of 59 places in 522 ms of which 12 ms to minimize.
[2024-05-21 18:20:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1380 ms
[2024-05-21 18:20:04] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 3 ms to minimize.
[2024-05-21 18:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
TRAPS : Iteration 1
[2024-05-21 18:20:10] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-05-21 18:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
TRAPS : Iteration 2
[2024-05-21 18:20:12] [INFO ] After 14992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 18:20:13] [INFO ] After 16108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 16640 ms.
[2024-05-21 18:20:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2024-05-21 18:20:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 631 places, 1436 transitions and 5757 arcs took 28 ms.
[2024-05-21 18:20:13] [INFO ] Flatten gal took : 345 ms
Total runtime 221878 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-06b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/401/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 631
TRANSITIONS: 1436
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.065s, Sys 0.004s]


SAVING FILE /home/mcc/execution/401/model (.net / .def) ...
EXPORT TIME: [User 0.011s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 715
MODEL NAME: /home/mcc/execution/401/model
631 places, 1436 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-03 CANNOT_COMPUTE
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-10 CANNOT_COMPUTE
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716318229615

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117000103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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