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-171640603100294.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-c008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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-c008-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2023-03
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717191684033

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:41:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:41:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:41:25] [INFO ] Load time of PNML (sax parser for PT used): 376 ms
[2024-05-31 21:41:25] [INFO ] Transformed 2826 places.
[2024-05-31 21:41:25] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:41:25] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 531 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 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-c008-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40002 steps (8 resets) in 3234 ms. (12 steps per ms) remains 8/9 properties
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 7/8 properties
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 537 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
[2024-05-31 21:41:27] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:41:27] [INFO ] Computed 4 invariants in 83 ms
[2024-05-31 21:41:27] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 533/580 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/581 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1479/2060 variables, 581/585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2060 variables, 405/990 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2060 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1347/3407 variables, 435/1425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3407 variables, 74/1499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3407 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1094/4501 variables, 417/1916 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4501 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 557/5058 variables, 149/2065 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5058 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 110/5168 variables, 46/2111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3678 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: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 533/580 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/581 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1479/2060 variables, 581/585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2060 variables, 405/990 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:41:32] [INFO ] Deduced a trap composed of 178 places in 422 ms of which 36 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2060 variables, 1/991 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2060 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1347/3407 variables, 435/1426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3407 variables, 74/1500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3407 variables, 7/1507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3407 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1094/4501 variables, 417/1924 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4501 variables, 0/1924 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 557/5058 variables, 149/2073 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5058 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 110/5168 variables, 46/2119 constraints. Problems are: Problem set: 0 solved, 7 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, 7 unsolved in 5009 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: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 8961ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 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 1431 are kept as prefixes of interest. Removing 197 places using SCC suffix rule.14 ms
Discarding 197 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 363 transitions
Reduce isomorphic transitions removed 363 transitions.
Iterating post reduction 0 with 363 rules applied. Total rules applied 364 place count 1431 transition count 5599
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 657 place count 1138 transition count 3327
Iterating global reduction 1 with 293 rules applied. Total rules applied 950 place count 1138 transition count 3327
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 1296 place count 1138 transition count 2981
Discarding 146 places :
Symmetric choice reduction at 2 with 146 rule applications. Total rules 1442 place count 992 transition count 2689
Iterating global reduction 2 with 146 rules applied. Total rules applied 1588 place count 992 transition count 2689
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 1644 place count 992 transition count 2633
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1657 place count 979 transition count 2607
Iterating global reduction 3 with 13 rules applied. Total rules applied 1670 place count 979 transition count 2607
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1681 place count 968 transition count 2585
Iterating global reduction 3 with 11 rules applied. Total rules applied 1692 place count 968 transition count 2585
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1703 place count 957 transition count 2563
Iterating global reduction 3 with 11 rules applied. Total rules applied 1714 place count 957 transition count 2563
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1725 place count 946 transition count 2541
Iterating global reduction 3 with 11 rules applied. Total rules applied 1736 place count 946 transition count 2541
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1747 place count 935 transition count 2519
Iterating global reduction 3 with 11 rules applied. Total rules applied 1758 place count 935 transition count 2519
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1767 place count 926 transition count 2501
Iterating global reduction 3 with 9 rules applied. Total rules applied 1776 place count 926 transition count 2501
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1785 place count 917 transition count 2483
Iterating global reduction 3 with 9 rules applied. Total rules applied 1794 place count 917 transition count 2483
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1823 place count 888 transition count 2377
Iterating global reduction 3 with 29 rules applied. Total rules applied 1852 place count 888 transition count 2377
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1894 place count 846 transition count 2209
Iterating global reduction 3 with 42 rules applied. Total rules applied 1936 place count 846 transition count 2209
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1976 place count 806 transition count 2095
Iterating global reduction 3 with 40 rules applied. Total rules applied 2016 place count 806 transition count 2095
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2054 place count 768 transition count 2019
Iterating global reduction 3 with 38 rules applied. Total rules applied 2092 place count 768 transition count 2019
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 2128 place count 732 transition count 1947
Iterating global reduction 3 with 36 rules applied. Total rules applied 2164 place count 732 transition count 1947
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 2200 place count 696 transition count 1875
Iterating global reduction 3 with 36 rules applied. Total rules applied 2236 place count 696 transition count 1875
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 2269 place count 663 transition count 1809
Iterating global reduction 3 with 33 rules applied. Total rules applied 2302 place count 663 transition count 1809
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2318 place count 647 transition count 1777
Iterating global reduction 3 with 16 rules applied. Total rules applied 2334 place count 647 transition count 1777
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 3 with 46 rules applied. Total rules applied 2380 place count 647 transition count 1731
Applied a total of 2380 rules in 1512 ms. Remains 647 /1628 variables (removed 981) and now considering 1731/5962 (removed 4231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1522 ms. Remains : 647/1628 places, 1731/5962 transitions.
RANDOM walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 5/7 properties
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2023-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 4/5 properties
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-31 21:41:38] [INFO ] Flow matrix only has 1067 transitions (discarded 664 similar events)
// Phase 1: matrix 1067 rows 647 cols
[2024-05-31 21:41:38] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 21:41:38] [INFO ] State equation strengthened by 173 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 377/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 49/463 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 834/1297 variables, 463/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1297 variables, 32/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1297 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 250/1547 variables, 84/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1547 variables, 137/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 143/1690 variables, 86/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1690 variables, 3/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1690 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 18/1708 variables, 10/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1708 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/1713 variables, 3/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1713 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/1714 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1714 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1714 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1714/1714 variables, and 822 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 647/647 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 377/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 49/463 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 834/1297 variables, 463/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1297 variables, 32/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1297 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 250/1547 variables, 84/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1547 variables, 137/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 4/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 143/1690 variables, 86/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1690 variables, 3/811 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1690 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 18/1708 variables, 10/821 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1708 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 5/1713 variables, 3/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1713 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/1714 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1714 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1714 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1714/1714 variables, and 826 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 647/647 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2843ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2336 ms.
Support contains 37 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1731/1731 transitions.
Graph (complete) has 2915 edges and 647 vertex of which 644 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 644 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 636 transition count 1710
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 636 transition count 1710
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 26 place count 636 transition count 1706
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 630 transition count 1690
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 630 transition count 1690
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 42 place count 630 transition count 1686
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 46 place count 626 transition count 1678
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 626 transition count 1678
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 54 place count 622 transition count 1670
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 622 transition count 1670
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 61 place count 619 transition count 1664
Iterating global reduction 3 with 3 rules applied. Total rules applied 64 place count 619 transition count 1664
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 616 transition count 1658
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 616 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 614 transition count 1654
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 614 transition count 1654
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 609 transition count 1636
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 609 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 605 transition count 1628
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 605 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 601 transition count 1620
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 601 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 597 transition count 1612
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 597 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 593 transition count 1604
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 593 transition count 1604
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 589 transition count 1596
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 589 transition count 1596
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 585 transition count 1588
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 585 transition count 1588
Applied a total of 132 rules in 272 ms. Remains 585 /647 variables (removed 62) and now considering 1588/1731 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 585/647 places, 1588/1731 transitions.
RANDOM walk for 40010 steps (8 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 198701 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 4
Probabilistic random walk after 198701 steps, saw 121858 distinct states, run finished after 3005 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-31 21:41:46] [INFO ] Flow matrix only has 965 transitions (discarded 623 similar events)
// Phase 1: matrix 965 rows 585 cols
[2024-05-31 21:41:46] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 21:41:46] [INFO ] State equation strengthened by 149 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 377/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/450 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 802/1252 variables, 450/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 26/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 198/1450 variables, 71/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 121/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 92/1542 variables, 59/729 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1542 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1542 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 7/1549 variables, 4/735 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1549 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/1550 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1550 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1550 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1550/1550 variables, and 736 constraints, problems are : Problem set: 0 solved, 4 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 585/585 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 377/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/450 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 802/1252 variables, 450/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 26/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 198/1450 variables, 71/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1450 variables, 121/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 4/674 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 92/1542 variables, 59/733 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1542 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1542 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1549 variables, 4/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1549 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1550 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1550 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1550 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1550/1550 variables, and 740 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1328 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 585/585 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2281ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1424 ms.
Support contains 37 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 1588/1588 transitions.
Applied a total of 0 rules in 73 ms. Remains 585 /585 variables (removed 0) and now considering 1588/1588 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 585/585 places, 1588/1588 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 1588/1588 transitions.
Applied a total of 0 rules in 69 ms. Remains 585 /585 variables (removed 0) and now considering 1588/1588 (removed 0) transitions.
[2024-05-31 21:41:50] [INFO ] Flow matrix only has 965 transitions (discarded 623 similar events)
[2024-05-31 21:41:50] [INFO ] Invariant cache hit.
[2024-05-31 21:41:51] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-31 21:41:51] [INFO ] Flow matrix only has 965 transitions (discarded 623 similar events)
[2024-05-31 21:41:51] [INFO ] Invariant cache hit.
[2024-05-31 21:41:51] [INFO ] State equation strengthened by 149 read => feed constraints.
[2024-05-31 21:41:52] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
[2024-05-31 21:41:53] [INFO ] Redundant transitions in 83 ms returned []
Running 1586 sub problems to find dead transitions.
[2024-05-31 21:41:53] [INFO ] Flow matrix only has 965 transitions (discarded 623 similar events)
[2024-05-31 21:41:53] [INFO ] Invariant cache hit.
[2024-05-31 21:41:53] [INFO ] State equation strengthened by 149 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/585 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/1550 variables, and 2 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/585 constraints, ReadFeed: 0/149 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/585 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 3 (OVERLAPS) 965/1550 variables, 585/587 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1550 variables, 149/736 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/1550 variables, and 2322 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30944 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 585/585 constraints, ReadFeed: 149/149 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints]
After SMT, in 67286ms problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 67303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69672 ms. Remains : 585/585 places, 1588/1588 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 623 transitions
Reduce isomorphic transitions removed 623 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 648 rules applied. Total rules applied 648 place count 585 transition count 940
Reduce places removed 25 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 28 rules applied. Total rules applied 676 place count 560 transition count 937
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 679 place count 557 transition count 937
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 679 place count 557 transition count 820
Deduced a syphon composed of 117 places in 1 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 913 place count 440 transition count 820
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 1167 place count 313 transition count 693
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1228 place count 252 transition count 571
Iterating global reduction 3 with 61 rules applied. Total rules applied 1289 place count 252 transition count 571
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1293 place count 252 transition count 567
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1353 place count 192 transition count 447
Iterating global reduction 4 with 60 rules applied. Total rules applied 1413 place count 192 transition count 447
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 1472 place count 133 transition count 329
Iterating global reduction 4 with 59 rules applied. Total rules applied 1531 place count 133 transition count 329
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 1583 place count 133 transition count 277
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 1585 place count 132 transition count 276
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1603 place count 123 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 1634 place count 123 transition count 273
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1635 place count 122 transition count 272
Iterating global reduction 5 with 1 rules applied. Total rules applied 1636 place count 122 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1645 place count 122 transition count 263
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1646 place count 122 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1647 place count 121 transition count 262
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1649 place count 121 transition count 262
Applied a total of 1649 rules in 103 ms. Remains 121 /585 variables (removed 464) and now considering 262/1588 (removed 1326) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 262 rows 121 cols
[2024-05-31 21:43:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:43:00] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 21:43:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:43:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:43:00] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 21:43:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:43:00] [INFO ] After 47ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 21:43:00] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 21:43:00] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 640 ms.
[2024-05-31 21:43:00] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 21:43:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 585 places, 1588 transitions and 6480 arcs took 13 ms.
[2024-05-31 21:43:01] [INFO ] Flatten gal took : 137 ms
Total runtime 96139 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-c008-ReachabilityCardinality-2024-02
Could not compute solution for formula : FunctionPointer-PT-c008-ReachabilityCardinality-2024-04
Could not compute solution for formula : FunctionPointer-PT-c008-ReachabilityCardinality-2024-06
Could not compute solution for formula : FunctionPointer-PT-c008-ReachabilityCardinality-2024-08

BK_STOP 1717191781628

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
rfs formula name FunctionPointer-PT-c008-ReachabilityCardinality-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/547/inv_0_
rfs formula name FunctionPointer-PT-c008-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/547/inv_1_
rfs formula name FunctionPointer-PT-c008-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/547/inv_2_
rfs formula name FunctionPointer-PT-c008-ReachabilityCardinality-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/547/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c008"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c008, 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 r496-tall-171640603100294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;