About the Execution of LTSMin+red for ASLink-PT-05b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1106.516 | 231622.00 | 310306.00 | 664.90 | ?TTFFTFTFT?FTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117800087.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117800087
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 795K 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-05b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2023-08
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2023-10
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2023-12
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717204305824
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:11:49] [INFO ] Load time of PNML (sax parser for PT used): 528 ms
[2024-06-01 01:11:49] [INFO ] Transformed 2430 places.
[2024-06-01 01:11:49] [INFO ] Transformed 3040 transitions.
[2024-06-01 01:11:49] [INFO ] Found NUPN structural information;
[2024-06-01 01:11:49] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 842 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (84 resets) in 3444 ms. (11 steps per ms) remains 12/16 properties
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 307 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 479 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (14 resets) in 635 ms. (62 steps per ms) remains 11/12 properties
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (10 resets) in 804 ms. (49 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 452 ms. (88 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (10 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (11 resets) in 214 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
// Phase 1: matrix 3040 rows 2430 cols
[2024-06-01 01:11:52] [INFO ] Computed 238 invariants in 301 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 448/646 variables, 40/238 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/646 variables, 448/686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 137/783 variables, 16/702 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 137/839 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1628/2411 variables, 175/1014 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2411 variables, 1628/2642 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2411 variables, 0/2642 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 19/2430 variables, 7/2649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2430 variables, 19/2668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2430/5470 variables, and 2668 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5065 ms.
Refiners :[Domain max(s): 2430/2430 constraints, Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 182/182 constraints, State Equation: 0/2430 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 448/646 variables, 40/238 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/646 variables, 448/686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 01:11:58] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 137/783 variables, 16/703 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 137/840 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1628/2411 variables, 175/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2411 variables, 1628/2643 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 01:12:02] [INFO ] Deduced a trap composed of 25 places in 1630 ms of which 19 ms to minimize.
[2024-06-01 01:12:04] [INFO ] Deduced a trap composed of 162 places in 2242 ms of which 24 ms to minimize.
SMT process timed out in 12902ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 198 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 2430 transition count 2599
Reduce places removed 441 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 447 rules applied. Total rules applied 888 place count 1989 transition count 2593
Reduce places removed 1 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 45 rules applied. Total rules applied 933 place count 1988 transition count 2549
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 59 rules applied. Total rules applied 992 place count 1944 transition count 2534
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 995 place count 1941 transition count 2534
Performed 511 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 511 Pre rules applied. Total rules applied 995 place count 1941 transition count 2023
Deduced a syphon composed of 511 places in 16 ms
Ensure Unique test removed 40 places
Reduce places removed 551 places and 0 transitions.
Iterating global reduction 5 with 1062 rules applied. Total rules applied 2057 place count 1390 transition count 2023
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 5 with 28 rules applied. Total rules applied 2085 place count 1381 transition count 2004
Reduce places removed 19 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 6 with 26 rules applied. Total rules applied 2111 place count 1362 transition count 1997
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2118 place count 1355 transition count 1997
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 14 Pre rules applied. Total rules applied 2118 place count 1355 transition count 1983
Deduced a syphon composed of 14 places in 15 ms
Ensure Unique test removed 12 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 2158 place count 1329 transition count 1983
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 2158 place count 1329 transition count 1971
Deduced a syphon composed of 12 places in 16 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 2182 place count 1317 transition count 1971
Discarding 77 places :
Symmetric choice reduction at 8 with 77 rule applications. Total rules 2259 place count 1240 transition count 1894
Iterating global reduction 8 with 77 rules applied. Total rules applied 2336 place count 1240 transition count 1894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2337 place count 1240 transition count 1893
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 21 Pre rules applied. Total rules applied 2337 place count 1240 transition count 1872
Deduced a syphon composed of 21 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 43 rules applied. Total rules applied 2380 place count 1218 transition count 1872
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2380 place count 1218 transition count 1871
Deduced a syphon composed of 1 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2383 place count 1216 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2385 place count 1214 transition count 1859
Iterating global reduction 9 with 2 rules applied. Total rules applied 2387 place count 1214 transition count 1859
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 2387 place count 1214 transition count 1857
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2391 place count 1212 transition count 1857
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 9 with 234 rules applied. Total rules applied 2625 place count 1094 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2626 place count 1093 transition count 1740
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 2628 place count 1092 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2629 place count 1091 transition count 1739
Iterating global reduction 9 with 1 rules applied. Total rules applied 2630 place count 1091 transition count 1739
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2632 place count 1091 transition count 1737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2633 place count 1090 transition count 1737
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2635 place count 1089 transition count 1746
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 2642 place count 1089 transition count 1739
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 2649 place count 1082 transition count 1739
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2657 place count 1082 transition count 1731
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 2665 place count 1074 transition count 1731
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 2672 place count 1074 transition count 1731
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2673 place count 1073 transition count 1730
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2674 place count 1072 transition count 1730
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2674 place count 1072 transition count 1729
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2676 place count 1071 transition count 1729
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2678 place count 1070 transition count 1728
Applied a total of 2678 rules in 1960 ms. Remains 1070 /2430 variables (removed 1360) and now considering 1728/3040 (removed 1312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1982 ms. Remains : 1070/2430 places, 1728/3040 transitions.
RANDOM walk for 40000 steps (233 resets) in 652 ms. (61 steps per ms) remains 10/11 properties
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (41 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 347 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (44 resets) in 342 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 307 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (46 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (45 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (45 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 128848 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 10
Probabilistic random walk after 128848 steps, saw 31184 distinct states, run finished after 3009 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 1728 rows 1070 cols
[2024-06-01 01:12:10] [INFO ] Computed 171 invariants in 77 ms
[2024-06-01 01:12:10] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 265/445 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 25/470 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 594/1064 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/1065 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1065 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 5/1070 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1070 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1728/2798 variables, 1070/1241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2798 variables, 20/1261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2798 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/2798 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2798/2798 variables, and 1261 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6763 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 1070/1070 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 265/445 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 25/470 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 594/1064 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 01:12:19] [INFO ] Deduced a trap composed of 82 places in 1021 ms of which 11 ms to minimize.
[2024-06-01 01:12:21] [INFO ] Deduced a trap composed of 28 places in 1378 ms of which 13 ms to minimize.
Problem ASLink-PT-05b-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 01:12:22] [INFO ] Deduced a trap composed of 110 places in 1011 ms of which 12 ms to minimize.
[2024-06-01 01:12:23] [INFO ] Deduced a trap composed of 43 places in 1038 ms of which 14 ms to minimize.
[2024-06-01 01:12:23] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 5/171 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 01:12:25] [INFO ] Deduced a trap composed of 91 places in 595 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 01:12:27] [INFO ] Deduced a trap composed of 199 places in 1363 ms of which 15 ms to minimize.
[2024-06-01 01:12:28] [INFO ] Deduced a trap composed of 202 places in 1082 ms of which 11 ms to minimize.
[2024-06-01 01:12:29] [INFO ] Deduced a trap composed of 36 places in 760 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1064 variables, 3/175 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 01:12:30] [INFO ] Deduced a trap composed of 34 places in 304 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1064 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1064 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/1065 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1065 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 5/1070 variables, 4/181 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1070 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem ASLink-PT-05b-ReachabilityFireability-2024-01 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05b-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05b-ReachabilityFireability-2024-06 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05b-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05b-ReachabilityFireability-2023-08 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityFireability-2023-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05b-ReachabilityFireability-2023-12 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityFireability-2023-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-05b-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 1728/2798 variables, 1070/1251 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2798 variables, 20/1271 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2798 variables, 2/1273 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2798/2798 variables, and 1273 constraints, problems are : Problem set: 8 solved, 2 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 1070/1070 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 10/10 constraints]
After SMT, in 52051ms problems are : Problem set: 8 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1070 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1070/1070 places, 1728/1728 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1070 transition count 1698
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 1039 transition count 1695
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 1036 transition count 1695
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 67 place count 1036 transition count 1603
Deduced a syphon composed of 92 places in 7 ms
Ensure Unique test removed 10 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 261 place count 934 transition count 1603
Discarding 1 places :
Implicit places reduction removed 1 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 3 with 2 rules applied. Total rules applied 263 place count 933 transition count 1602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 932 transition count 1602
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 264 place count 932 transition count 1598
Deduced a syphon composed of 4 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 274 place count 926 transition count 1598
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 277 place count 923 transition count 1585
Iterating global reduction 5 with 3 rules applied. Total rules applied 280 place count 923 transition count 1585
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 280 place count 923 transition count 1583
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 284 place count 921 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 285 place count 920 transition count 1577
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 920 transition count 1577
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 287 place count 919 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 288 place count 918 transition count 1576
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 918 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 290 place count 917 transition count 1575
Iterating global reduction 6 with 1 rules applied. Total rules applied 291 place count 917 transition count 1575
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 45 rules applied. Total rules applied 336 place count 894 transition count 1553
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 6 with 2 rules applied. Total rules applied 338 place count 894 transition count 1551
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 339 place count 893 transition count 1551
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 343 place count 893 transition count 1547
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 347 place count 889 transition count 1547
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 350 place count 889 transition count 1608
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 353 place count 886 transition count 1608
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 355 place count 886 transition count 1608
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 359 place count 882 transition count 1604
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 8 rules applied. Total rules applied 367 place count 876 transition count 1602
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 369 place count 874 transition count 1602
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 9 Pre rules applied. Total rules applied 369 place count 874 transition count 1593
Deduced a syphon composed of 9 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 19 rules applied. Total rules applied 388 place count 864 transition count 1593
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 12 with 4 rules applied. Total rules applied 392 place count 860 transition count 1593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 392 place count 860 transition count 1592
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 394 place count 859 transition count 1592
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 13 with 16 rules applied. Total rules applied 410 place count 851 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 413 place count 848 transition count 1581
Iterating global reduction 13 with 3 rules applied. Total rules applied 416 place count 848 transition count 1581
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 419 place count 848 transition count 1578
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 422 place count 845 transition count 1578
Applied a total of 422 rules in 776 ms. Remains 845 /1070 variables (removed 225) and now considering 1578/1728 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 776 ms. Remains : 845/1070 places, 1578/1728 transitions.
RANDOM walk for 40000 steps (443 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (87 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (82 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 214483 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 214483 steps, saw 45494 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 1578 rows 845 cols
[2024-06-01 01:13:06] [INFO ] Computed 143 invariants in 24 ms
[2024-06-01 01:13:06] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 164/184 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/197 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 484/681 variables, 79/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/681 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 33/714 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 130/844 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/845 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/845 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1578/2423 variables, 845/988 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2423 variables, 5/993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2423 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2423 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2423/2423 variables, and 993 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1505 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 845/845 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 164/184 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/197 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 484/681 variables, 79/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/681 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 33/714 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:13:09] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/714 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 130/844 variables, 28/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/844 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/845 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/845 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1578/2423 variables, 845/989 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2423 variables, 5/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2423 variables, 2/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2423/2423 variables, and 996 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29902 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 845/845 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 31458ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 9420 ms.
Support contains 20 out of 845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 845/845 places, 1578/1578 transitions.
Applied a total of 0 rules in 47 ms. Remains 845 /845 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 845/845 places, 1578/1578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 845/845 places, 1578/1578 transitions.
Applied a total of 0 rules in 29 ms. Remains 845 /845 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
[2024-06-01 01:13:47] [INFO ] Invariant cache hit.
[2024-06-01 01:13:49] [INFO ] Implicit Places using invariants in 1959 ms returned [1, 19, 20, 32, 50, 68, 139, 144, 153, 154, 156, 174, 192, 262, 266, 267, 278, 279, 283, 300, 318, 415, 416, 417, 418, 420, 437, 455, 526, 530, 531, 542, 543, 545, 562, 580, 655, 656, 659, 670, 671, 672, 708, 710, 714, 732, 733, 734, 735, 747, 753, 759, 765, 771, 777, 783, 789, 795, 801, 807]
[2024-06-01 01:13:49] [INFO ] Actually due to overlaps returned [708, 734, 672, 50, 174, 283, 300, 437, 562, 714, 32, 156, 420, 153, 278, 417, 542, 545, 670, 732, 154, 279, 418, 543, 671, 710, 733, 1, 19, 266, 267, 416, 530, 531, 655, 656, 68, 192, 318, 415, 455, 580, 20, 659, 735, 759, 765, 771, 789]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1975 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 796/845 places, 1578/1578 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 793 transition count 1486
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 104 rules applied. Total rules applied 199 place count 701 transition count 1474
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 207 place count 693 transition count 1474
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 207 place count 693 transition count 1446
Deduced a syphon composed of 28 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 264 place count 664 transition count 1446
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 3 with 3 rules applied. Total rules applied 267 place count 662 transition count 1445
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 269 place count 661 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 660 transition count 1444
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 273 place count 657 transition count 1441
Iterating global reduction 6 with 3 rules applied. Total rules applied 276 place count 657 transition count 1441
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 366 place count 612 transition count 1396
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 370 place count 608 transition count 1392
Iterating global reduction 6 with 4 rules applied. Total rules applied 374 place count 608 transition count 1392
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 377 place count 608 transition count 1389
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 385 place count 604 transition count 1410
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 386 place count 604 transition count 1409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 387 place count 603 transition count 1409
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 405 place count 603 transition count 1391
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 423 place count 585 transition count 1391
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 424 place count 585 transition count 1390
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 439 place count 585 transition count 1390
Applied a total of 439 rules in 432 ms. Remains 585 /796 variables (removed 211) and now considering 1390/1578 (removed 188) transitions.
// Phase 1: matrix 1390 rows 585 cols
[2024-06-01 01:13:50] [INFO ] Computed 88 invariants in 24 ms
[2024-06-01 01:13:51] [INFO ] Implicit Places using invariants in 857 ms returned [91, 97, 104, 106, 109, 110, 164, 181, 187, 190, 192, 256, 277, 283, 286, 288, 290, 295, 296, 348, 366, 372, 375, 377, 382, 383, 460, 463, 465, 542, 543, 545, 546, 552, 553, 555, 556, 559, 560, 562, 563, 565, 566, 567, 570, 574, 582]
[2024-06-01 01:13:51] [INFO ] Actually due to overlaps returned [552, 559, 565, 542, 545, 555, 562, 109, 295, 382, 296, 383, 110, 290, 91, 97, 104, 181, 187, 192, 277, 283, 288, 372, 377, 460, 465, 567, 574, 582, 106, 164, 256, 348, 366, 570]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 865 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 549/845 places, 1390/1578 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 549 transition count 1386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 545 transition count 1386
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 33 place count 520 transition count 1326
Iterating global reduction 2 with 25 rules applied. Total rules applied 58 place count 520 transition count 1326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 70 place count 520 transition count 1314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 520 transition count 1313
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 519 transition count 1313
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 515 transition count 1308
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 515 transition count 1308
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 102 place count 504 transition count 1297
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 116 place count 504 transition count 1283
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 130 place count 490 transition count 1283
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 490 transition count 1281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 488 transition count 1281
Applied a total of 134 rules in 159 ms. Remains 488 /549 variables (removed 61) and now considering 1281/1390 (removed 109) transitions.
[2024-06-01 01:13:51] [INFO ] Flow matrix only has 1277 transitions (discarded 4 similar events)
// Phase 1: matrix 1277 rows 488 cols
[2024-06-01 01:13:51] [INFO ] Computed 52 invariants in 13 ms
[2024-06-01 01:13:51] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-06-01 01:13:51] [INFO ] Flow matrix only has 1277 transitions (discarded 4 similar events)
[2024-06-01 01:13:51] [INFO ] Invariant cache hit.
[2024-06-01 01:13:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 01:13:54] [INFO ] Implicit Places using invariants and state equation in 2457 ms returned []
Implicit Place search using SMT with State Equation took 3099 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 488/845 places, 1281/1578 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6569 ms. Remains : 488/845 places, 1281/1578 transitions.
RANDOM walk for 40000 steps (652 resets) in 1119 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (169 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (158 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 247846 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 247846 steps, saw 59499 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 01:13:57] [INFO ] Flow matrix only has 1277 transitions (discarded 4 similar events)
[2024-06-01 01:13:57] [INFO ] Invariant cache hit.
[2024-06-01 01:13:57] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 109/129 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/152 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 319/471 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/475 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/488 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1277/1765 variables, 488/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1765 variables, 3/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1765 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1765 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1765/1765 variables, and 543 constraints, problems are : Problem set: 0 solved, 2 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 488/488 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 109/129 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/152 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 319/471 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/475 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:13:59] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/488 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1277/1765 variables, 488/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1765 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1765 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:14:11] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1765 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1765 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1765 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1765/1765 variables, and 547 constraints, problems are : Problem set: 0 solved, 2 unsolved in 14049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 488/488 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 14949ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 4866 ms.
Support contains 20 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 1281/1281 transitions.
Applied a total of 0 rules in 19 ms. Remains 488 /488 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 488/488 places, 1281/1281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 1281/1281 transitions.
Applied a total of 0 rules in 17 ms. Remains 488 /488 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2024-06-01 01:14:17] [INFO ] Flow matrix only has 1277 transitions (discarded 4 similar events)
[2024-06-01 01:14:17] [INFO ] Invariant cache hit.
[2024-06-01 01:14:18] [INFO ] Implicit Places using invariants in 711 ms returned []
[2024-06-01 01:14:18] [INFO ] Flow matrix only has 1277 transitions (discarded 4 similar events)
[2024-06-01 01:14:18] [INFO ] Invariant cache hit.
[2024-06-01 01:14:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 01:14:20] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 3359 ms to find 0 implicit places.
[2024-06-01 01:14:21] [INFO ] Redundant transitions in 166 ms returned []
Running 1254 sub problems to find dead transitions.
[2024-06-01 01:14:21] [INFO ] Flow matrix only has 1277 transitions (discarded 4 similar events)
[2024-06-01 01:14:21] [INFO ] Invariant cache hit.
[2024-06-01 01:14:21] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 1254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1765 variables, and 44 constraints, problems are : Problem set: 0 solved, 1254 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 36/39 constraints, State Equation: 0/488 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1254/1254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 1254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1254 unsolved
At refinement iteration 3 (OVERLAPS) 2/488 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 1254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1765 variables, and 52 constraints, problems are : Problem set: 0 solved, 1254 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/488 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1254 constraints, Known Traps: 0/0 constraints]
After SMT, in 61428ms problems are : Problem set: 0 solved, 1254 unsolved
Search for dead transitions found 0 dead transitions in 61455ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65021 ms. Remains : 488/488 places, 1281/1281 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 488 transition count 1277
Applied a total of 4 rules in 34 ms. Remains 488 /488 variables (removed 0) and now considering 1277/1281 (removed 4) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1277 rows 488 cols
[2024-06-01 01:15:22] [INFO ] Computed 52 invariants in 20 ms
[2024-06-01 01:15:22] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 01:15:22] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 41 ms returned sat
[2024-06-01 01:15:22] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 01:15:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 01:15:23] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 33 ms returned sat
[2024-06-01 01:15:26] [INFO ] After 2953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 01:15:30] [INFO ] After 7393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 01:15:36] [INFO ] After 13641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 14000 ms.
[2024-06-01 01:15:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 01:15:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 488 places, 1281 transitions and 5193 arcs took 14 ms.
[2024-06-01 01:15:37] [INFO ] Flatten gal took : 280 ms
Total runtime 228851 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ASLink-PT-05b-ReachabilityFireability-2024-00
Could not compute solution for formula : ASLink-PT-05b-ReachabilityFireability-2023-10
BK_STOP 1717204537446
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-05b-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/630/inv_0_
rfs formula name ASLink-PT-05b-ReachabilityFireability-2023-10
rfs formula type AG
rfs formula formula --invariant=/tmp/630/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117800087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05b.tgz
mv ASLink-PT-05b 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 '
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 ;