About the Execution of GreatSPN+red for FunctionPointer-PT-c064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12069.876 | 3600000.00 | 5944406.00 | 9055.00 | TFTTFFFFT?FFFTFF | 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-171640601300316.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-c064, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601300316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:11 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-c064-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716447073232
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 06:51:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 06:51:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 06:51:14] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2024-05-23 06:51:14] [INFO ] Transformed 2826 places.
[2024-05-23 06:51:14] [INFO ] Transformed 8960 transitions.
[2024-05-23 06:51:14] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 564 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 48 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c064-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3740
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3740
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 1 with 384 rules applied. Total rules applied 987 place count 1318 transition count 3356
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1139 place count 1166 transition count 3052
Iterating global reduction 2 with 152 rules applied. Total rules applied 1291 place count 1166 transition count 3052
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1359 place count 1166 transition count 2984
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1373 place count 1152 transition count 2956
Iterating global reduction 3 with 14 rules applied. Total rules applied 1387 place count 1152 transition count 2956
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1401 place count 1138 transition count 2928
Iterating global reduction 3 with 14 rules applied. Total rules applied 1415 place count 1138 transition count 2928
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1429 place count 1124 transition count 2900
Iterating global reduction 3 with 14 rules applied. Total rules applied 1443 place count 1124 transition count 2900
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1457 place count 1110 transition count 2872
Iterating global reduction 3 with 14 rules applied. Total rules applied 1471 place count 1110 transition count 2872
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1485 place count 1096 transition count 2844
Iterating global reduction 3 with 14 rules applied. Total rules applied 1499 place count 1096 transition count 2844
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1511 place count 1084 transition count 2820
Iterating global reduction 3 with 12 rules applied. Total rules applied 1523 place count 1084 transition count 2820
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1535 place count 1072 transition count 2796
Iterating global reduction 3 with 12 rules applied. Total rules applied 1547 place count 1072 transition count 2796
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1592 place count 1027 transition count 2630
Iterating global reduction 3 with 45 rules applied. Total rules applied 1637 place count 1027 transition count 2630
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1693 place count 971 transition count 2406
Iterating global reduction 3 with 56 rules applied. Total rules applied 1749 place count 971 transition count 2406
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1804 place count 916 transition count 2262
Iterating global reduction 3 with 55 rules applied. Total rules applied 1859 place count 916 transition count 2262
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1914 place count 861 transition count 2152
Iterating global reduction 3 with 55 rules applied. Total rules applied 1969 place count 861 transition count 2152
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2024 place count 806 transition count 2042
Iterating global reduction 3 with 55 rules applied. Total rules applied 2079 place count 806 transition count 2042
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2134 place count 751 transition count 1932
Iterating global reduction 3 with 55 rules applied. Total rules applied 2189 place count 751 transition count 1932
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2241 place count 699 transition count 1828
Iterating global reduction 3 with 52 rules applied. Total rules applied 2293 place count 699 transition count 1828
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2310 place count 682 transition count 1794
Iterating global reduction 3 with 17 rules applied. Total rules applied 2327 place count 682 transition count 1794
Applied a total of 2327 rules in 1198 ms. Remains 682 /1628 variables (removed 946) and now considering 1794/5962 (removed 4168) transitions.
[2024-05-23 06:51:16] [INFO ] Flow matrix only has 1200 transitions (discarded 594 similar events)
// Phase 1: matrix 1200 rows 682 cols
[2024-05-23 06:51:16] [INFO ] Computed 2 invariants in 34 ms
[2024-05-23 06:51:17] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-23 06:51:17] [INFO ] Flow matrix only has 1200 transitions (discarded 594 similar events)
[2024-05-23 06:51:17] [INFO ] Invariant cache hit.
[2024-05-23 06:51:17] [INFO ] State equation strengthened by 292 read => feed constraints.
[2024-05-23 06:51:18] [INFO ] Implicit Places using invariants and state equation in 1822 ms returned []
Implicit Place search using SMT with State Equation took 2536 ms to find 0 implicit places.
Running 1792 sub problems to find dead transitions.
[2024-05-23 06:51:19] [INFO ] Flow matrix only has 1200 transitions (discarded 594 similar events)
[2024-05-23 06:51:19] [INFO ] Invariant cache hit.
[2024-05-23 06:51:19] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/1882 variables, and 2 constraints, problems are : Problem set: 0 solved, 1792 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/682 constraints, ReadFeed: 0/292 constraints, PredecessorRefiner: 1792/1792 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 3 (OVERLAPS) 1200/1882 variables, 682/684 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1882 variables, 292/976 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1882/1882 variables, and 2768 constraints, problems are : Problem set: 0 solved, 1792 unsolved in 31853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 682/682 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 1792/1792 constraints, Known Traps: 0/0 constraints]
After SMT, in 70594ms problems are : Problem set: 0 solved, 1792 unsolved
Search for dead transitions found 0 dead transitions in 70628ms
Starting structural reductions in LTL mode, iteration 1 : 682/1628 places, 1794/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74398 ms. Remains : 682/1628 places, 1794/5962 transitions.
Support contains 16 out of 682 places after structural reductions.
[2024-05-23 06:52:29] [INFO ] Flatten gal took : 137 ms
[2024-05-23 06:52:30] [INFO ] Flatten gal took : 111 ms
[2024-05-23 06:52:30] [INFO ] Input system was already deterministic with 1794 transitions.
Support contains 15 out of 682 places (down from 16) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40065 steps (8 resets) in 2620 ms. (15 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
[2024-05-23 06:52:31] [INFO ] Flow matrix only has 1200 transitions (discarded 594 similar events)
[2024-05-23 06:52:31] [INFO ] Invariant cache hit.
[2024-05-23 06:52:31] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/395 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 921/1316 variables, 395/396 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1316 variables, 217/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1316 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 460/1776 variables, 194/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1776 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1776 variables, 75/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1776 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 99/1875 variables, 87/970 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1875 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 7/1882 variables, 6/976 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1882 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/1882 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1882/1882 variables, and 976 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 682/682 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/395 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 921/1316 variables, 395/396 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1316 variables, 217/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1316 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 460/1776 variables, 194/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1776 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1776 variables, 75/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1776 variables, 10/893 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 06:52:34] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1776 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1776 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 99/1875 variables, 87/981 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1875 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 7/1882 variables, 6/987 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1882 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1882/1882 variables, and 987 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 682/682 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 7115ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 678 transition count 1780
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 678 transition count 1780
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 678 transition count 1776
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 674 transition count 1768
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 674 transition count 1768
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 671 transition count 1758
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 671 transition count 1758
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 668 transition count 1746
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 668 transition count 1746
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 665 transition count 1738
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 665 transition count 1738
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 662 transition count 1732
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 662 transition count 1732
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 659 transition count 1726
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 659 transition count 1726
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 656 transition count 1720
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 656 transition count 1720
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 653 transition count 1714
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 653 transition count 1714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 652 transition count 1712
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 652 transition count 1712
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 652 transition count 1700
Applied a total of 76 rules in 451 ms. Remains 652 /682 variables (removed 30) and now considering 1700/1794 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 652/682 places, 1700/1794 transitions.
RANDOM walk for 40049 steps (8 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 170936 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 10
Probabilistic random walk after 170936 steps, saw 110968 distinct states, run finished after 3015 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-23 06:52:42] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
// Phase 1: matrix 1139 rows 652 cols
[2024-05-23 06:52:42] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 06:52:42] [INFO ] State equation strengthened by 281 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/395 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 900/1295 variables, 395/396 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1295 variables, 209/605 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1295 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 413/1708 variables, 178/783 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1708 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1708 variables, 72/856 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1708 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 80/1788 variables, 77/933 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1788 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 3/1791 variables, 2/935 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1791 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/1791 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1791/1791 variables, and 935 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 652/652 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/395 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 900/1295 variables, 395/396 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1295 variables, 209/605 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1295 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 413/1708 variables, 178/783 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1708 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1708 variables, 72/856 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1708 variables, 10/866 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 06:52:45] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1708 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1708 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 80/1788 variables, 77/944 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1788 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 3/1791 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1791 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/1791 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1791/1791 variables, and 946 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5092 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 652/652 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 7017ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 8 properties in 9414 ms.
Support contains 4 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1700/1700 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 647 transition count 1684
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 647 transition count 1684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 647 transition count 1682
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 641 transition count 1670
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 641 transition count 1670
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 641 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 636 transition count 1652
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 636 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 631 transition count 1642
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 631 transition count 1642
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 626 transition count 1630
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 626 transition count 1630
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 621 transition count 1620
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 621 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 617 transition count 1612
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 617 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 614 transition count 1606
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 614 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 611 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 610 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 609 transition count 1596
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 609 transition count 1596
Applied a total of 92 rules in 261 ms. Remains 609 /652 variables (removed 43) and now considering 1596/1700 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 609/652 places, 1596/1700 transitions.
RANDOM walk for 40154 steps (8 resets) in 97 ms. (409 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 304309 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 2
Probabilistic random walk after 304309 steps, saw 197528 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
[2024-05-23 06:53:02] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 06:53:02] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 06:53:02] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 534/538 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 930/1468 variables, 467/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1468 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1468 variables, 266/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1468 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1530 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1530 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 132/1662 variables, 130/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 534/538 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 930/1468 variables, 467/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1468 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1468 variables, 266/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1468 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1468 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1530 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 132/1662 variables, 130/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/1670 variables, 4/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1670 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1676 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1676 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1676 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2005ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 103208 steps, including 238 resets, run visited all 2 properties in 604 ms. (steps per millisecond=170 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 609 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)||G(!p2)) U p3))'
Support contains 6 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 675 transition count 1774
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 675 transition count 1774
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 24 place count 675 transition count 1764
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 668 transition count 1748
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 668 transition count 1748
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 664 transition count 1736
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 664 transition count 1736
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 660 transition count 1722
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 660 transition count 1722
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 656 transition count 1712
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 656 transition count 1712
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 652 transition count 1704
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 652 transition count 1704
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 648 transition count 1696
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 648 transition count 1696
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 645 transition count 1690
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 645 transition count 1690
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 642 transition count 1684
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 642 transition count 1684
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 641 transition count 1682
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 641 transition count 1682
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 102 place count 641 transition count 1672
Applied a total of 102 rules in 479 ms. Remains 641 /682 variables (removed 41) and now considering 1672/1794 (removed 122) transitions.
[2024-05-23 06:53:05] [INFO ] Flow matrix only has 1117 transitions (discarded 555 similar events)
// Phase 1: matrix 1117 rows 641 cols
[2024-05-23 06:53:05] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 06:53:05] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 06:53:05] [INFO ] Flow matrix only has 1117 transitions (discarded 555 similar events)
[2024-05-23 06:53:05] [INFO ] Invariant cache hit.
[2024-05-23 06:53:06] [INFO ] State equation strengthened by 274 read => feed constraints.
[2024-05-23 06:53:07] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2024-05-23 06:53:07] [INFO ] Redundant transitions in 91 ms returned []
Running 1670 sub problems to find dead transitions.
[2024-05-23 06:53:07] [INFO ] Flow matrix only has 1117 transitions (discarded 555 similar events)
[2024-05-23 06:53:07] [INFO ] Invariant cache hit.
[2024-05-23 06:53:07] [INFO ] State equation strengthened by 274 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/1758 variables, and 2 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/641 constraints, ReadFeed: 0/274 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/641 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 3 (OVERLAPS) 1117/1758 variables, 641/643 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1758 variables, 274/917 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1758/1758 variables, and 2587 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 31143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 641/641 constraints, ReadFeed: 274/274 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints]
After SMT, in 69404ms problems are : Problem set: 0 solved, 1670 unsolved
Search for dead transitions found 0 dead transitions in 69421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 641/682 places, 1672/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72021 ms. Remains : 641/682 places, 1672/1794 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p3), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-01
Stuttering criterion allowed to conclude after 51509 steps with 374 reset in 416 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-01 finished in 72774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1760
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 672 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 661 transition count 1728
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 661 transition count 1728
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 661 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 62 place count 653 transition count 1700
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 653 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 645 transition count 1674
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 645 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 637 transition count 1654
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 637 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 110 place count 629 transition count 1636
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 629 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 125 place count 622 transition count 1622
Iterating global reduction 2 with 7 rules applied. Total rules applied 132 place count 622 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 616 transition count 1610
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 616 transition count 1610
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 610 transition count 1598
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 610 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 608 transition count 1594
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 607 transition count 1592
Applied a total of 162 rules in 129 ms. Remains 607 /682 variables (removed 75) and now considering 1592/1794 (removed 202) transitions.
[2024-05-23 06:54:17] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-23 06:54:17] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 06:54:18] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-23 06:54:18] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 06:54:18] [INFO ] Invariant cache hit.
[2024-05-23 06:54:18] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 06:54:19] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 2058 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-23 06:54:19] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 06:54:19] [INFO ] Invariant cache hit.
[2024-05-23 06:54:19] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1670 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
SMT process timed out in 37607ms, After SMT, problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 37623ms
Starting structural reductions in LTL mode, iteration 1 : 607/682 places, 1592/1794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39817 ms. Remains : 607/682 places, 1592/1794 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-06
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-06 finished in 40008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1760
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 672 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 661 transition count 1728
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 661 transition count 1728
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 661 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 62 place count 653 transition count 1700
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 653 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 645 transition count 1674
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 645 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 637 transition count 1654
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 637 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 110 place count 629 transition count 1636
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 629 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 125 place count 622 transition count 1622
Iterating global reduction 2 with 7 rules applied. Total rules applied 132 place count 622 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 616 transition count 1610
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 616 transition count 1610
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 610 transition count 1598
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 610 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 608 transition count 1594
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 607 transition count 1592
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 607 transition count 1590
Applied a total of 164 rules in 298 ms. Remains 607 /682 variables (removed 75) and now considering 1590/1794 (removed 204) transitions.
[2024-05-23 06:54:57] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2024-05-23 06:54:57] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 06:54:58] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-23 06:54:58] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2024-05-23 06:54:58] [INFO ] Invariant cache hit.
[2024-05-23 06:54:58] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 06:54:59] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2024-05-23 06:55:00] [INFO ] Redundant transitions in 83 ms returned []
Running 1588 sub problems to find dead transitions.
[2024-05-23 06:55:00] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2024-05-23 06:55:00] [INFO ] Invariant cache hit.
[2024-05-23 06:55:00] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 3 (OVERLAPS) 1062/1669 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
SMT process timed out in 37319ms, After SMT, problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 37335ms
Starting structural reductions in SI_LTL mode, iteration 1 : 607/682 places, 1590/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39800 ms. Remains : 607/682 places, 1590/1794 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-07
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-07 finished in 39859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 671 transition count 1758
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 671 transition count 1758
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 671 transition count 1748
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 659 transition count 1722
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 659 transition count 1722
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 651 transition count 1694
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 651 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 643 transition count 1668
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 643 transition count 1668
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 635 transition count 1648
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 635 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 116 place count 627 transition count 1630
Iterating global reduction 2 with 8 rules applied. Total rules applied 124 place count 627 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 131 place count 620 transition count 1616
Iterating global reduction 2 with 7 rules applied. Total rules applied 138 place count 620 transition count 1616
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 614 transition count 1604
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 614 transition count 1604
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 608 transition count 1592
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 608 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 606 transition count 1588
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 605 transition count 1584
Applied a total of 170 rules in 301 ms. Remains 605 /682 variables (removed 77) and now considering 1584/1794 (removed 210) transitions.
[2024-05-23 06:55:37] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 06:55:37] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 06:55:38] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-23 06:55:38] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:55:38] [INFO ] Invariant cache hit.
[2024-05-23 06:55:38] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 06:55:39] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
[2024-05-23 06:55:39] [INFO ] Redundant transitions in 36 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 06:55:39] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:55:39] [INFO ] Invariant cache hit.
[2024-05-23 06:55:39] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 3.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
timeout
(s26 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 67100ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 67114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/682 places, 1584/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69372 ms. Remains : 605/682 places, 1584/1794 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-09
Product exploration explored 100000 steps with 717 reset in 563 ms.
Product exploration explored 100000 steps with 759 reset in 604 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40055 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 524105 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 524105 steps, saw 340177 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 06:56:51] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:56:51] [INFO ] Invariant cache hit.
[2024-05-23 06:56:51] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1515 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1515 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1516 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 132/1648 variables, 130/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1515 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1515 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1516 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/1648 variables, 130/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 06:56:52] [INFO ] Deduced a trap composed of 131 places in 92 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1531ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 66162 steps, including 141 resets, run visited all 1 properties in 172 ms. (steps per millisecond=384 )
Parikh walk visited 1 properties in 172 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 82 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 06:56:53] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:56:53] [INFO ] Invariant cache hit.
[2024-05-23 06:56:53] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-23 06:56:53] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:56:53] [INFO ] Invariant cache hit.
[2024-05-23 06:56:53] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 06:56:55] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2024-05-23 06:56:55] [INFO ] Redundant transitions in 23 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 06:56:55] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:56:55] [INFO ] Invariant cache hit.
[2024-05-23 06:56:55] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30749 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68327ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68344ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70251 ms. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40099 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 518958 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 518958 steps, saw 336837 distinct states, run finished after 3003 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-23 06:58:06] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:58:06] [INFO ] Invariant cache hit.
[2024-05-23 06:58:06] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1515 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1515 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1516 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 132/1648 variables, 130/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1515 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1515 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1516 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/1648 variables, 130/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 06:58:07] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1530ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 58009 steps, including 120 resets, run visited all 1 properties in 161 ms. (steps per millisecond=360 )
Parikh walk visited 1 properties in 161 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 746 reset in 520 ms.
Product exploration explored 100000 steps with 756 reset in 541 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 73 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 06:58:09] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:58:09] [INFO ] Invariant cache hit.
[2024-05-23 06:58:10] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-23 06:58:10] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:58:10] [INFO ] Invariant cache hit.
[2024-05-23 06:58:10] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 06:58:11] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
[2024-05-23 06:58:11] [INFO ] Redundant transitions in 23 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 06:58:11] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 06:58:11] [INFO ] Invariant cache hit.
[2024-05-23 06:58:11] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 67640ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 67655ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 69525 ms. Remains : 605/605 places, 1584/1584 transitions.
Treatment of property FunctionPointer-PT-c064-LTLFireability-09 finished in 221884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U p1)))'
Support contains 4 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 673 transition count 1764
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 673 transition count 1764
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 673 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 663 transition count 1736
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 663 transition count 1736
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 663 transition count 1732
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 57 place count 656 transition count 1710
Iterating global reduction 2 with 7 rules applied. Total rules applied 64 place count 656 transition count 1710
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 649 transition count 1686
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 649 transition count 1686
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 642 transition count 1668
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 642 transition count 1668
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 99 place count 635 transition count 1652
Iterating global reduction 2 with 7 rules applied. Total rules applied 106 place count 635 transition count 1652
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 629 transition count 1640
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 629 transition count 1640
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 623 transition count 1628
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 623 transition count 1628
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 617 transition count 1616
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 615 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 614 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 614 transition count 1610
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 614 transition count 1608
Applied a total of 150 rules in 294 ms. Remains 614 /682 variables (removed 68) and now considering 1608/1794 (removed 186) transitions.
[2024-05-23 06:59:19] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
// Phase 1: matrix 1075 rows 614 cols
[2024-05-23 06:59:19] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 06:59:19] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-23 06:59:19] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2024-05-23 06:59:19] [INFO ] Invariant cache hit.
[2024-05-23 06:59:20] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 06:59:21] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
[2024-05-23 06:59:21] [INFO ] Redundant transitions in 31 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 06:59:21] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2024-05-23 06:59:21] [INFO ] Invariant cache hit.
[2024-05-23 06:59:21] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1689 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1689 variables, 267/883 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1689/1689 variables, and 2489 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30696 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68464ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68477ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/682 places, 1608/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70653 ms. Remains : 614/682 places, 1608/1794 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-10
Entered a terminal (fully accepting) state of product in 5121 steps with 35 reset in 40 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-10 finished in 70868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1764
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1764
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 672 transition count 1754
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 661 transition count 1730
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 661 transition count 1730
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 661 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 654 transition count 1702
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 654 transition count 1702
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 647 transition count 1680
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 647 transition count 1680
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 95 place count 640 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 102 place count 640 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 633 transition count 1646
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 633 transition count 1646
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 122 place count 627 transition count 1634
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 627 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 133 place count 622 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 138 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 143 place count 617 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 614 transition count 1604
Applied a total of 158 rules in 310 ms. Remains 614 /682 variables (removed 68) and now considering 1604/1794 (removed 190) transitions.
[2024-05-23 07:00:30] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 07:00:30] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 07:00:30] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-23 07:00:30] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:00:30] [INFO ] Invariant cache hit.
[2024-05-23 07:00:31] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:00:32] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2024-05-23 07:00:32] [INFO ] Redundant transitions in 27 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 07:00:32] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:00:32] [INFO ] Invariant cache hit.
[2024-05-23 07:00:32] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68462ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/682 places, 1604/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70962 ms. Remains : 614/682 places, 1604/1794 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-11
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-11 finished in 71038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1760
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 672 transition count 1750
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 661 transition count 1726
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 661 transition count 1726
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 661 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 654 transition count 1702
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 654 transition count 1702
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 647 transition count 1680
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 647 transition count 1680
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 640 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 640 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 105 place count 633 transition count 1646
Iterating global reduction 2 with 7 rules applied. Total rules applied 112 place count 633 transition count 1646
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 627 transition count 1634
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 627 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 622 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 617 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 614 transition count 1608
Applied a total of 150 rules in 148 ms. Remains 614 /682 variables (removed 68) and now considering 1608/1794 (removed 186) transitions.
[2024-05-23 07:01:41] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 07:01:41] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 07:01:41] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-23 07:01:41] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 07:01:41] [INFO ] Invariant cache hit.
[2024-05-23 07:01:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:01:43] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2117 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 07:01:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 07:01:43] [INFO ] Invariant cache hit.
[2024-05-23 07:01:43] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30920 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68770ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68786ms
Starting structural reductions in LTL mode, iteration 1 : 614/682 places, 1608/1794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71056 ms. Remains : 614/682 places, 1608/1794 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-14
Entered a terminal (fully accepting) state of product in 70233 steps with 552 reset in 387 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-14 finished in 71561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||F(p2))&&p0)))'
Support contains 3 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 671 transition count 1758
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 671 transition count 1758
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 671 transition count 1748
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 659 transition count 1722
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 659 transition count 1722
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 651 transition count 1694
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 651 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 643 transition count 1668
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 643 transition count 1668
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 635 transition count 1648
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 635 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 116 place count 627 transition count 1630
Iterating global reduction 2 with 8 rules applied. Total rules applied 124 place count 627 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 131 place count 620 transition count 1616
Iterating global reduction 2 with 7 rules applied. Total rules applied 138 place count 620 transition count 1616
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 614 transition count 1604
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 614 transition count 1604
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 608 transition count 1592
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 608 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 606 transition count 1588
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 605 transition count 1586
Applied a total of 168 rules in 132 ms. Remains 605 /682 variables (removed 77) and now considering 1586/1794 (removed 208) transitions.
[2024-05-23 07:02:52] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-23 07:02:52] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 07:02:53] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-23 07:02:53] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 07:02:53] [INFO ] Invariant cache hit.
[2024-05-23 07:02:53] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 07:02:54] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 07:02:54] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 07:02:54] [INFO ] Invariant cache hit.
[2024-05-23 07:02:54] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 3.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)timeout
(s80 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1663 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1663 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 2453 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
After SMT, in 68218ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 68232ms
Starting structural reductions in LTL mode, iteration 1 : 605/682 places, 1586/1794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70318 ms. Remains : 605/682 places, 1586/1794 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-15 finished in 70565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-23 07:04:03] [INFO ] Flatten gal took : 60 ms
[2024-05-23 07:04:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 07:04:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 682 places, 1794 transitions and 7302 arcs took 12 ms.
Total runtime 769258 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-c064
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 682
TRANSITIONS: 1794
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.036s, Sys 0.004s]
SAVING FILE /home/mcc/execution/410/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: 946
MODEL NAME: /home/mcc/execution/410/model
682 places, 1794 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.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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-c064"
export BK_EXAMINATION="LTLFireability"
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-c064, examination is LTLFireability"
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-171640601300316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c064.tgz
mv FunctionPointer-PT-c064 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;