About the Execution of LTSMin+red for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5943.979 | 108508.00 | 159465.00 | 225.90 | TT?TTTTT?FFTFTTT | 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.r496-tall-171640603100303.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 FunctionPointer-PT-c016, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100303
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c016-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2023-02
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717192955897
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:02:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:02:37] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2024-05-31 22:02:37] [INFO ] Transformed 2826 places.
[2024-05-31 22:02:37] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:02:37] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40019 steps (8 resets) in 2718 ms. (14 steps per ms) remains 10/12 properties
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (17 resets) in 204 ms. (195 steps per ms) remains 9/10 properties
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (13 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1099 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
[2024-05-31 22:02:39] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 22:02:39] [INFO ] Computed 4 invariants in 94 ms
[2024-05-31 22:02:39] [INFO ] State equation strengthened by 479 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FunctionPointer-PT-c016-ReachabilityFireability-2024-09 is UNSAT
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c016-ReachabilityFireability-2024-10 is UNSAT
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 536/574 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/575 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/575 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1554/2129 variables, 575/579 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2129 variables, 401/980 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2129 variables, 0/980 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1948/4077 variables, 513/1493 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4077 variables, 78/1571 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4077 variables, 0/1571 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 698/4775 variables, 443/2014 constraints. Problems are: Problem set: 2 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/4775 variables, 0/2014 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 369/5144 variables, 73/2087 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5144 variables, 0/2087 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 24/5168 variables, 24/2111 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 2 solved, 7 unsolved in 4464 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 540/565 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-31 22:02:44] [INFO ] Deduced a trap composed of 135 places in 313 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/566 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1488/2054 variables, 566/571 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2054 variables, 399/970 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2054 variables, 0/970 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1793/3847 variables, 477/1447 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3847 variables, 80/1527 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3847 variables, 6/1533 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3847 variables, 0/1533 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 716/4563 variables, 436/1969 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4563 variables, 0/1969 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 493/5056 variables, 101/2070 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5056/5168 variables, and 2070 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1580/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 9949ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.12 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 290 places :
Symmetric choice reduction at 0 with 290 rule applications. Total rules 291 place count 1321 transition count 3826
Iterating global reduction 0 with 290 rules applied. Total rules applied 581 place count 1321 transition count 3826
Ensure Unique test removed 446 transitions
Reduce isomorphic transitions removed 446 transitions.
Iterating post reduction 0 with 446 rules applied. Total rules applied 1027 place count 1321 transition count 3380
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 1175 place count 1173 transition count 3084
Iterating global reduction 1 with 148 rules applied. Total rules applied 1323 place count 1173 transition count 3084
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 1427 place count 1173 transition count 2980
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1441 place count 1159 transition count 2952
Iterating global reduction 2 with 14 rules applied. Total rules applied 1455 place count 1159 transition count 2952
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1469 place count 1145 transition count 2924
Iterating global reduction 2 with 14 rules applied. Total rules applied 1483 place count 1145 transition count 2924
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1497 place count 1131 transition count 2896
Iterating global reduction 2 with 14 rules applied. Total rules applied 1511 place count 1131 transition count 2896
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1525 place count 1117 transition count 2868
Iterating global reduction 2 with 14 rules applied. Total rules applied 1539 place count 1117 transition count 2868
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1553 place count 1103 transition count 2840
Iterating global reduction 2 with 14 rules applied. Total rules applied 1567 place count 1103 transition count 2840
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1579 place count 1091 transition count 2816
Iterating global reduction 2 with 12 rules applied. Total rules applied 1591 place count 1091 transition count 2816
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1603 place count 1079 transition count 2792
Iterating global reduction 2 with 12 rules applied. Total rules applied 1615 place count 1079 transition count 2792
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1653 place count 1041 transition count 2654
Iterating global reduction 2 with 38 rules applied. Total rules applied 1691 place count 1041 transition count 2654
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1740 place count 992 transition count 2458
Iterating global reduction 2 with 49 rules applied. Total rules applied 1789 place count 992 transition count 2458
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1837 place count 944 transition count 2324
Iterating global reduction 2 with 48 rules applied. Total rules applied 1885 place count 944 transition count 2324
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1933 place count 896 transition count 2228
Iterating global reduction 2 with 48 rules applied. Total rules applied 1981 place count 896 transition count 2228
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 2029 place count 848 transition count 2132
Iterating global reduction 2 with 48 rules applied. Total rules applied 2077 place count 848 transition count 2132
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 2124 place count 801 transition count 2038
Iterating global reduction 2 with 47 rules applied. Total rules applied 2171 place count 801 transition count 2038
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 2218 place count 754 transition count 1944
Iterating global reduction 2 with 47 rules applied. Total rules applied 2265 place count 754 transition count 1944
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 2282 place count 737 transition count 1910
Iterating global reduction 2 with 17 rules applied. Total rules applied 2299 place count 737 transition count 1910
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 2329 place count 737 transition count 1880
Applied a total of 2329 rules in 1465 ms. Remains 737 /1628 variables (removed 891) and now considering 1880/5962 (removed 4082) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1474 ms. Remains : 737/1628 places, 1880/5962 transitions.
RANDOM walk for 40017 steps (8 resets) in 237 ms. (168 steps per ms) remains 6/7 properties
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 5/6 properties
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
[2024-05-31 22:02:50] [INFO ] Flow matrix only has 1270 transitions (discarded 610 similar events)
// Phase 1: matrix 1270 rows 737 cols
[2024-05-31 22:02:50] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 22:02:50] [INFO ] State equation strengthened by 311 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 381/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 972/1375 variables, 403/404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1375 variables, 228/632 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1375 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 530/1905 variables, 236/868 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1905 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1905 variables, 83/952 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1905 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 102/2007 variables, 98/1050 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2007 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2007 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2007/2007 variables, and 1050 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 737/737 constraints, ReadFeed: 311/311 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 381/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 972/1375 variables, 403/404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1375 variables, 228/632 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1375 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 530/1905 variables, 236/868 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1905 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1905 variables, 83/952 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1905 variables, 5/957 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:02:53] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1905 variables, 1/958 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1905 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 102/2007 variables, 98/1056 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:02:54] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2007 variables, 1/1057 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2007 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2007 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2007/2007 variables, and 1057 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 737/737 constraints, ReadFeed: 311/311 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 4655ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 4834 ms.
Support contains 21 out of 737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 737/737 places, 1880/1880 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 735 transition count 1876
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 735 transition count 1876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 733 transition count 1872
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 733 transition count 1872
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 731 transition count 1866
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 731 transition count 1866
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 729 transition count 1862
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 729 transition count 1862
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 727 transition count 1858
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 727 transition count 1858
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 726 transition count 1856
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 726 transition count 1856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 725 transition count 1854
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 725 transition count 1854
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 724 transition count 1852
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 724 transition count 1852
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 723 transition count 1850
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 723 transition count 1850
Applied a total of 28 rules in 255 ms. Remains 723 /737 variables (removed 14) and now considering 1850/1880 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 723/737 places, 1850/1880 transitions.
RANDOM walk for 40025 steps (8 resets) in 165 ms. (241 steps per ms) remains 2/4 properties
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
[2024-05-31 22:03:00] [INFO ] Flow matrix only has 1247 transitions (discarded 603 similar events)
// Phase 1: matrix 1247 rows 723 cols
[2024-05-31 22:03:00] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 22:03:00] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 381/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 954/1354 variables, 400/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1354 variables, 224/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1354 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 509/1863 variables, 224/849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1863 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1863 variables, 81/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1863 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 105/1968 variables, 97/1028 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1968 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1970 variables, 2/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1970 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1030 constraints, problems are : Problem set: 0 solved, 2 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 723/723 constraints, ReadFeed: 305/305 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 381/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 954/1354 variables, 400/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1354 variables, 224/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1354 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 509/1863 variables, 224/849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1863 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1863 variables, 81/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1863 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:03:02] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1863 variables, 1/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1863 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 105/1968 variables, 97/1031 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1968 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1970 variables, 2/1033 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1970 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1970 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1033 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 723/723 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2630ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 722 ms.
Support contains 19 out of 723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 723/723 places, 1850/1850 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 721 transition count 1846
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 721 transition count 1846
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 719 transition count 1842
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 719 transition count 1842
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 717 transition count 1834
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 717 transition count 1834
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 715 transition count 1830
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 715 transition count 1830
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 713 transition count 1826
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 713 transition count 1826
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 711 transition count 1822
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 711 transition count 1822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 709 transition count 1818
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 709 transition count 1818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 707 transition count 1814
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 707 transition count 1814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 705 transition count 1810
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 705 transition count 1810
Applied a total of 36 rules in 276 ms. Remains 705 /723 variables (removed 18) and now considering 1810/1850 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 705/723 places, 1810/1850 transitions.
RANDOM walk for 40011 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 339295 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 2
Probabilistic random walk after 339295 steps, saw 221015 distinct states, run finished after 3004 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-31 22:03:07] [INFO ] Flow matrix only has 1219 transitions (discarded 591 similar events)
// Phase 1: matrix 1219 rows 705 cols
[2024-05-31 22:03:07] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 22:03:07] [INFO ] State equation strengthened by 299 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 381/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 942/1342 variables, 400/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1342 variables, 220/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1342 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 487/1829 variables, 214/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1829 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1829 variables, 79/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1829 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 95/1924 variables, 91/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1924 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1924 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1924/1924 variables, and 1006 constraints, problems are : Problem set: 0 solved, 2 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 705/705 constraints, ReadFeed: 299/299 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 381/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 942/1342 variables, 400/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1342 variables, 220/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1342 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 487/1829 variables, 214/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1829 variables, 1/836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1829 variables, 79/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1829 variables, 2/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1829 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 95/1924 variables, 91/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1924 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1924 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1924/1924 variables, and 1008 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 705/705 constraints, ReadFeed: 299/299 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2115ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 865 ms.
Support contains 19 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1810/1810 transitions.
Applied a total of 0 rules in 99 ms. Remains 705 /705 variables (removed 0) and now considering 1810/1810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 705/705 places, 1810/1810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1810/1810 transitions.
Applied a total of 0 rules in 92 ms. Remains 705 /705 variables (removed 0) and now considering 1810/1810 (removed 0) transitions.
[2024-05-31 22:03:10] [INFO ] Flow matrix only has 1219 transitions (discarded 591 similar events)
[2024-05-31 22:03:10] [INFO ] Invariant cache hit.
[2024-05-31 22:03:10] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-31 22:03:10] [INFO ] Flow matrix only has 1219 transitions (discarded 591 similar events)
[2024-05-31 22:03:10] [INFO ] Invariant cache hit.
[2024-05-31 22:03:11] [INFO ] State equation strengthened by 299 read => feed constraints.
[2024-05-31 22:03:12] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2024-05-31 22:03:13] [INFO ] Redundant transitions in 117 ms returned []
Running 1808 sub problems to find dead transitions.
[2024-05-31 22:03:13] [INFO ] Flow matrix only has 1219 transitions (discarded 591 similar events)
[2024-05-31 22:03:13] [INFO ] Invariant cache hit.
[2024-05-31 22:03:13] [INFO ] State equation strengthened by 299 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/705 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 705/1924 variables, and 2 constraints, problems are : Problem set: 0 solved, 1808 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/705 constraints, ReadFeed: 0/299 constraints, PredecessorRefiner: 1808/1808 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/705 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1808 unsolved
At refinement iteration 3 (OVERLAPS) 1219/1924 variables, 705/707 constraints. Problems are: Problem set: 0 solved, 1808 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1924 variables, 299/1006 constraints. Problems are: Problem set: 0 solved, 1808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1924/1924 variables, and 2814 constraints, problems are : Problem set: 0 solved, 1808 unsolved in 31792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 705/705 constraints, ReadFeed: 299/299 constraints, PredecessorRefiner: 1808/1808 constraints, Known Traps: 0/0 constraints]
After SMT, in 70283ms problems are : Problem set: 0 solved, 1808 unsolved
Search for dead transitions found 0 dead transitions in 70304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72865 ms. Remains : 705/705 places, 1810/1810 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1056 edges and 705 vertex of which 192 / 705 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 463 transitions
Reduce isomorphic transitions removed 783 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 577 transition count 1010
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 560 transition count 1010
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 35 place count 560 transition count 909
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 237 place count 459 transition count 909
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 300 place count 396 transition count 846
Iterating global reduction 2 with 63 rules applied. Total rules applied 363 place count 396 transition count 846
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 489 place count 396 transition count 720
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 751 place count 265 transition count 589
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 814 place count 202 transition count 463
Iterating global reduction 3 with 63 rules applied. Total rules applied 877 place count 202 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 879 place count 202 transition count 461
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 940 place count 141 transition count 339
Iterating global reduction 4 with 61 rules applied. Total rules applied 1001 place count 141 transition count 339
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1061 place count 81 transition count 219
Iterating global reduction 4 with 60 rules applied. Total rules applied 1121 place count 81 transition count 219
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 4 with 59 rules applied. Total rules applied 1180 place count 81 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1182 place count 80 transition count 159
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1202 place count 70 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 1214 place count 70 transition count 152
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1215 place count 70 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1216 place count 69 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1217 place count 69 transition count 150
Applied a total of 1217 rules in 117 ms. Remains 69 /705 variables (removed 636) and now considering 150/1810 (removed 1660) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 150 rows 69 cols
[2024-05-31 22:04:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:04:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 22:04:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 22:04:23] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-31 22:04:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:04:23] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:04:23] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:04:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 22:04:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:04:23] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:04:23] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:04:23] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:04:23] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 420 ms.
[2024-05-31 22:04:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 22:04:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 705 places, 1810 transitions and 7366 arcs took 14 ms.
[2024-05-31 22:04:24] [INFO ] Flatten gal took : 147 ms
Total runtime 107137 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 : FunctionPointer-PT-c016-ReachabilityFireability-2023-02
Could not compute solution for formula : FunctionPointer-PT-c016-ReachabilityFireability-2024-08
BK_STOP 1717193064405
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FunctionPointer-PT-c016-ReachabilityFireability-2023-02
rfs formula type EF
rfs formula formula --invariant=/tmp/571/inv_0_
rfs formula name FunctionPointer-PT-c016-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/571/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="FunctionPointer-PT-c016"
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 FunctionPointer-PT-c016, 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 r496-tall-171640603100303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 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 ;