About the Execution of LTSMin+red for ASLink-PT-03a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 672.628 | 204975.00 | 320819.00 | 499.50 | TFFTFTFF?FT?FF?? | 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-171620117700046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-03a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700046
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 357K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2023-08
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2023-11
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2023-14
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717190053384
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:14:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:14:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:14:15] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2024-05-31 21:14:15] [INFO ] Transformed 821 places.
[2024-05-31 21:14:15] [INFO ] Transformed 1281 transitions.
[2024-05-31 21:14:15] [INFO ] Found NUPN structural information;
[2024-05-31 21:14:15] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (344 resets) in 2396 ms. (16 steps per ms) remains 9/15 properties
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (67 resets) in 597 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (78 resets) in 940 ms. (42 steps per ms) remains 8/9 properties
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (63 resets) in 291 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (82 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (69 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (74 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (79 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (68 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
// Phase 1: matrix 1268 rows 821 cols
[2024-05-31 21:14:17] [INFO ] Computed 156 invariants in 89 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 93/184 variables, 18/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 93/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 59/243 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 59/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem ASLink-PT-03a-ReachabilityCardinality-2024-13 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 567/810 variables, 117/396 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 567/963 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/810 variables, 0/963 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 11/821 variables, 3/966 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/821 variables, 11/977 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/821 variables, 0/977 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1268/2089 variables, 821/1798 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2089 variables, 0/1798 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/2089 variables, 0/1798 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2089/2089 variables, and 1798 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3356 ms.
Refiners :[Domain max(s): 821/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 120/120 constraints, State Equation: 821/821 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 94/163 variables, 18/87 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 94/181 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 59/222 variables, 18/199 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 59/258 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 583/805 variables, 115/373 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 583/956 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-31 21:14:22] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 31 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/805 variables, 1/957 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-31 21:14:22] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/805 variables, 1/958 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/805 variables, 0/958 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 16/821 variables, 5/963 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/821 variables, 16/979 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/821 variables, 0/979 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1268/2089 variables, 821/1800 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2089 variables, 7/1807 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2089/2089 variables, and 1807 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5012 ms.
Refiners :[Domain max(s): 821/821 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 120/120 constraints, State Equation: 821/821 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 8614ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 803 transition count 1215
Reduce places removed 53 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 57 rules applied. Total rules applied 128 place count 750 transition count 1211
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 132 place count 746 transition count 1211
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 132 place count 746 transition count 1152
Deduced a syphon composed of 59 places in 4 ms
Ensure Unique test removed 21 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 271 place count 666 transition count 1152
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 273 place count 665 transition count 1151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 664 transition count 1151
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 280 place count 658 transition count 1122
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 287 place count 657 transition count 1122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 293 place count 656 transition count 1117
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 296 place count 653 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 297 place count 652 transition count 1109
Iterating global reduction 7 with 1 rules applied. Total rules applied 298 place count 652 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 299 place count 651 transition count 1101
Iterating global reduction 7 with 1 rules applied. Total rules applied 300 place count 651 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 301 place count 650 transition count 1093
Iterating global reduction 7 with 1 rules applied. Total rules applied 302 place count 650 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 303 place count 649 transition count 1085
Iterating global reduction 7 with 1 rules applied. Total rules applied 304 place count 649 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 305 place count 648 transition count 1077
Iterating global reduction 7 with 1 rules applied. Total rules applied 306 place count 648 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 307 place count 647 transition count 1069
Iterating global reduction 7 with 1 rules applied. Total rules applied 308 place count 647 transition count 1069
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 309 place count 646 transition count 1061
Iterating global reduction 7 with 1 rules applied. Total rules applied 310 place count 646 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 311 place count 645 transition count 1053
Iterating global reduction 7 with 1 rules applied. Total rules applied 312 place count 645 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 313 place count 644 transition count 1045
Iterating global reduction 7 with 1 rules applied. Total rules applied 314 place count 644 transition count 1045
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 350 place count 626 transition count 1027
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 354 place count 626 transition count 1023
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 358 place count 622 transition count 1023
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 362 place count 622 transition count 1023
Applied a total of 362 rules in 724 ms. Remains 622 /821 variables (removed 199) and now considering 1023/1268 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 622/821 places, 1023/1268 transitions.
RANDOM walk for 40000 steps (469 resets) in 635 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (115 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (127 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (95 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (123 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (130 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (126 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (106 resets) in 277 ms. (143 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 161479 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :3 out of 7
Probabilistic random walk after 161479 steps, saw 63966 distinct states, run finished after 3009 ms. (steps per millisecond=53 ) properties seen :3
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1023 rows 622 cols
[2024-05-31 21:14:30] [INFO ] Computed 114 invariants in 40 ms
[2024-05-31 21:14:30] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 100/144 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 45/189 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 423/612 variables, 84/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/622 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1023/1645 variables, 622/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1645 variables, 14/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1645 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1645 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1645/1645 variables, and 750 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 86/86 constraints, State Equation: 622/622 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 100/144 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 45/189 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 423/612 variables, 84/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/622 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1023/1645 variables, 622/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1645 variables, 14/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1645 variables, 4/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1645 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1645 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1645/1645 variables, and 754 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7408 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 86/86 constraints, State Equation: 622/622 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8723ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 15799 ms.
Support contains 44 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1023/1023 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 622 transition count 1021
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 620 transition count 1019
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 618 transition count 1019
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 8 place count 618 transition count 1013
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 25 place count 607 transition count 1013
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 606 transition count 1005
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 606 transition count 1005
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 605 transition count 997
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 605 transition count 997
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 604 transition count 989
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 604 transition count 989
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 603 transition count 981
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 603 transition count 981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 602 transition count 973
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 602 transition count 973
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 601 transition count 965
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 601 transition count 965
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 600 transition count 964
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 600 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 599 transition count 963
Applied a total of 41 rules in 159 ms. Remains 599 /622 variables (removed 23) and now considering 963/1023 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 599/622 places, 963/1023 transitions.
RANDOM walk for 40000 steps (481 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (89 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (129 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (138 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (114 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 178093 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 4
Probabilistic random walk after 178093 steps, saw 72314 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 963 rows 599 cols
[2024-05-31 21:14:58] [INFO ] Computed 109 invariants in 14 ms
[2024-05-31 21:14:58] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/152 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/191 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 399/590 variables, 78/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/599 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 963/1562 variables, 599/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1562 variables, 15/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1562/1562 variables, and 723 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 599/599 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 108/152 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/191 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 399/590 variables, 78/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/599 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 963/1562 variables, 599/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1562 variables, 15/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1562 variables, 4/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1562 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1562 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 727 constraints, problems are : Problem set: 0 solved, 4 unsolved in 21174 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 599/599 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 22362ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 31265 ms.
Support contains 44 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 963/963 transitions.
Applied a total of 0 rules in 35 ms. Remains 599 /599 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 599/599 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 963/963 transitions.
Applied a total of 0 rules in 21 ms. Remains 599 /599 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-31 21:15:52] [INFO ] Invariant cache hit.
[2024-05-31 21:15:53] [INFO ] Implicit Places using invariants in 889 ms returned [1, 19, 20, 22, 32, 50, 68, 150, 163, 166, 168, 186, 204, 287, 300, 301, 302, 303, 304, 322, 340, 420, 425, 436, 441, 442, 443, 462, 464, 467, 485, 486, 487, 500, 506, 518, 530, 536, 542, 548, 554, 561]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 908 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 557/599 places, 963/963 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 557 transition count 918
Reduce places removed 45 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 58 rules applied. Total rules applied 103 place count 512 transition count 905
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 116 place count 499 transition count 905
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 116 place count 499 transition count 888
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 150 place count 482 transition count 888
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 11 rules applied. Total rules applied 161 place count 475 transition count 884
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 166 place count 471 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 470 transition count 883
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 174 place count 463 transition count 876
Iterating global reduction 6 with 7 rules applied. Total rules applied 181 place count 463 transition count 876
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 183 place count 461 transition count 874
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 461 transition count 874
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 186 place count 461 transition count 873
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 252 place count 428 transition count 840
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 253 place count 427 transition count 839
Iterating global reduction 7 with 1 rules applied. Total rules applied 254 place count 427 transition count 839
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 255 place count 427 transition count 838
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 260 place count 427 transition count 833
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 265 place count 422 transition count 833
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 284 place count 422 transition count 814
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 303 place count 403 transition count 814
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 304 place count 403 transition count 813
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 311 place count 403 transition count 813
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 312 place count 403 transition count 813
Applied a total of 312 rules in 202 ms. Remains 403 /557 variables (removed 154) and now considering 813/963 (removed 150) transitions.
// Phase 1: matrix 813 rows 403 cols
[2024-05-31 21:15:53] [INFO ] Computed 60 invariants in 7 ms
[2024-05-31 21:15:53] [INFO ] Implicit Places using invariants in 445 ms returned [109, 118, 125, 126, 181, 200, 207, 210, 216, 221, 223, 300, 303, 305, 308, 376, 381, 394, 396, 400, 402]
[2024-05-31 21:15:53] [INFO ] Actually due to overlaps returned [216, 221, 223, 200, 207, 300, 305, 109, 118, 181, 210, 308, 376, 381, 394, 400]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 451 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 387/599 places, 813/963 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 381 transition count 807
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 381 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 380 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 380 transition count 806
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 377 transition count 803
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 377 transition count 800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 374 transition count 800
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 374 transition count 799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 373 transition count 799
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 373 transition count 799
Applied a total of 31 rules in 83 ms. Remains 373 /387 variables (removed 14) and now considering 799/813 (removed 14) transitions.
// Phase 1: matrix 799 rows 373 cols
[2024-05-31 21:15:53] [INFO ] Computed 44 invariants in 7 ms
[2024-05-31 21:15:54] [INFO ] Implicit Places using invariants in 381 ms returned [122, 123, 367]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 384 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 370/599 places, 799/963 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 369 transition count 798
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 369 transition count 798
Applied a total of 2 rules in 20 ms. Remains 369 /370 variables (removed 1) and now considering 798/799 (removed 1) transitions.
// Phase 1: matrix 798 rows 369 cols
[2024-05-31 21:15:54] [INFO ] Computed 41 invariants in 7 ms
[2024-05-31 21:15:54] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-31 21:15:54] [INFO ] Invariant cache hit.
[2024-05-31 21:15:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 21:15:55] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 369/599 places, 798/963 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3427 ms. Remains : 369/599 places, 798/963 transitions.
RANDOM walk for 40000 steps (646 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (154 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (202 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (196 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (154 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 222303 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 222303 steps, saw 105793 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-31 21:15:58] [INFO ] Invariant cache hit.
[2024-05-31 21:15:58] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 139/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/187 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 182/369 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 798/1167 variables, 369/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1167 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1167 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1167 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 414 constraints, problems are : Problem set: 0 solved, 4 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 139/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:15:59] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
[2024-05-31 21:15:59] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
[2024-05-31 21:15:59] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 4/187 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 182/369 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:15:59] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 798/1167 variables, 369/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1167 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1167 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1167 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1167 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 422 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3414 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 369/369 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 4080ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 22254 ms.
Support contains 44 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 798/798 transitions.
Applied a total of 0 rules in 13 ms. Remains 369 /369 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 369/369 places, 798/798 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 798/798 transitions.
Applied a total of 0 rules in 11 ms. Remains 369 /369 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2024-05-31 21:16:25] [INFO ] Invariant cache hit.
[2024-05-31 21:16:25] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-31 21:16:25] [INFO ] Invariant cache hit.
[2024-05-31 21:16:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 21:16:26] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2024-05-31 21:16:26] [INFO ] Redundant transitions in 53 ms returned []
Running 797 sub problems to find dead transitions.
[2024-05-31 21:16:26] [INFO ] Invariant cache hit.
[2024-05-31 21:16:26] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 797 unsolved
[2024-05-31 21:16:46] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-31 21:16:46] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:16:51] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 6 ms to minimize.
[2024-05-31 21:16:52] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 4 ms to minimize.
[2024-05-31 21:16:52] [INFO ] Deduced a trap composed of 58 places in 293 ms of which 4 ms to minimize.
[2024-05-31 21:16:54] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-31 21:16:54] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-31 21:16:54] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 4 ms to minimize.
[2024-05-31 21:16:56] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 3 ms to minimize.
[2024-05-31 21:16:56] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:16:57] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/1167 variables, and 52 constraints, problems are : Problem set: 0 solved, 797 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 797/797 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 797 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 797 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 797 unsolved
[2024-05-31 21:17:12] [INFO ] Deduced a trap composed of 52 places in 278 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 797 unsolved
[2024-05-31 21:17:25] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 797 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1167 variables, and 54 constraints, problems are : Problem set: 0 solved, 797 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/797 constraints, Known Traps: 13/13 constraints]
After SMT, in 60661ms problems are : Problem set: 0 solved, 797 unsolved
Search for dead transitions found 0 dead transitions in 60674ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62361 ms. Remains : 369/369 places, 798/798 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 368 transition count 797
Applied a total of 2 rules in 22 ms. Remains 368 /369 variables (removed 1) and now considering 797/798 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 797 rows 368 cols
[2024-05-31 21:17:27] [INFO ] Computed 41 invariants in 6 ms
[2024-05-31 21:17:27] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 21:17:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-31 21:17:27] [INFO ] [Nat]Absence check using 14 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-31 21:17:29] [INFO ] After 1661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 21:17:29] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-05-31 21:17:29] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-31 21:17:30] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-05-31 21:17:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
TRAPS : Iteration 1
[2024-05-31 21:17:34] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 3 ms to minimize.
[2024-05-31 21:17:34] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-31 21:17:34] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-31 21:17:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 383 ms
TRAPS : Iteration 2
[2024-05-31 21:17:36] [INFO ] After 9038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 21:17:37] [INFO ] After 9843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 10015 ms.
[2024-05-31 21:17:37] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-31 21:17:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 369 places, 798 transitions and 3171 arcs took 10 ms.
[2024-05-31 21:17:37] [INFO ] Flatten gal took : 162 ms
Total runtime 202872 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-03a-ReachabilityCardinality-2023-08
Could not compute solution for formula : ASLink-PT-03a-ReachabilityCardinality-2023-11
Could not compute solution for formula : ASLink-PT-03a-ReachabilityCardinality-2023-14
Could not compute solution for formula : ASLink-PT-03a-ReachabilityCardinality-2024-15
BK_STOP 1717190258359
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-03a-ReachabilityCardinality-2023-08
rfs formula type EF
rfs formula formula --invariant=/tmp/660/inv_0_
rfs formula name ASLink-PT-03a-ReachabilityCardinality-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/660/inv_1_
rfs formula name ASLink-PT-03a-ReachabilityCardinality-2023-14
rfs formula type AG
rfs formula formula --invariant=/tmp/660/inv_2_
rfs formula name ASLink-PT-03a-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/660/inv_3_
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-03a"
export BK_EXAMINATION="ReachabilityCardinality"
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-03a, examination is ReachabilityCardinality"
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-171620117700046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03a.tgz
mv ASLink-PT-03a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;