About the Execution of GreatSPN+red for FunctionPointer-PT-c128
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
12458.995 | 2129904.00 | 3747038.00 | 4566.70 | ?FFFF?F?T??F?TTT | 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.r179-tall-171640601300326.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FunctionPointer-PT-c128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601300326
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 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-c128-ReachabilityCardinality-2023-00
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2023-05
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2023-10
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716450080042
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 07:41:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 07:41:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:41:21] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2024-05-23 07:41:21] [INFO ] Transformed 2826 places.
[2024-05-23 07:41:21] [INFO ] Transformed 8960 transitions.
[2024-05-23 07:41:21] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 37 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40068 steps (8 resets) in 2248 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (13 resets) in 269 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (22 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (16 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (19 resets) in 383 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 8/9 properties
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (15 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
[2024-05-23 07:41:22] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 07:41:23] [INFO ] Computed 4 invariants in 90 ms
[2024-05-23 07:41:23] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 519/596 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/598 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/599 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1577/2176 variables, 599/603 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2176 variables, 410/1013 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2176 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1967/4143 variables, 515/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4143 variables, 69/1597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4143 variables, 0/1597 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 634/4777 variables, 424/2021 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4777 variables, 0/2021 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 306/5083 variables, 61/2082 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5083 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 85/5168 variables, 29/2111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4594 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: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 519/596 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/598 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/599 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1577/2176 variables, 599/603 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2176 variables, 410/1013 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2176 variables, 1/1014 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2176 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1967/4143 variables, 515/1529 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4143 variables, 69/1598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4143 variables, 7/1605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4143 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 634/4777 variables, 424/2029 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4777 variables, 0/2029 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 306/5083 variables, 61/2090 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5083 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 85/5168 variables, 29/2119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5168/5168 variables, and 2119 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5017 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: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 9999ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 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 1457 are kept as prefixes of interest. Removing 171 places using SCC suffix rule.13 ms
Discarding 171 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 321 transitions
Reduce isomorphic transitions removed 321 transitions.
Iterating post reduction 0 with 321 rules applied. Total rules applied 322 place count 1457 transition count 5641
Discarding 279 places :
Symmetric choice reduction at 1 with 279 rule applications. Total rules 601 place count 1178 transition count 3497
Iterating global reduction 1 with 279 rules applied. Total rules applied 880 place count 1178 transition count 3497
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Iterating post reduction 1 with 404 rules applied. Total rules applied 1284 place count 1178 transition count 3093
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 1426 place count 1036 transition count 2809
Iterating global reduction 2 with 142 rules applied. Total rules applied 1568 place count 1036 transition count 2809
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 1652 place count 1036 transition count 2725
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1662 place count 1026 transition count 2705
Iterating global reduction 3 with 10 rules applied. Total rules applied 1672 place count 1026 transition count 2705
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1682 place count 1016 transition count 2685
Iterating global reduction 3 with 10 rules applied. Total rules applied 1692 place count 1016 transition count 2685
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1701 place count 1007 transition count 2667
Iterating global reduction 3 with 9 rules applied. Total rules applied 1710 place count 1007 transition count 2667
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1718 place count 999 transition count 2651
Iterating global reduction 3 with 8 rules applied. Total rules applied 1726 place count 999 transition count 2651
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1734 place count 991 transition count 2635
Iterating global reduction 3 with 8 rules applied. Total rules applied 1742 place count 991 transition count 2635
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1748 place count 985 transition count 2623
Iterating global reduction 3 with 6 rules applied. Total rules applied 1754 place count 985 transition count 2623
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1759 place count 980 transition count 2613
Iterating global reduction 3 with 5 rules applied. Total rules applied 1764 place count 980 transition count 2613
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1780 place count 964 transition count 2555
Iterating global reduction 3 with 16 rules applied. Total rules applied 1796 place count 964 transition count 2555
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1821 place count 939 transition count 2455
Iterating global reduction 3 with 25 rules applied. Total rules applied 1846 place count 939 transition count 2455
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1871 place count 914 transition count 2379
Iterating global reduction 3 with 25 rules applied. Total rules applied 1896 place count 914 transition count 2379
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1918 place count 892 transition count 2335
Iterating global reduction 3 with 22 rules applied. Total rules applied 1940 place count 892 transition count 2335
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1959 place count 873 transition count 2297
Iterating global reduction 3 with 19 rules applied. Total rules applied 1978 place count 873 transition count 2297
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1997 place count 854 transition count 2259
Iterating global reduction 3 with 19 rules applied. Total rules applied 2016 place count 854 transition count 2259
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2034 place count 836 transition count 2223
Iterating global reduction 3 with 18 rules applied. Total rules applied 2052 place count 836 transition count 2223
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2063 place count 825 transition count 2201
Iterating global reduction 3 with 11 rules applied. Total rules applied 2074 place count 825 transition count 2201
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 2152 place count 825 transition count 2123
Applied a total of 2152 rules in 1372 ms. Remains 825 /1628 variables (removed 803) and now considering 2123/5962 (removed 3839) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1387 ms. Remains : 825/1628 places, 2123/5962 transitions.
RANDOM walk for 40005 steps (8 resets) in 370 ms. (107 steps per ms) remains 6/8 properties
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
[2024-05-23 07:41:34] [INFO ] Flow matrix only has 1355 transitions (discarded 768 similar events)
// Phase 1: matrix 1355 rows 825 cols
[2024-05-23 07:41:34] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 07:41:34] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 370/437 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 87/524 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 978/1502 variables, 524/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1502 variables, 55/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1502 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 445/1947 variables, 156/737 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1947 variables, 191/928 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1947 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 225/2172 variables, 139/1067 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2172 variables, 2/1069 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2172 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 7/2179 variables, 5/1074 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2179 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/2180 variables, 1/1075 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2180 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/2180 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2180/2180 variables, and 1075 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 825/825 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 370/437 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 87/524 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 978/1502 variables, 524/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1502 variables, 55/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1502 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 445/1947 variables, 156/737 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1947 variables, 191/928 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1947 variables, 6/934 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1947 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 225/2172 variables, 139/1073 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2172 variables, 2/1075 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2172 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 7/2179 variables, 5/1080 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2179 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/2180 variables, 1/1081 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2180 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/2180 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2180/2180 variables, and 1081 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2460 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 825/825 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 4210ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39941 ms.
Support contains 67 out of 825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 825/825 places, 2123/2123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 822 transition count 2115
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 822 transition count 2115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 822 transition count 2111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 820 transition count 2107
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 820 transition count 2107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 818 transition count 2103
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 818 transition count 2103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 813 transition count 2085
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 813 transition count 2085
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 808 transition count 2075
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 808 transition count 2075
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 804 transition count 2067
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 804 transition count 2067
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 800 transition count 2059
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 800 transition count 2059
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 797 transition count 2053
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 797 transition count 2053
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 794 transition count 2047
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 794 transition count 2047
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 792 transition count 2043
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 792 transition count 2043
Applied a total of 70 rules in 313 ms. Remains 792 /825 variables (removed 33) and now considering 2043/2123 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 792/825 places, 2043/2123 transitions.
RANDOM walk for 40033 steps (8 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 187172 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 6
Probabilistic random walk after 187172 steps, saw 114789 distinct states, run finished after 3008 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-23 07:42:22] [INFO ] Flow matrix only has 1301 transitions (discarded 742 similar events)
// Phase 1: matrix 1301 rows 792 cols
[2024-05-23 07:42:22] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 07:42:22] [INFO ] State equation strengthened by 238 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 370/437 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 79/516 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 958/1474 variables, 516/518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1474 variables, 51/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1474 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 416/1890 variables, 147/716 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1890 variables, 185/901 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1890 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 196/2086 variables, 124/1025 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2086 variables, 2/1027 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2086 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 6/2092 variables, 4/1031 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2092 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/2093 variables, 1/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2093 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/2093 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2093/2093 variables, and 1032 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 792/792 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 370/437 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 79/516 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 958/1474 variables, 516/518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1474 variables, 51/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1474 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 416/1890 variables, 147/716 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1890 variables, 185/901 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1890 variables, 6/907 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1890 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 196/2086 variables, 124/1031 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2086 variables, 2/1033 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2086 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/2092 variables, 4/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2092 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/2093 variables, 1/1038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2093 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/2093 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2093/2093 variables, and 1038 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 792/792 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3911ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 44328 ms.
Support contains 67 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2043/2043 transitions.
Applied a total of 0 rules in 127 ms. Remains 792 /792 variables (removed 0) and now considering 2043/2043 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 792/792 places, 2043/2043 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2043/2043 transitions.
Applied a total of 0 rules in 137 ms. Remains 792 /792 variables (removed 0) and now considering 2043/2043 (removed 0) transitions.
[2024-05-23 07:43:10] [INFO ] Flow matrix only has 1301 transitions (discarded 742 similar events)
[2024-05-23 07:43:10] [INFO ] Invariant cache hit.
[2024-05-23 07:43:11] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-23 07:43:11] [INFO ] Flow matrix only has 1301 transitions (discarded 742 similar events)
[2024-05-23 07:43:11] [INFO ] Invariant cache hit.
[2024-05-23 07:43:11] [INFO ] State equation strengthened by 238 read => feed constraints.
[2024-05-23 07:43:14] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 3035 ms to find 0 implicit places.
[2024-05-23 07:43:14] [INFO ] Redundant transitions in 101 ms returned []
Running 2041 sub problems to find dead transitions.
[2024-05-23 07:43:14] [INFO ] Flow matrix only has 1301 transitions (discarded 742 similar events)
[2024-05-23 07:43:14] [INFO ] Invariant cache hit.
[2024-05-23 07:43:14] [INFO ] State equation strengthened by 238 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/790 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/2093 variables, and 2 constraints, problems are : Problem set: 0 solved, 2041 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/792 constraints, ReadFeed: 0/238 constraints, PredecessorRefiner: 2041/2041 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/790 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 3 (OVERLAPS) 1301/2091 variables, 790/792 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2091 variables, 238/1030 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2091/2093 variables, and 1286 constraints, problems are : Problem set: 0 solved, 2041 unsolved in 30241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 790/792 constraints, ReadFeed: 238/238 constraints, PredecessorRefiner: 256/2041 constraints, Known Traps: 0/0 constraints]
After SMT, in 69530ms problems are : Problem set: 0 solved, 2041 unsolved
Search for dead transitions found 0 dead transitions in 69549ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72843 ms. Remains : 792/792 places, 2043/2043 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 742 transitions
Reduce isomorphic transitions removed 742 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 790 rules applied. Total rules applied 790 place count 792 transition count 1253
Reduce places removed 48 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 842 place count 744 transition count 1249
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 846 place count 740 transition count 1249
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 846 place count 740 transition count 1067
Deduced a syphon composed of 182 places in 1 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1210 place count 558 transition count 1067
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 1480 place count 423 transition count 932
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1539 place count 364 transition count 814
Iterating global reduction 3 with 59 rules applied. Total rules applied 1598 place count 364 transition count 814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1599 place count 364 transition count 813
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 1654 place count 309 transition count 703
Iterating global reduction 4 with 55 rules applied. Total rules applied 1709 place count 309 transition count 703
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 1760 place count 258 transition count 601
Iterating global reduction 4 with 51 rules applied. Total rules applied 1811 place count 258 transition count 601
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 1857 place count 258 transition count 555
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 1859 place count 257 transition count 554
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1913 place count 230 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 1939 place count 230 transition count 533
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1940 place count 229 transition count 532
Iterating global reduction 5 with 1 rules applied. Total rules applied 1941 place count 229 transition count 532
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1943 place count 229 transition count 530
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 1956 place count 229 transition count 517
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1972 place count 216 transition count 514
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1973 place count 216 transition count 513
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1976 place count 216 transition count 513
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1977 place count 216 transition count 512
Applied a total of 1977 rules in 236 ms. Remains 216 /792 variables (removed 576) and now considering 512/2043 (removed 1531) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 512 rows 216 cols
[2024-05-23 07:44:23] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 07:44:24] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 07:44:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 07:44:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 07:44:24] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 07:44:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:44:24] [INFO ] After 110ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 07:44:24] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 07:44:24] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 1272 ms.
[2024-05-23 07:44:24] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-23 07:44:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 792 places, 2043 transitions and 8312 arcs took 15 ms.
[2024-05-23 07:44:25] [INFO ] Flatten gal took : 163 ms
Total runtime 184234 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-c128
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 792
TRANSITIONS: 2043
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.044s, Sys 0.007s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 593
MODEL NAME: /home/mcc/execution/414/model
792 places, 2043 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716452209946
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c128"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-c128, 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 r179-tall-171640601300326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 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 ;