Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603000276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-c002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 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-c002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717190396101

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:19:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:19:57] [INFO ] Load time of PNML (sax parser for PT used): 370 ms
[2024-05-31 21:19:57] [INFO ] Transformed 2826 places.
[2024-05-31 21:19:57] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:19:57] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 37 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c002-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 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 296 places :
Symmetric choice reduction at 1 with 296 rule applications. Total rules 313 place count 1315 transition count 3758
Iterating global reduction 1 with 296 rules applied. Total rules applied 609 place count 1315 transition count 3758
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 412 transitions.
Iterating post reduction 1 with 412 rules applied. Total rules applied 1021 place count 1315 transition count 3346
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1173 place count 1163 transition count 3042
Iterating global reduction 2 with 152 rules applied. Total rules applied 1325 place count 1163 transition count 3042
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1413 place count 1163 transition count 2954
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1426 place count 1150 transition count 2928
Iterating global reduction 3 with 13 rules applied. Total rules applied 1439 place count 1150 transition count 2928
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1452 place count 1137 transition count 2902
Iterating global reduction 3 with 13 rules applied. Total rules applied 1465 place count 1137 transition count 2902
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1478 place count 1124 transition count 2876
Iterating global reduction 3 with 13 rules applied. Total rules applied 1491 place count 1124 transition count 2876
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1504 place count 1111 transition count 2850
Iterating global reduction 3 with 13 rules applied. Total rules applied 1517 place count 1111 transition count 2850
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1530 place count 1098 transition count 2824
Iterating global reduction 3 with 13 rules applied. Total rules applied 1543 place count 1098 transition count 2824
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1556 place count 1085 transition count 2798
Iterating global reduction 3 with 13 rules applied. Total rules applied 1569 place count 1085 transition count 2798
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1582 place count 1072 transition count 2772
Iterating global reduction 3 with 13 rules applied. Total rules applied 1595 place count 1072 transition count 2772
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1644 place count 1023 transition count 2590
Iterating global reduction 3 with 49 rules applied. Total rules applied 1693 place count 1023 transition count 2590
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1747 place count 969 transition count 2374
Iterating global reduction 3 with 54 rules applied. Total rules applied 1801 place count 969 transition count 2374
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1855 place count 915 transition count 2242
Iterating global reduction 3 with 54 rules applied. Total rules applied 1909 place count 915 transition count 2242
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1963 place count 861 transition count 2134
Iterating global reduction 3 with 54 rules applied. Total rules applied 2017 place count 861 transition count 2134
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2071 place count 807 transition count 2026
Iterating global reduction 3 with 54 rules applied. Total rules applied 2125 place count 807 transition count 2026
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2179 place count 753 transition count 1918
Iterating global reduction 3 with 54 rules applied. Total rules applied 2233 place count 753 transition count 1918
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2287 place count 699 transition count 1810
Iterating global reduction 3 with 54 rules applied. Total rules applied 2341 place count 699 transition count 1810
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2353 place count 687 transition count 1786
Iterating global reduction 3 with 12 rules applied. Total rules applied 2365 place count 687 transition count 1786
Applied a total of 2365 rules in 1184 ms. Remains 687 /1628 variables (removed 941) and now considering 1786/5962 (removed 4176) transitions.
[2024-05-31 21:19:59] [INFO ] Flow matrix only has 1196 transitions (discarded 590 similar events)
// Phase 1: matrix 1196 rows 687 cols
[2024-05-31 21:19:59] [INFO ] Computed 2 invariants in 34 ms
[2024-05-31 21:19:59] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-31 21:19:59] [INFO ] Flow matrix only has 1196 transitions (discarded 590 similar events)
[2024-05-31 21:19:59] [INFO ] Invariant cache hit.
[2024-05-31 21:20:00] [INFO ] State equation strengthened by 290 read => feed constraints.
[2024-05-31 21:20:01] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2484 ms to find 0 implicit places.
Running 1784 sub problems to find dead transitions.
[2024-05-31 21:20:01] [INFO ] Flow matrix only has 1196 transitions (discarded 590 similar events)
[2024-05-31 21:20:01] [INFO ] Invariant cache hit.
[2024-05-31 21:20:01] [INFO ] State equation strengthened by 290 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/687 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/687 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1784 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 687/1883 variables, and 2 constraints, problems are : Problem set: 0 solved, 1784 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/687 constraints, ReadFeed: 0/290 constraints, PredecessorRefiner: 1784/1784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/687 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/687 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/687 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1784 unsolved
At refinement iteration 3 (OVERLAPS) 1196/1883 variables, 687/689 constraints. Problems are: Problem set: 0 solved, 1784 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1883 variables, 290/979 constraints. Problems are: Problem set: 0 solved, 1784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1883/1883 variables, and 2763 constraints, problems are : Problem set: 0 solved, 1784 unsolved in 31737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 687/687 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 1784/1784 constraints, Known Traps: 0/0 constraints]
After SMT, in 70659ms problems are : Problem set: 0 solved, 1784 unsolved
Search for dead transitions found 0 dead transitions in 70699ms
Starting structural reductions in LTL mode, iteration 1 : 687/1628 places, 1786/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74404 ms. Remains : 687/1628 places, 1786/5962 transitions.
Support contains 13 out of 687 places after structural reductions.
[2024-05-31 21:21:12] [INFO ] Flatten gal took : 156 ms
[2024-05-31 21:21:12] [INFO ] Flatten gal took : 126 ms
[2024-05-31 21:21:13] [INFO ] Input system was already deterministic with 1786 transitions.
Support contains 11 out of 687 places (down from 13) after GAL structural reductions.
RANDOM walk for 40001 steps (8 resets) in 2292 ms. (17 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
[2024-05-31 21:21:14] [INFO ] Flow matrix only has 1196 transitions (discarded 590 similar events)
[2024-05-31 21:21:14] [INFO ] Invariant cache hit.
[2024-05-31 21:21:14] [INFO ] State equation strengthened by 290 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 598/607 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1055/1662 variables, 523/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1662 variables, 290/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1662 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 62/1724 variables, 1/824 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1724 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 158/1882 variables, 154/978 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1882 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1883 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1883 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1883 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1883/1883 variables, and 979 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 687/687 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 598/607 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1055/1662 variables, 523/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1662 variables, 290/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1662 variables, 5/828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1662 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 62/1724 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 21:21:16] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 24 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1724 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1724 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 158/1882 variables, 154/984 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1882 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/1883 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1883 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1883 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1883/1883 variables, and 985 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 687/687 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 4914ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 9 out of 687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 685 transition count 1780
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 685 transition count 1780
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 683 transition count 1774
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 683 transition count 1774
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 681 transition count 1770
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 681 transition count 1770
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 679 transition count 1766
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 679 transition count 1766
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 677 transition count 1762
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 677 transition count 1762
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 675 transition count 1758
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 675 transition count 1758
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 673 transition count 1754
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 673 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 672 transition count 1750
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 672 transition count 1750
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 671 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 671 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 670 transition count 1744
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 670 transition count 1744
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 669 transition count 1742
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 669 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 668 transition count 1740
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 668 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 667 transition count 1738
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 667 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 666 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 666 transition count 1736
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 58 place count 666 transition count 1720
Applied a total of 58 rules in 516 ms. Remains 666 /687 variables (removed 21) and now considering 1720/1786 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 666/687 places, 1720/1786 transitions.
RANDOM walk for 40000 steps (8 resets) in 330 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/5 properties
[2024-05-31 21:21:19] [INFO ] Flow matrix only has 1153 transitions (discarded 567 similar events)
// Phase 1: matrix 1153 rows 666 cols
[2024-05-31 21:21:19] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 21:21:19] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 363/370 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1234/1604 variables, 508/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1604 variables, 283/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1604 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 62/1666 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1666 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1667 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1667 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1667 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 151/1818 variables, 149/950 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1818 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/1819 variables, 1/951 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1819 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1819 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1819/1819 variables, and 951 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 666/666 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 363/370 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1234/1604 variables, 508/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1604 variables, 283/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1604 variables, 4/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1604 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1666 variables, 1/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1666 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1667 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1667 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1667 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 151/1818 variables, 149/954 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:21:22] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1818 variables, 1/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1818 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1819 variables, 1/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1819 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1819 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1819/1819 variables, and 956 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 666/666 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4105ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3575 ms.
Support contains 7 out of 666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 1720/1720 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 665 transition count 1718
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 665 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 664 transition count 1716
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 664 transition count 1716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 663 transition count 1712
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 663 transition count 1712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 662 transition count 1710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 662 transition count 1710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 661 transition count 1708
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 661 transition count 1708
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 660 transition count 1706
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 660 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 659 transition count 1704
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 659 transition count 1704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 658 transition count 1702
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 658 transition count 1702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 657 transition count 1700
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 657 transition count 1700
Applied a total of 18 rules in 285 ms. Remains 657 /666 variables (removed 9) and now considering 1700/1720 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 657/666 places, 1700/1720 transitions.
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 191634 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 4
Probabilistic random walk after 191634 steps, saw 124401 distinct states, run finished after 3014 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-31 21:21:31] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
// Phase 1: matrix 1139 rows 657 cols
[2024-05-31 21:21:31] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 21:21:31] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 360/367 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1220/1587 variables, 503/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1587 variables, 280/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1587 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 62/1649 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1649 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1650 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1650 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1650 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 146/1796 variables, 146/939 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1796 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1796 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1796/1796 variables, and 939 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 657/657 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 360/367 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1220/1587 variables, 503/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1587 variables, 280/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1587 variables, 4/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1587 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1649 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1649 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1650 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1650 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1650 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 146/1796 variables, 146/943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1796 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1796 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1796/1796 variables, and 943 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 657/657 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3035ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 1700/1700 transitions.
Applied a total of 0 rules in 91 ms. Remains 657 /657 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 657/657 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 1700/1700 transitions.
Applied a total of 0 rules in 89 ms. Remains 657 /657 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-31 21:21:34] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
[2024-05-31 21:21:34] [INFO ] Invariant cache hit.
[2024-05-31 21:21:34] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-31 21:21:34] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
[2024-05-31 21:21:34] [INFO ] Invariant cache hit.
[2024-05-31 21:21:35] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-31 21:21:36] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
[2024-05-31 21:21:36] [INFO ] Redundant transitions in 115 ms returned []
Running 1698 sub problems to find dead transitions.
[2024-05-31 21:21:36] [INFO ] Flow matrix only has 1139 transitions (discarded 561 similar events)
[2024-05-31 21:21:36] [INFO ] Invariant cache hit.
[2024-05-31 21:21:36] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/657 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/657 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/1796 variables, and 2 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/657 constraints, ReadFeed: 0/280 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/657 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/657 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/657 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1796 variables, 657/659 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1796 variables, 280/939 constraints. Problems are: Problem set: 0 solved, 1698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1796/1796 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1698 unsolved in 31691 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 657/657 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 1698/1698 constraints, Known Traps: 0/0 constraints]
After SMT, in 69824ms problems are : Problem set: 0 solved, 1698 unsolved
Search for dead transitions found 0 dead transitions in 69840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72279 ms. Remains : 657/657 places, 1700/1700 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 998 edges and 657 vertex of which 192 / 657 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 529 transition count 934
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 516 transition count 934
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 27 place count 516 transition count 847
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 201 place count 429 transition count 847
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 264 place count 366 transition count 784
Iterating global reduction 2 with 63 rules applied. Total rules applied 327 place count 366 transition count 784
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 453 place count 366 transition count 658
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 711 place count 237 transition count 529
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 775 place count 173 transition count 401
Iterating global reduction 3 with 64 rules applied. Total rules applied 839 place count 173 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 841 place count 173 transition count 399
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 904 place count 110 transition count 273
Iterating global reduction 4 with 63 rules applied. Total rules applied 967 place count 110 transition count 273
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1030 place count 47 transition count 147
Iterating global reduction 4 with 63 rules applied. Total rules applied 1093 place count 47 transition count 147
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1156 place count 47 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1156 place count 47 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1158 place count 46 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1160 place count 45 transition count 82
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1170 place count 40 transition count 82
Applied a total of 1170 rules in 90 ms. Remains 40 /657 variables (removed 617) and now considering 82/1700 (removed 1618) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 82 rows 40 cols
[2024-05-31 21:22:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:22:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:22:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 28 ms returned sat
[2024-05-31 21:22:46] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-05-31 21:22:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:22:46] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 21:22:46] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 21:22:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:22:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:22:46] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 21:22:47] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 21:22:47] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 21:22:47] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 567 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' '!(G(F(p0)))'
Support contains 2 out of 687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 679 transition count 1768
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 679 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 671 transition count 1750
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 671 transition count 1750
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 663 transition count 1722
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 663 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 655 transition count 1694
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 655 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 647 transition count 1678
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 647 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 639 transition count 1662
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 639 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 631 transition count 1646
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 631 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 624 transition count 1630
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 624 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 617 transition count 1614
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 612 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 612 transition count 1604
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 612 transition count 1602
Applied a total of 152 rules in 768 ms. Remains 612 /687 variables (removed 75) and now considering 1602/1786 (removed 184) transitions.
[2024-05-31 21:22:47] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2024-05-31 21:22:47] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:22:48] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-31 21:22:48] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-31 21:22:48] [INFO ] Invariant cache hit.
[2024-05-31 21:22:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 21:22:49] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
[2024-05-31 21:22:49] [INFO ] Redundant transitions in 28 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-31 21:22:49] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-31 21:22:49] [INFO ] Invariant cache hit.
[2024-05-31 21:22:49] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1682 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1682/1682 variables, and 2479 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30855 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
After SMT, in 68431ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68446ms
Starting structural reductions in SI_LTL mode, iteration 1 : 612/687 places, 1602/1786 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71199 ms. Remains : 612/687 places, 1602/1786 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 464 ms.
Stack based approach found an accepted trace after 229 steps with 0 reset with depth 230 and stack size 230 in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-02 finished in 71916 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 687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 679 transition count 1768
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 679 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 671 transition count 1750
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 671 transition count 1750
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 663 transition count 1722
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 663 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 655 transition count 1694
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 655 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 647 transition count 1678
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 647 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 639 transition count 1662
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 639 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 631 transition count 1646
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 631 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 624 transition count 1630
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 624 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 617 transition count 1614
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 612 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 612 transition count 1604
Applied a total of 150 rules in 178 ms. Remains 612 /687 variables (removed 75) and now considering 1604/1786 (removed 182) transitions.
[2024-05-31 21:23:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-31 21:23:59] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 21:23:59] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-31 21:23:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 21:23:59] [INFO ] Invariant cache hit.
[2024-05-31 21:23:59] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 21:24:01] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-31 21:24:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 21:24:01] [INFO ] Invariant cache hit.
[2024-05-31 21:24:01] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 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/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68220ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68236ms
Starting structural reductions in LTL mode, iteration 1 : 612/687 places, 1604/1786 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70522 ms. Remains : 612/687 places, 1604/1786 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-08 finished in 70635 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((p1&&X((p1 U (p2||G(p1))))))&&p0)))'
Support contains 5 out of 687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 680 transition count 1768
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 680 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 673 transition count 1750
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 673 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 666 transition count 1728
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 666 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 659 transition count 1706
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 659 transition count 1706
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 652 transition count 1692
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 652 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 645 transition count 1678
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 645 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 638 transition count 1664
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 633 transition count 1652
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 633 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 628 transition count 1640
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 627 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 626 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 625 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 624 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 623 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 623 transition count 1630
Applied a total of 128 rules in 178 ms. Remains 623 /687 variables (removed 64) and now considering 1630/1786 (removed 156) transitions.
[2024-05-31 21:25:09] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-31 21:25:09] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 21:25:10] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-31 21:25:10] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-31 21:25:10] [INFO ] Invariant cache hit.
[2024-05-31 21:25:10] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:25:11] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
Running 1628 sub problems to find dead transitions.
[2024-05-31 21:25:11] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-31 21:25:11] [INFO ] Invariant cache hit.
[2024-05-31 21:25:11] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 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 623/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 3 (OVERLAPS) 1088/1711 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1711 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1711/1711 variables, and 2521 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 31077 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
After SMT, in 68292ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 68310ms
Starting structural reductions in LTL mode, iteration 1 : 623/687 places, 1630/1786 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70350 ms. Remains : 623/687 places, 1630/1786 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-13 finished in 70547 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 3 out of 687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 680 transition count 1768
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 680 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 673 transition count 1750
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 673 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 666 transition count 1728
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 666 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 659 transition count 1706
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 659 transition count 1706
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 652 transition count 1692
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 652 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 645 transition count 1678
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 645 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 638 transition count 1664
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 633 transition count 1652
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 633 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 628 transition count 1640
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 627 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 626 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 625 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 624 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 623 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 623 transition count 1630
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 134 place count 623 transition count 1624
Applied a total of 134 rules in 438 ms. Remains 623 /687 variables (removed 64) and now considering 1624/1786 (removed 162) transitions.
[2024-05-31 21:26:20] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-31 21:26:20] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 21:26:21] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-31 21:26:21] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:26:21] [INFO ] Invariant cache hit.
[2024-05-31 21:26:21] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:26:22] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
[2024-05-31 21:26:22] [INFO ] Redundant transitions in 100 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-31 21:26:22] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:26:22] [INFO ] Invariant cache hit.
[2024-05-31 21:26:22] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 68872ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 68885ms
Starting structural reductions in SI_LTL mode, iteration 1 : 623/687 places, 1624/1786 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71528 ms. Remains : 623/687 places, 1624/1786 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 358 ms.
Product exploration explored 100000 steps with 0 reset in 495 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 86 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)]
RANDOM walk for 40001 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 552565 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 552565 steps, saw 358649 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-05-31 21:27:35] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:27:35] [INFO ] Invariant cache hit.
[2024-05-31 21:27:35] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 137/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1705 variables, 3/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1708 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1708/1708 variables, and 893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 137/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:27:37] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1705 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1705 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1708 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1708 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1708 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 895 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1878ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 73 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 623/623 places, 1624/1624 transitions.
RANDOM walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 555698 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 1
Probabilistic random walk after 555698 steps, saw 360683 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
[2024-05-31 21:27:41] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:27:41] [INFO ] Invariant cache hit.
[2024-05-31 21:27:41] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 137/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1705 variables, 3/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1708 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1708/1708 variables, and 893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 137/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:27:42] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1705 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1705 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1708 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1708 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1708 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 895 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 70 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 70 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-31 21:27:42] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:27:42] [INFO ] Invariant cache hit.
[2024-05-31 21:27:43] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-31 21:27:43] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:27:43] [INFO ] Invariant cache hit.
[2024-05-31 21:27:43] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:27:44] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2024-05-31 21:27:44] [INFO ] Redundant transitions in 27 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-31 21:27:44] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:27:44] [INFO ] Invariant cache hit.
[2024-05-31 21:27:45] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31445 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 68645ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 68660ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70729 ms. Remains : 623/623 places, 1624/1624 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1127 place count 27 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 73 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-31 21:28:53] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:28:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:28:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:28:53] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:28:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:28:53] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:28:53] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:28:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:28:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:28:53] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:28:53] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:28:53] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:28:53] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 164 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 89 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-31 21:28:54] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-31 21:28:54] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 21:28:54] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-31 21:28:54] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:28:54] [INFO ] Invariant cache hit.
[2024-05-31 21:28:54] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:28:56] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2024-05-31 21:28:56] [INFO ] Redundant transitions in 25 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-31 21:28:56] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:28:56] [INFO ] Invariant cache hit.
[2024-05-31 21:28:56] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 68699ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 68716ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70874 ms. Remains : 623/623 places, 1624/1624 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 63 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 31 ms :[(NOT p0)]
RANDOM walk for 40001 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540809 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540809 steps, saw 351019 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-31 21:30:08] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:30:08] [INFO ] Invariant cache hit.
[2024-05-31 21:30:08] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 137/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1705 variables, 3/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1708 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1708/1708 variables, and 893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 137/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:30:09] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1705 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1705 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1708 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1708 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1708 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 895 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1767ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 80 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 623/623 places, 1624/1624 transitions.
RANDOM walk for 40002 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 552138 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 552138 steps, saw 358370 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-31 21:30:12] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:30:12] [INFO ] Invariant cache hit.
[2024-05-31 21:30:13] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 137/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1705 variables, 3/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1708 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1708/1708 variables, and 893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 137/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:30:14] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1705 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1705 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1708 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1708 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1708 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 895 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 68 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 69 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-31 21:30:14] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:30:14] [INFO ] Invariant cache hit.
[2024-05-31 21:30:15] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-31 21:30:15] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:30:15] [INFO ] Invariant cache hit.
[2024-05-31 21:30:15] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:30:17] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2024-05-31 21:30:17] [INFO ] Redundant transitions in 33 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-31 21:30:17] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:30:17] [INFO ] Invariant cache hit.
[2024-05-31 21:30:17] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 68727ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 68748ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70892 ms. Remains : 623/623 places, 1624/1624 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1127 place count 27 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 29 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-31 21:31:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:31:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:31:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-31 21:31:25] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:31:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:31:25] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:31:25] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:31:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:31:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:31:25] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:31:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:25] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 132 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 326 ms.
Product exploration explored 100000 steps with 0 reset in 416 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 72 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-31 21:31:26] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-31 21:31:26] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 21:31:27] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-31 21:31:27] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:31:27] [INFO ] Invariant cache hit.
[2024-05-31 21:31:27] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:31:29] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
[2024-05-31 21:31:29] [INFO ] Redundant transitions in 32 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-31 21:31:29] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:31:29] [INFO ] Invariant cache hit.
[2024-05-31 21:31:29] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31439 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 68458ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 68475ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70709 ms. Remains : 623/623 places, 1624/1624 transitions.
Treatment of property FunctionPointer-PT-c002-LTLFireability-14 finished in 377462 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 3 out of 687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 687/687 places, 1786/1786 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 680 transition count 1768
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 680 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 673 transition count 1750
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 673 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 666 transition count 1728
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 666 transition count 1728
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 659 transition count 1706
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 659 transition count 1706
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 652 transition count 1692
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 652 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 645 transition count 1678
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 645 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 638 transition count 1664
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 638 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 633 transition count 1652
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 633 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 628 transition count 1640
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 627 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 626 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 625 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 624 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 623 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 623 transition count 1630
Applied a total of 128 rules in 169 ms. Remains 623 /687 variables (removed 64) and now considering 1630/1786 (removed 156) transitions.
[2024-05-31 21:32:37] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-31 21:32:37] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 21:32:38] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-31 21:32:38] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-31 21:32:38] [INFO ] Invariant cache hit.
[2024-05-31 21:32:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:32:39] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2018 ms to find 0 implicit places.
Running 1628 sub problems to find dead transitions.
[2024-05-31 21:32:39] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-31 21:32:39] [INFO ] Invariant cache hit.
[2024-05-31 21:32:39] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 3 (OVERLAPS) 1088/1711 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1711 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1711/1711 variables, and 2521 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 31396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
After SMT, in 69197ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 69215ms
Starting structural reductions in LTL mode, iteration 1 : 623/687 places, 1630/1786 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71410 ms. Remains : 623/687 places, 1630/1786 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 492 ms.
Product exploration explored 100000 steps with 33333 reset in 458 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLFireability-15 finished in 72530 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-31 21:33:50] [INFO ] Flatten gal took : 67 ms
[2024-05-31 21:33:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 21:33:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 687 places, 1786 transitions and 7270 arcs took 13 ms.
Total runtime 833294 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-c002-LTLFireability-14

BK_STOP 1717191284866

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-c002-LTLFireability-14
ltl formula formula --ltl=/tmp/925/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 687 places, 1786 transitions and 7270 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.050 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/925/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/925/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/925/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/925/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 688 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 688, there are 1794 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1174 levels ~10000 states ~65288 transitions
pnml2lts-mc( 1/ 4): ~2320 levels ~20000 states ~130100 transitions
pnml2lts-mc( 1/ 4): ~4616 levels ~40000 states ~259844 transitions
pnml2lts-mc( 1/ 4): ~9214 levels ~80000 states ~519356 transitions
pnml2lts-mc( 1/ 4): ~18401 levels ~160000 states ~1038236 transitions
pnml2lts-mc( 1/ 4): ~36779 levels ~320000 states ~2076068 transitions
pnml2lts-mc( 2/ 4): ~160000 levels ~640000 states ~6911588 transitions
pnml2lts-mc( 2/ 4): ~320000 levels ~1280000 states ~13823588 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1372524
pnml2lts-mc( 0/ 4): unique transitions count: 13642511
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 978325
pnml2lts-mc( 0/ 4): - claim success count: 1372529
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1186408
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1372529 states 13642542 transitions, fanout: 9.940
pnml2lts-mc( 0/ 4): Total exploration time 53.410 sec (53.330 sec minimum, 53.368 sec on average)
pnml2lts-mc( 0/ 4): States per second: 25698, Transitions per second: 255430
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 97.0MB, 23.5 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1816 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 97.0MB (~256.0MB paged-in)

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-c002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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