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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717191402149

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:36:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:36:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:36:43] [INFO ] Load time of PNML (sax parser for PT used): 418 ms
[2024-05-31 21:36:43] [INFO ] Transformed 2826 places.
[2024-05-31 21:36:43] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:36:43] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 595 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c008-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3714
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3714
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Iterating post reduction 1 with 364 rules applied. Total rules applied 967 place count 1318 transition count 3350
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1119 place count 1166 transition count 3046
Iterating global reduction 2 with 152 rules applied. Total rules applied 1271 place count 1166 transition count 3046
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1339 place count 1166 transition count 2978
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1351 place count 1154 transition count 2954
Iterating global reduction 3 with 12 rules applied. Total rules applied 1363 place count 1154 transition count 2954
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1373 place count 1144 transition count 2934
Iterating global reduction 3 with 10 rules applied. Total rules applied 1383 place count 1144 transition count 2934
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1393 place count 1134 transition count 2914
Iterating global reduction 3 with 10 rules applied. Total rules applied 1403 place count 1134 transition count 2914
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1413 place count 1124 transition count 2894
Iterating global reduction 3 with 10 rules applied. Total rules applied 1423 place count 1124 transition count 2894
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1433 place count 1114 transition count 2874
Iterating global reduction 3 with 10 rules applied. Total rules applied 1443 place count 1114 transition count 2874
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1452 place count 1105 transition count 2856
Iterating global reduction 3 with 9 rules applied. Total rules applied 1461 place count 1105 transition count 2856
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1468 place count 1098 transition count 2842
Iterating global reduction 3 with 7 rules applied. Total rules applied 1475 place count 1098 transition count 2842
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1508 place count 1065 transition count 2716
Iterating global reduction 3 with 33 rules applied. Total rules applied 1541 place count 1065 transition count 2716
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1583 place count 1023 transition count 2548
Iterating global reduction 3 with 42 rules applied. Total rules applied 1625 place count 1023 transition count 2548
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1666 place count 982 transition count 2442
Iterating global reduction 3 with 41 rules applied. Total rules applied 1707 place count 982 transition count 2442
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1748 place count 941 transition count 2360
Iterating global reduction 3 with 41 rules applied. Total rules applied 1789 place count 941 transition count 2360
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1829 place count 901 transition count 2280
Iterating global reduction 3 with 40 rules applied. Total rules applied 1869 place count 901 transition count 2280
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1908 place count 862 transition count 2202
Iterating global reduction 3 with 39 rules applied. Total rules applied 1947 place count 862 transition count 2202
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1982 place count 827 transition count 2132
Iterating global reduction 3 with 35 rules applied. Total rules applied 2017 place count 827 transition count 2132
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2028 place count 816 transition count 2110
Iterating global reduction 3 with 11 rules applied. Total rules applied 2039 place count 816 transition count 2110
Applied a total of 2039 rules in 1159 ms. Remains 816 /1628 variables (removed 812) and now considering 2110/5962 (removed 3852) transitions.
[2024-05-31 21:36:45] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
// Phase 1: matrix 1428 rows 816 cols
[2024-05-31 21:36:45] [INFO ] Computed 2 invariants in 40 ms
[2024-05-31 21:36:46] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-31 21:36:46] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-31 21:36:46] [INFO ] Invariant cache hit.
[2024-05-31 21:36:47] [INFO ] State equation strengthened by 346 read => feed constraints.
[2024-05-31 21:36:49] [INFO ] Implicit Places using invariants and state equation in 3000 ms returned []
Implicit Place search using SMT with State Equation took 4342 ms to find 0 implicit places.
Running 2108 sub problems to find dead transitions.
[2024-05-31 21:36:49] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-31 21:36:49] [INFO ] Invariant cache hit.
[2024-05-31 21:36:49] [INFO ] State equation strengthened by 346 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/816 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2108 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 816/2244 variables, and 2 constraints, problems are : Problem set: 0 solved, 2108 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/816 constraints, ReadFeed: 0/346 constraints, PredecessorRefiner: 2108/2108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/816 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/2244 variables, and 2 constraints, problems are : Problem set: 0 solved, 2108 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/816 constraints, ReadFeed: 0/346 constraints, PredecessorRefiner: 0/2108 constraints, Known Traps: 0/0 constraints]
After SMT, in 71988ms problems are : Problem set: 0 solved, 2108 unsolved
Search for dead transitions found 0 dead transitions in 72043ms
Starting structural reductions in LTL mode, iteration 1 : 816/1628 places, 2110/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77578 ms. Remains : 816/1628 places, 2110/5962 transitions.
Support contains 27 out of 816 places after structural reductions.
[2024-05-31 21:38:02] [INFO ] Flatten gal took : 160 ms
[2024-05-31 21:38:02] [INFO ] Flatten gal took : 104 ms
[2024-05-31 21:38:02] [INFO ] Input system was already deterministic with 2110 transitions.
RANDOM walk for 40007 steps (8 resets) in 3127 ms. (12 steps per ms) remains 9/18 properties
BEST_FIRST walk for 40004 steps (9 resets) in 187 ms. (212 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 207 ms. (192 steps per ms) remains 2/3 properties
[2024-05-31 21:38:03] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-31 21:38:03] [INFO ] Invariant cache hit.
[2024-05-31 21:38:03] [INFO ] State equation strengthened by 346 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 382/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 646/1032 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 372/1404 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1404 variables, 251/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1404 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 612/2016 variables, 269/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2016 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2016 variables, 95/1011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2016 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 181/2197 variables, 127/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2197 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 35/2232 variables, 16/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2232 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/2244 variables, 10/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2244 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2244 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2244/2244 variables, and 1164 constraints, problems are : Problem set: 0 solved, 2 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 816/816 constraints, ReadFeed: 346/346 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 382/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 646/1032 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 372/1404 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1404 variables, 251/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1404 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1404 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 612/2016 variables, 269/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2016 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2016 variables, 95/1013 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2016 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 181/2197 variables, 127/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2197 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 35/2232 variables, 16/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2232 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/2244 variables, 10/1166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2244 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2244 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2244/2244 variables, and 1166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 816/816 constraints, ReadFeed: 346/346 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1827ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 332 steps, including 6 resets, run visited all 2 properties in 6 ms. (steps per millisecond=55 )
Parikh walk visited 2 properties in 14 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' '!(F(G(p0)))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 55 place count 788 transition count 2042
Iterating global reduction 1 with 13 rules applied. Total rules applied 68 place count 788 transition count 2042
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 788 transition count 2038
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 778 transition count 2014
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 778 transition count 2014
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 106 place count 764 transition count 1966
Iterating global reduction 2 with 14 rules applied. Total rules applied 120 place count 764 transition count 1966
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 136 place count 748 transition count 1912
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 748 transition count 1912
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 167 place count 733 transition count 1876
Iterating global reduction 2 with 15 rules applied. Total rules applied 182 place count 733 transition count 1876
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 197 place count 718 transition count 1846
Iterating global reduction 2 with 15 rules applied. Total rules applied 212 place count 718 transition count 1846
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 229 place count 701 transition count 1806
Iterating global reduction 2 with 17 rules applied. Total rules applied 246 place count 701 transition count 1806
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 263 place count 684 transition count 1762
Iterating global reduction 2 with 17 rules applied. Total rules applied 280 place count 684 transition count 1762
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 296 place count 668 transition count 1726
Iterating global reduction 2 with 16 rules applied. Total rules applied 312 place count 668 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 320 place count 660 transition count 1710
Iterating global reduction 2 with 8 rules applied. Total rules applied 328 place count 660 transition count 1710
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 333 place count 655 transition count 1700
Iterating global reduction 2 with 5 rules applied. Total rules applied 338 place count 655 transition count 1700
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 343 place count 650 transition count 1690
Iterating global reduction 2 with 5 rules applied. Total rules applied 348 place count 650 transition count 1690
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 353 place count 645 transition count 1680
Iterating global reduction 2 with 5 rules applied. Total rules applied 358 place count 645 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 360 place count 643 transition count 1676
Iterating global reduction 2 with 2 rules applied. Total rules applied 362 place count 643 transition count 1676
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 370 place count 643 transition count 1668
Applied a total of 370 rules in 612 ms. Remains 643 /816 variables (removed 173) and now considering 1668/2110 (removed 442) transitions.
[2024-05-31 21:38:06] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
// Phase 1: matrix 1116 rows 643 cols
[2024-05-31 21:38:06] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 21:38:06] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-31 21:38:06] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
[2024-05-31 21:38:06] [INFO ] Invariant cache hit.
[2024-05-31 21:38:07] [INFO ] State equation strengthened by 276 read => feed constraints.
[2024-05-31 21:38:08] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2024-05-31 21:38:08] [INFO ] Redundant transitions in 85 ms returned []
Running 1666 sub problems to find dead transitions.
[2024-05-31 21:38:08] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
[2024-05-31 21:38:08] [INFO ] Invariant cache hit.
[2024-05-31 21:38:08] [INFO ] State equation strengthened by 276 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/1759 variables, and 2 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/643 constraints, ReadFeed: 0/276 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1759 variables, 643/645 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1759 variables, 276/921 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1759/1759 variables, and 2587 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 31782 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 643/643 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
After SMT, in 70026ms problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 70041ms
Starting structural reductions in SI_LTL mode, iteration 1 : 643/816 places, 1668/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73177 ms. Remains : 643/816 places, 1668/2110 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 586 ms.
Stack based approach found an accepted trace after 7419 steps with 0 reset with depth 7420 and stack size 7420 in 45 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-00 finished in 74011 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)||((p1||X(G(p0)))&&(G(p2)||X(p3)))||G(p1))))'
Support contains 7 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 804 transition count 2086
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 804 transition count 2086
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 804 transition count 2074
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 795 transition count 2056
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 795 transition count 2056
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 795 transition count 2052
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 788 transition count 2036
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 788 transition count 2036
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 778 transition count 2004
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 778 transition count 2004
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 766 transition count 1964
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 766 transition count 1964
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 128 place count 754 transition count 1934
Iterating global reduction 2 with 12 rules applied. Total rules applied 140 place count 754 transition count 1934
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 152 place count 742 transition count 1910
Iterating global reduction 2 with 12 rules applied. Total rules applied 164 place count 742 transition count 1910
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 177 place count 729 transition count 1880
Iterating global reduction 2 with 13 rules applied. Total rules applied 190 place count 729 transition count 1880
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 205 place count 714 transition count 1840
Iterating global reduction 2 with 15 rules applied. Total rules applied 220 place count 714 transition count 1840
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 235 place count 699 transition count 1800
Iterating global reduction 2 with 15 rules applied. Total rules applied 250 place count 699 transition count 1800
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 260 place count 689 transition count 1776
Iterating global reduction 2 with 10 rules applied. Total rules applied 270 place count 689 transition count 1776
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 277 place count 682 transition count 1762
Iterating global reduction 2 with 7 rules applied. Total rules applied 284 place count 682 transition count 1762
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 291 place count 675 transition count 1748
Iterating global reduction 2 with 7 rules applied. Total rules applied 298 place count 675 transition count 1748
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 305 place count 668 transition count 1734
Iterating global reduction 2 with 7 rules applied. Total rules applied 312 place count 668 transition count 1734
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 317 place count 663 transition count 1724
Iterating global reduction 2 with 5 rules applied. Total rules applied 322 place count 663 transition count 1724
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 324 place count 661 transition count 1720
Iterating global reduction 2 with 2 rules applied. Total rules applied 326 place count 661 transition count 1720
Applied a total of 326 rules in 257 ms. Remains 661 /816 variables (removed 155) and now considering 1720/2110 (removed 390) transitions.
[2024-05-31 21:39:19] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
// Phase 1: matrix 1154 rows 661 cols
[2024-05-31 21:39:19] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 21:39:20] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-31 21:39:20] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
[2024-05-31 21:39:20] [INFO ] Invariant cache hit.
[2024-05-31 21:39:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-31 21:39:22] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2437 ms to find 0 implicit places.
Running 1718 sub problems to find dead transitions.
[2024-05-31 21:39:22] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
[2024-05-31 21:39:22] [INFO ] Invariant cache hit.
[2024-05-31 21:39:22] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/661 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/661 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/1815 variables, and 2 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/661 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/661 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/661 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1154/1815 variables, 661/663 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1815 variables, 284/947 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1815/1815 variables, and 2665 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 31850 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 661/661 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
After SMT, in 70383ms problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 70404ms
Starting structural reductions in LTL mode, iteration 1 : 661/816 places, 1720/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73106 ms. Remains : 661/816 places, 1720/2110 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 607 ms.
Product exploration explored 100000 steps with 50000 reset in 622 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 : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 45 factoid took 137 ms. Reduced automaton from 4 states, 28 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLCardinality-03 finished in 74782 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(F(p0))||G(p1))))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 801 transition count 2066
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 788 transition count 2040
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 788 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 788 transition count 2036
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 85 place count 777 transition count 2010
Iterating global reduction 2 with 11 rules applied. Total rules applied 96 place count 777 transition count 2010
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 111 place count 762 transition count 1960
Iterating global reduction 2 with 15 rules applied. Total rules applied 126 place count 762 transition count 1960
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 143 place count 745 transition count 1904
Iterating global reduction 2 with 17 rules applied. Total rules applied 160 place count 745 transition count 1904
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 176 place count 729 transition count 1866
Iterating global reduction 2 with 16 rules applied. Total rules applied 192 place count 729 transition count 1866
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 208 place count 713 transition count 1834
Iterating global reduction 2 with 16 rules applied. Total rules applied 224 place count 713 transition count 1834
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 240 place count 697 transition count 1802
Iterating global reduction 2 with 16 rules applied. Total rules applied 256 place count 697 transition count 1802
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 276 place count 677 transition count 1750
Iterating global reduction 2 with 20 rules applied. Total rules applied 296 place count 677 transition count 1750
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 314 place count 659 transition count 1700
Iterating global reduction 2 with 18 rules applied. Total rules applied 332 place count 659 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 342 place count 649 transition count 1678
Iterating global reduction 2 with 10 rules applied. Total rules applied 352 place count 649 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 359 place count 642 transition count 1664
Iterating global reduction 2 with 7 rules applied. Total rules applied 366 place count 642 transition count 1664
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 373 place count 635 transition count 1650
Iterating global reduction 2 with 7 rules applied. Total rules applied 380 place count 635 transition count 1650
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 387 place count 628 transition count 1636
Iterating global reduction 2 with 7 rules applied. Total rules applied 394 place count 628 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 401 place count 621 transition count 1622
Iterating global reduction 2 with 7 rules applied. Total rules applied 408 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 620 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 620 transition count 1620
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 414 place count 620 transition count 1616
Applied a total of 414 rules in 402 ms. Remains 620 /816 variables (removed 196) and now considering 1616/2110 (removed 494) transitions.
[2024-05-31 21:40:34] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-31 21:40:34] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 21:40:35] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-31 21:40:35] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-31 21:40:35] [INFO ] Invariant cache hit.
[2024-05-31 21:40:35] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:40:37] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
[2024-05-31 21:40:37] [INFO ] Redundant transitions in 77 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-31 21:40:37] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-31 21:40:37] [INFO ] Invariant cache hit.
[2024-05-31 21:40:37] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 69332ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 69349ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/816 places, 1616/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72130 ms. Remains : 620/816 places, 1616/2110 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 439 ms.
Product exploration explored 100000 steps with 0 reset in 478 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 : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40010 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
[2024-05-31 21:41:47] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-31 21:41:47] [INFO ] Invariant cache hit.
[2024-05-31 21:41:47] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1544 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1544 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/1681 variables, 132/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1693 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1700 variables, 5/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1700/1700 variables, and 890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1482 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1544 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1544 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/1681 variables, 132/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1693 variables, 6/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1693 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/1700 variables, 5/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1275ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2699 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.3 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1232
Applied a total of 385 rules in 94 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 428/620 places, 1232/1616 transitions.
RANDOM walk for 40009 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 628485 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 1
Probabilistic random walk after 628485 steps, saw 366715 distinct states, run finished after 3004 ms. (steps per millisecond=209 ) properties seen :0
[2024-05-31 21:41:52] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
// Phase 1: matrix 698 rows 428 cols
[2024-05-31 21:41:52] [INFO ] Computed 3 invariants in 6 ms
[2024-05-31 21:41:52] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1119 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1126 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1119 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1126 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 51 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 48 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-31 21:41:53] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-31 21:41:53] [INFO ] Invariant cache hit.
[2024-05-31 21:41:53] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-31 21:41:53] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-31 21:41:53] [INFO ] Invariant cache hit.
[2024-05-31 21:41:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 21:41:54] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2024-05-31 21:41:54] [INFO ] Redundant transitions in 17 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-31 21:41:54] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-31 21:41:54] [INFO ] Invariant cache hit.
[2024-05-31 21:41:54] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-31 21:42:08] [INFO ] Deduced a trap composed of 131 places in 186 ms of which 24 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 698/1126 variables, 428/432 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34188ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36002 ms. Remains : 428/428 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 428 transition count 683
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 413 transition count 683
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 413 transition count 611
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 341 transition count 611
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 964 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 23 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 38
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 4 with 2 rules applied. Total rules applied 1412 place count 21 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1414 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1416 place count 20 transition count 35
Applied a total of 1416 rules in 86 ms. Remains 20 /428 variables (removed 408) and now considering 35/1232 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2024-05-31 21:42:29] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:42:29] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:42:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:42:29] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:42:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:42:29] [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:42:29] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:42:29] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 173 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 96 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-31 21:42:29] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-31 21:42:29] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 21:42:30] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-05-31 21:42:30] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-31 21:42:30] [INFO ] Invariant cache hit.
[2024-05-31 21:42:30] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:42:32] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
[2024-05-31 21:42:32] [INFO ] Redundant transitions in 23 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-31 21:42:32] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-31 21:42:32] [INFO ] Invariant cache hit.
[2024-05-31 21:42:32] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 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 620/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31598 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 69453ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 69471ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71911 ms. Remains : 620/620 places, 1616/1616 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 : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40001 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
[2024-05-31 21:43:41] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-31 21:43:41] [INFO ] Invariant cache hit.
[2024-05-31 21:43:41] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1544 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1544 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/1681 variables, 132/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1693 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1700 variables, 5/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1700/1700 variables, and 890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1482 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1544 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1544 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/1681 variables, 132/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1693 variables, 6/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1693 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/1700 variables, 5/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1000ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2699 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1232
Applied a total of 385 rules in 53 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 428/620 places, 1232/1616 transitions.
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 674126 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 674126 steps, saw 394164 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
[2024-05-31 21:43:45] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
// Phase 1: matrix 698 rows 428 cols
[2024-05-31 21:43:46] [INFO ] Computed 3 invariants in 12 ms
[2024-05-31 21:43:46] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1119 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1126 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1119 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1126 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 52 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 48 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-31 21:43:46] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-31 21:43:46] [INFO ] Invariant cache hit.
[2024-05-31 21:43:47] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-31 21:43:47] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-31 21:43:47] [INFO ] Invariant cache hit.
[2024-05-31 21:43:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 21:43:48] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2024-05-31 21:43:48] [INFO ] Redundant transitions in 18 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-31 21:43:48] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-31 21:43:48] [INFO ] Invariant cache hit.
[2024-05-31 21:43:48] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-31 21:44:02] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 698/1126 variables, 428/432 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34263ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36101 ms. Remains : 428/428 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 428 transition count 683
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 413 transition count 683
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 413 transition count 611
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 341 transition count 611
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 964 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 23 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 38
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 4 with 2 rules applied. Total rules applied 1412 place count 21 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1414 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1416 place count 20 transition count 35
Applied a total of 1416 rules in 33 ms. Remains 20 /428 variables (removed 408) and now considering 35/1232 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2024-05-31 21:44:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:44:22] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:44:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:44:22] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:44:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:44:22] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:44:22] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:44:22] [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 115 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 446 ms.
Product exploration explored 100000 steps with 0 reset in 502 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 76 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-31 21:44:24] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-31 21:44:24] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 21:44:24] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-31 21:44:24] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-31 21:44:24] [INFO ] Invariant cache hit.
[2024-05-31 21:44:25] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:44:26] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2024-05-31 21:44:26] [INFO ] Redundant transitions in 29 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-31 21:44:26] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-31 21:44:26] [INFO ] Invariant cache hit.
[2024-05-31 21:44:26] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31637 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 69521ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 69537ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71889 ms. Remains : 620/620 places, 1616/1616 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-04 finished in 302075 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((X(F(p0)) U (p1||F(p2))))))'
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 801 transition count 2070
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 789 transition count 2046
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 789 transition count 2046
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 789 transition count 2042
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 777 transition count 2014
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 777 transition count 2014
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 108 place count 761 transition count 1962
Iterating global reduction 2 with 16 rules applied. Total rules applied 124 place count 761 transition count 1962
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 142 place count 743 transition count 1904
Iterating global reduction 2 with 18 rules applied. Total rules applied 160 place count 743 transition count 1904
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 177 place count 726 transition count 1864
Iterating global reduction 2 with 17 rules applied. Total rules applied 194 place count 726 transition count 1864
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 211 place count 709 transition count 1830
Iterating global reduction 2 with 17 rules applied. Total rules applied 228 place count 709 transition count 1830
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 247 place count 690 transition count 1786
Iterating global reduction 2 with 19 rules applied. Total rules applied 266 place count 690 transition count 1786
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 287 place count 669 transition count 1730
Iterating global reduction 2 with 21 rules applied. Total rules applied 308 place count 669 transition count 1730
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 327 place count 650 transition count 1682
Iterating global reduction 2 with 19 rules applied. Total rules applied 346 place count 650 transition count 1682
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 357 place count 639 transition count 1658
Iterating global reduction 2 with 11 rules applied. Total rules applied 368 place count 639 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 376 place count 631 transition count 1642
Iterating global reduction 2 with 8 rules applied. Total rules applied 384 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 392 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 623 transition count 1626
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 408 place count 615 transition count 1610
Iterating global reduction 2 with 8 rules applied. Total rules applied 416 place count 615 transition count 1610
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 421 place count 610 transition count 1600
Iterating global reduction 2 with 5 rules applied. Total rules applied 426 place count 610 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 427 place count 609 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 609 transition count 1598
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 609 transition count 1596
Applied a total of 430 rules in 472 ms. Remains 609 /816 variables (removed 207) and now considering 1596/2110 (removed 514) transitions.
[2024-05-31 21:45:36] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-31 21:45:36] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 21:45:37] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-31 21:45:37] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-31 21:45:37] [INFO ] Invariant cache hit.
[2024-05-31 21:45:37] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-31 21:45:39] [INFO ] Implicit Places using invariants and state equation in 1965 ms returned []
Implicit Place search using SMT with State Equation took 2407 ms to find 0 implicit places.
[2024-05-31 21:45:39] [INFO ] Redundant transitions in 26 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-31 21:45:39] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-31 21:45:39] [INFO ] Invariant cache hit.
[2024-05-31 21:45:39] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 68906ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 68919ms
Starting structural reductions in SI_LTL mode, iteration 1 : 609/816 places, 1596/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71832 ms. Remains : 609/816 places, 1596/2110 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 409 ms.
Product exploration explored 100000 steps with 0 reset in 441 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/609 stabilizing places and 512/1596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 155 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40006 steps (8 resets) in 147 ms. (270 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 89 ms. (444 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
[2024-05-31 21:46:49] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-31 21:46:49] [INFO ] Invariant cache hit.
[2024-05-31 21:46:49] [INFO ] State equation strengthened by 266 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 337/1592 variables, 139/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1592 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 67/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 70/1662 variables, 66/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 337/1592 variables, 139/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 67/805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1592 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 70/1662 variables, 66/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1670 variables, 4/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1670 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/1676 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1676 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1676 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1378ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 133 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Graph (complete) has 2662 edges and 609 vertex of which 420 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.0 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 420 transition count 1218
Applied a total of 379 rules in 47 ms. Remains 420 /609 variables (removed 189) and now considering 1218/1596 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 420/609 places, 1218/1596 transitions.
RANDOM walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 630327 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 1
Probabilistic random walk after 630327 steps, saw 386504 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2024-05-31 21:46:54] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
// Phase 1: matrix 691 rows 420 cols
[2024-05-31 21:46:54] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 21:46:54] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/1090 variables, 13/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/1097 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1105 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1111 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/1090 variables, 13/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1097 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1105 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1111 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 722ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 420/420 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:46:55] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-31 21:46:55] [INFO ] Invariant cache hit.
[2024-05-31 21:46:55] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-31 21:46:55] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-31 21:46:55] [INFO ] Invariant cache hit.
[2024-05-31 21:46:55] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:46:56] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
[2024-05-31 21:46:56] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:46:56] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-31 21:46:56] [INFO ] Invariant cache hit.
[2024-05-31 21:46:56] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 691/1111 variables, 420/422 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33687ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35398 ms. Remains : 420/420 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 537 rules applied. Total rules applied 537 place count 420 transition count 681
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 548 place count 410 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 409 transition count 680
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 549 place count 409 transition count 613
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 683 place count 342 transition count 613
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 937 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1001 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 1065 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 151 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1066 place count 151 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1068 place count 150 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1131 place count 87 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 1194 place count 87 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1257 place count 24 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1320 place count 24 transition count 104
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1381 place count 24 transition count 43
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 1383 place count 23 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1390 place count 23 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1391 place count 23 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1392 place count 23 transition count 36
Applied a total of 1392 rules in 29 ms. Remains 23 /420 variables (removed 397) and now considering 36/1218 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 23 cols
[2024-05-31 21:47:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:47:30] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:47:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:47:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:47:30] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:47:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:47:30] [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:47:30] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:47:30] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 410 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 75 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-31 21:47:31] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-31 21:47:31] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 21:47:31] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-31 21:47:31] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-31 21:47:31] [INFO ] Invariant cache hit.
[2024-05-31 21:47:32] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-31 21:47:33] [INFO ] Implicit Places using invariants and state equation in 1906 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
[2024-05-31 21:47:33] [INFO ] Redundant transitions in 29 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-31 21:47:33] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-31 21:47:33] [INFO ] Invariant cache hit.
[2024-05-31 21:47:33] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 68802ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 68817ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71291 ms. Remains : 609/609 places, 1596/1596 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/609 stabilizing places and 512/1596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 155 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40002 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 104 ms. (380 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
[2024-05-31 21:48:43] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-31 21:48:43] [INFO ] Invariant cache hit.
[2024-05-31 21:48:43] [INFO ] State equation strengthened by 266 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 337/1592 variables, 139/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1592 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 67/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 70/1662 variables, 66/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 3 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 337/1592 variables, 139/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 67/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1592 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 70/1662 variables, 66/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1670 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1670 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/1676 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1676 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1676 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 880 constraints, problems are : Problem set: 0 solved, 3 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1640ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 133 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Graph (complete) has 2662 edges and 609 vertex of which 420 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.0 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 420 transition count 1218
Applied a total of 379 rules in 46 ms. Remains 420 /609 variables (removed 189) and now considering 1218/1596 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 420/609 places, 1218/1596 transitions.
RANDOM walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 645540 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 1
Probabilistic random walk after 645540 steps, saw 395833 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
[2024-05-31 21:48:48] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
// Phase 1: matrix 691 rows 420 cols
[2024-05-31 21:48:48] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 21:48:48] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/1090 variables, 13/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/1097 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1105 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1111 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/1090 variables, 13/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1097 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1105 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1111 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 727ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 420/420 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 51 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:48:48] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-31 21:48:48] [INFO ] Invariant cache hit.
[2024-05-31 21:48:49] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-31 21:48:49] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-31 21:48:49] [INFO ] Invariant cache hit.
[2024-05-31 21:48:49] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-31 21:48:50] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
[2024-05-31 21:48:50] [INFO ] Redundant transitions in 16 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:48:50] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-31 21:48:50] [INFO ] Invariant cache hit.
[2024-05-31 21:48:50] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 691/1111 variables, 420/422 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34535ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34547ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36243 ms. Remains : 420/420 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 537 rules applied. Total rules applied 537 place count 420 transition count 681
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 548 place count 410 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 409 transition count 680
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 549 place count 409 transition count 613
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 683 place count 342 transition count 613
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 937 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1001 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 1065 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 151 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1066 place count 151 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1068 place count 150 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1131 place count 87 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 1194 place count 87 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1257 place count 24 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1320 place count 24 transition count 104
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1381 place count 24 transition count 43
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 1383 place count 23 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1390 place count 23 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1391 place count 23 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1392 place count 23 transition count 36
Applied a total of 1392 rules in 33 ms. Remains 23 /420 variables (removed 397) and now considering 36/1218 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 23 cols
[2024-05-31 21:49:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:49:25] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:49:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:49:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:49:25] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:49:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:49:25] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:49:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:49:25] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 112 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 453 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 423 ms.
Product exploration explored 100000 steps with 0 reset in 485 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 136 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-31 21:49:27] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-31 21:49:27] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 21:49:27] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-31 21:49:27] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-31 21:49:27] [INFO ] Invariant cache hit.
[2024-05-31 21:49:27] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-31 21:49:29] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2430 ms to find 0 implicit places.
[2024-05-31 21:49:29] [INFO ] Redundant transitions in 28 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-31 21:49:29] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-31 21:49:29] [INFO ] Invariant cache hit.
[2024-05-31 21:49:29] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31687 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 69862ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 69877ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72478 ms. Remains : 609/609 places, 1596/1596 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-05 finished in 302983 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||X(F(!p0))))))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 787 transition count 2040
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 775 transition count 2008
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 775 transition count 2008
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 759 transition count 1956
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 759 transition count 1956
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 147 place count 742 transition count 1900
Iterating global reduction 2 with 17 rules applied. Total rules applied 164 place count 742 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 726 transition count 1862
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 726 transition count 1862
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 212 place count 710 transition count 1830
Iterating global reduction 2 with 16 rules applied. Total rules applied 228 place count 710 transition count 1830
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 246 place count 692 transition count 1788
Iterating global reduction 2 with 18 rules applied. Total rules applied 264 place count 692 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 283 place count 673 transition count 1740
Iterating global reduction 2 with 19 rules applied. Total rules applied 302 place count 673 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 320 place count 655 transition count 1696
Iterating global reduction 2 with 18 rules applied. Total rules applied 338 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 348 place count 645 transition count 1672
Iterating global reduction 2 with 10 rules applied. Total rules applied 358 place count 645 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 365 place count 638 transition count 1658
Iterating global reduction 2 with 7 rules applied. Total rules applied 372 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 379 place count 631 transition count 1644
Iterating global reduction 2 with 7 rules applied. Total rules applied 386 place count 631 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 393 place count 624 transition count 1630
Iterating global reduction 2 with 7 rules applied. Total rules applied 400 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 620 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 410 place count 618 transition count 1618
Iterating global reduction 2 with 2 rules applied. Total rules applied 412 place count 618 transition count 1618
Applied a total of 412 rules in 279 ms. Remains 618 /816 variables (removed 198) and now considering 1618/2110 (removed 492) transitions.
[2024-05-31 21:50:39] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-31 21:50:39] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 21:50:40] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-31 21:50:40] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-31 21:50:40] [INFO ] Invariant cache hit.
[2024-05-31 21:50:40] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 21:50:42] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-31 21:50:42] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-31 21:50:42] [INFO ] Invariant cache hit.
[2024-05-31 21:50:42] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 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 618/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1698 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/1698 variables, and 2503 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 69877ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69894ms
Starting structural reductions in LTL mode, iteration 1 : 618/816 places, 1618/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72527 ms. Remains : 618/816 places, 1618/2110 transitions.
Stuttering acceptance computed with spot in 130 ms :[false, false, p0]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07
Product exploration explored 100000 steps with 24895 reset in 452 ms.
Product exploration explored 100000 steps with 24985 reset in 445 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[false, p0]
RANDOM walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 26674 steps (5 resets) in 26 ms. (987 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[false, p0]
Stuttering acceptance computed with spot in 70 ms :[false, p0]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1618/1618 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 618 transition count 1614
Applied a total of 4 rules in 160 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1618 (removed 4) transitions.
[2024-05-31 21:51:53] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-31 21:51:53] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 21:51:54] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-31 21:51:54] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 21:51:54] [INFO ] Invariant cache hit.
[2024-05-31 21:51:54] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 21:51:55] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2024-05-31 21:51:55] [INFO ] Redundant transitions in 30 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-31 21:51:55] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 21:51:55] [INFO ] Invariant cache hit.
[2024-05-31 21:51:55] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31419 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 69415ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 69437ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1614/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71924 ms. Remains : 618/618 places, 1614/1618 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[false, p0]
RANDOM walk for 40006 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 28792 steps (6 resets) in 33 ms. (846 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[false, p0]
Stuttering acceptance computed with spot in 64 ms :[false, p0]
Stuttering acceptance computed with spot in 85 ms :[false, p0]
Product exploration explored 100000 steps with 33340 reset in 458 ms.
Product exploration explored 100000 steps with 33315 reset in 465 ms.
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 70 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-31 21:53:07] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 21:53:07] [INFO ] Invariant cache hit.
[2024-05-31 21:53:07] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-31 21:53:07] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 21:53:07] [INFO ] Invariant cache hit.
[2024-05-31 21:53:07] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 21:53:09] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
[2024-05-31 21:53:09] [INFO ] Redundant transitions in 30 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-31 21:53:09] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 21:53:09] [INFO ] Invariant cache hit.
[2024-05-31 21:53:09] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 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 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 69660ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 69675ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72084 ms. Remains : 618/618 places, 1614/1614 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 219647 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' '!((p0 U (p1&&G(F(p2)))))'
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 801 transition count 2066
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 789 transition count 2042
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 789 transition count 2042
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 789 transition count 2038
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 779 transition count 2016
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 107 place count 764 transition count 1968
Iterating global reduction 2 with 15 rules applied. Total rules applied 122 place count 764 transition count 1968
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 139 place count 747 transition count 1912
Iterating global reduction 2 with 17 rules applied. Total rules applied 156 place count 747 transition count 1912
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 731 transition count 1874
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 731 transition count 1874
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 715 transition count 1842
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 715 transition count 1842
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 238 place count 697 transition count 1800
Iterating global reduction 2 with 18 rules applied. Total rules applied 256 place count 697 transition count 1800
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 276 place count 677 transition count 1746
Iterating global reduction 2 with 20 rules applied. Total rules applied 296 place count 677 transition count 1746
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 315 place count 658 transition count 1698
Iterating global reduction 2 with 19 rules applied. Total rules applied 334 place count 658 transition count 1698
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 345 place count 647 transition count 1674
Iterating global reduction 2 with 11 rules applied. Total rules applied 356 place count 647 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 364 place count 639 transition count 1658
Iterating global reduction 2 with 8 rules applied. Total rules applied 372 place count 639 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 380 place count 631 transition count 1642
Iterating global reduction 2 with 8 rules applied. Total rules applied 388 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 396 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 404 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 618 transition count 1616
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 415 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 617 transition count 1614
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 420 place count 617 transition count 1610
Applied a total of 420 rules in 451 ms. Remains 617 /816 variables (removed 199) and now considering 1610/2110 (removed 500) transitions.
[2024-05-31 21:54:19] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
// Phase 1: matrix 1077 rows 617 cols
[2024-05-31 21:54:19] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 21:54:20] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-31 21:54:20] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-31 21:54:20] [INFO ] Invariant cache hit.
[2024-05-31 21:54:20] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 21:54:21] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
[2024-05-31 21:54:21] [INFO ] Redundant transitions in 26 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-31 21:54:21] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-31 21:54:21] [INFO ] Invariant cache hit.
[2024-05-31 21:54:21] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1694 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 267/886 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2494 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 31732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
After SMT, in 69711ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 69727ms
Starting structural reductions in SI_LTL mode, iteration 1 : 617/816 places, 1610/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72420 ms. Remains : 617/816 places, 1610/2110 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-09
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-09 finished in 72621 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 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 800 transition count 2078
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 800 transition count 2078
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 800 transition count 2066
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 788 transition count 2042
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 788 transition count 2042
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 79 place count 777 transition count 2016
Iterating global reduction 1 with 11 rules applied. Total rules applied 90 place count 777 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 105 place count 762 transition count 1966
Iterating global reduction 1 with 15 rules applied. Total rules applied 120 place count 762 transition count 1966
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 135 place count 747 transition count 1920
Iterating global reduction 1 with 15 rules applied. Total rules applied 150 place count 747 transition count 1920
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 164 place count 733 transition count 1892
Iterating global reduction 1 with 14 rules applied. Total rules applied 178 place count 733 transition count 1892
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 192 place count 719 transition count 1864
Iterating global reduction 1 with 14 rules applied. Total rules applied 206 place count 719 transition count 1864
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 222 place count 703 transition count 1826
Iterating global reduction 1 with 16 rules applied. Total rules applied 238 place count 703 transition count 1826
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 258 place count 683 transition count 1768
Iterating global reduction 1 with 20 rules applied. Total rules applied 278 place count 683 transition count 1768
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 296 place count 665 transition count 1718
Iterating global reduction 1 with 18 rules applied. Total rules applied 314 place count 665 transition count 1718
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 324 place count 655 transition count 1696
Iterating global reduction 1 with 10 rules applied. Total rules applied 334 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 344 place count 645 transition count 1676
Iterating global reduction 1 with 10 rules applied. Total rules applied 354 place count 645 transition count 1676
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 364 place count 635 transition count 1656
Iterating global reduction 1 with 10 rules applied. Total rules applied 374 place count 635 transition count 1656
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 384 place count 625 transition count 1636
Iterating global reduction 1 with 10 rules applied. Total rules applied 394 place count 625 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 401 place count 618 transition count 1622
Iterating global reduction 1 with 7 rules applied. Total rules applied 408 place count 618 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 409 place count 617 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 410 place count 617 transition count 1620
Applied a total of 410 rules in 296 ms. Remains 617 /816 variables (removed 199) and now considering 1620/2110 (removed 490) transitions.
[2024-05-31 21:55:31] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2024-05-31 21:55:32] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 21:55:32] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-31 21:55:32] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2024-05-31 21:55:32] [INFO ] Invariant cache hit.
[2024-05-31 21:55:32] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 21:55:34] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2343 ms to find 0 implicit places.
Running 1618 sub problems to find dead transitions.
[2024-05-31 21:55:34] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2024-05-31 21:55:34] [INFO ] Invariant cache hit.
[2024-05-31 21:55:34] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1696 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 265/884 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 31509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
After SMT, in 69610ms problems are : Problem set: 0 solved, 1618 unsolved
Search for dead transitions found 0 dead transitions in 69627ms
Starting structural reductions in LTL mode, iteration 1 : 617/816 places, 1620/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72273 ms. Remains : 617/816 places, 1620/2110 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 577 steps with 0 reset in 7 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-10 finished in 72406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 799 transition count 2076
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 799 transition count 2076
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 48 place count 799 transition count 2062
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 785 transition count 2034
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 785 transition count 2034
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 785 transition count 2030
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 92 place count 773 transition count 2002
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 773 transition count 2002
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 120 place count 757 transition count 1950
Iterating global reduction 2 with 16 rules applied. Total rules applied 136 place count 757 transition count 1950
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 154 place count 739 transition count 1892
Iterating global reduction 2 with 18 rules applied. Total rules applied 172 place count 739 transition count 1892
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 189 place count 722 transition count 1852
Iterating global reduction 2 with 17 rules applied. Total rules applied 206 place count 722 transition count 1852
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 223 place count 705 transition count 1818
Iterating global reduction 2 with 17 rules applied. Total rules applied 240 place count 705 transition count 1818
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 259 place count 686 transition count 1774
Iterating global reduction 2 with 19 rules applied. Total rules applied 278 place count 686 transition count 1774
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 299 place count 665 transition count 1718
Iterating global reduction 2 with 21 rules applied. Total rules applied 320 place count 665 transition count 1718
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 339 place count 646 transition count 1670
Iterating global reduction 2 with 19 rules applied. Total rules applied 358 place count 646 transition count 1670
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 369 place count 635 transition count 1646
Iterating global reduction 2 with 11 rules applied. Total rules applied 380 place count 635 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 388 place count 627 transition count 1630
Iterating global reduction 2 with 8 rules applied. Total rules applied 396 place count 627 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 404 place count 619 transition count 1614
Iterating global reduction 2 with 8 rules applied. Total rules applied 412 place count 619 transition count 1614
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 420 place count 611 transition count 1598
Iterating global reduction 2 with 8 rules applied. Total rules applied 428 place count 611 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 433 place count 606 transition count 1588
Iterating global reduction 2 with 5 rules applied. Total rules applied 438 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 439 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 440 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 442 place count 605 transition count 1584
Applied a total of 442 rules in 459 ms. Remains 605 /816 variables (removed 211) and now considering 1584/2110 (removed 526) transitions.
[2024-05-31 21:56:44] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-31 21:56:44] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 21:56:45] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-31 21:56:45] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:56:45] [INFO ] Invariant cache hit.
[2024-05-31 21:56:45] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 21:56:46] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2024-05-31 21:56:46] [INFO ] Redundant transitions in 28 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 21:56:46] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:56:46] [INFO ] Invariant cache hit.
[2024-05-31 21:56:46] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31491 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 69168ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 69182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/816 places, 1584/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71995 ms. Remains : 605/816 places, 1584/2110 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 389 ms.
Product exploration explored 100000 steps with 0 reset in 520 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33384 steps (7 resets) in 90 ms. (366 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 78 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-31 21:57:57] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:57:57] [INFO ] Invariant cache hit.
[2024-05-31 21:57:58] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-31 21:57:58] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:57:58] [INFO ] Invariant cache hit.
[2024-05-31 21:57:58] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 21:58:00] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2366 ms to find 0 implicit places.
[2024-05-31 21:58:00] [INFO ] Redundant transitions in 30 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 21:58:00] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:58:00] [INFO ] Invariant cache hit.
[2024-05-31 21:58:00] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 69521ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 69537ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72024 ms. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40007 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
BEST_FIRST walk for 20320 steps (4 resets) in 17 ms. (1128 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 417 ms.
Product exploration explored 100000 steps with 0 reset in 438 ms.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 73 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-31 21:59:11] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:59:11] [INFO ] Invariant cache hit.
[2024-05-31 21:59:11] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-31 21:59:11] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:59:11] [INFO ] Invariant cache hit.
[2024-05-31 21:59:11] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 21:59:13] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
[2024-05-31 21:59:13] [INFO ] Redundant transitions in 30 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 21:59:13] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:59:13] [INFO ] Invariant cache hit.
[2024-05-31 21:59:13] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31725 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 70058ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 70074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72410 ms. Remains : 605/605 places, 1584/1584 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-13 finished in 219472 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((p0 U (p1||G(p0)))))'
Support contains 3 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 800 transition count 2078
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 800 transition count 2078
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 800 transition count 2066
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 787 transition count 2040
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 85 place count 776 transition count 2010
Iterating global reduction 2 with 11 rules applied. Total rules applied 96 place count 776 transition count 2010
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 764 transition count 1974
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 764 transition count 1974
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 135 place count 749 transition count 1928
Iterating global reduction 2 with 15 rules applied. Total rules applied 150 place count 749 transition count 1928
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 164 place count 735 transition count 1892
Iterating global reduction 2 with 14 rules applied. Total rules applied 178 place count 735 transition count 1892
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 192 place count 721 transition count 1864
Iterating global reduction 2 with 14 rules applied. Total rules applied 206 place count 721 transition count 1864
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 223 place count 704 transition count 1822
Iterating global reduction 2 with 17 rules applied. Total rules applied 240 place count 704 transition count 1822
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 259 place count 685 transition count 1768
Iterating global reduction 2 with 19 rules applied. Total rules applied 278 place count 685 transition count 1768
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 296 place count 667 transition count 1720
Iterating global reduction 2 with 18 rules applied. Total rules applied 314 place count 667 transition count 1720
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 328 place count 653 transition count 1688
Iterating global reduction 2 with 14 rules applied. Total rules applied 342 place count 653 transition count 1688
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 352 place count 643 transition count 1668
Iterating global reduction 2 with 10 rules applied. Total rules applied 362 place count 643 transition count 1668
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 372 place count 633 transition count 1648
Iterating global reduction 2 with 10 rules applied. Total rules applied 382 place count 633 transition count 1648
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 392 place count 623 transition count 1628
Iterating global reduction 2 with 10 rules applied. Total rules applied 402 place count 623 transition count 1628
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 408 place count 617 transition count 1616
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 615 transition count 1612
Applied a total of 418 rules in 311 ms. Remains 615 /816 variables (removed 201) and now considering 1612/2110 (removed 498) transitions.
[2024-05-31 22:00:23] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-31 22:00:23] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 22:00:24] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-31 22:00:24] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-31 22:00:24] [INFO ] Invariant cache hit.
[2024-05-31 22:00:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:00:26] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-31 22:00:26] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-31 22:00:26] [INFO ] Invariant cache hit.
[2024-05-31 22:00:26] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31627 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69159ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69177ms
Starting structural reductions in LTL mode, iteration 1 : 615/816 places, 1612/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71678 ms. Remains : 615/816 places, 1612/2110 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-15 finished in 71809 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(F(p0))||G(p1))))'
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((X(F(p0)) U (p1||F(p2))))))'
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||X(F(!p0))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c008-LTLCardinality-07
Stuttering acceptance computed with spot in 119 ms :[false, false, p0]
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 787 transition count 2040
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 775 transition count 2008
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 775 transition count 2008
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 759 transition count 1956
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 759 transition count 1956
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 147 place count 742 transition count 1900
Iterating global reduction 2 with 17 rules applied. Total rules applied 164 place count 742 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 726 transition count 1862
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 726 transition count 1862
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 212 place count 710 transition count 1830
Iterating global reduction 2 with 16 rules applied. Total rules applied 228 place count 710 transition count 1830
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 246 place count 692 transition count 1788
Iterating global reduction 2 with 18 rules applied. Total rules applied 264 place count 692 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 283 place count 673 transition count 1740
Iterating global reduction 2 with 19 rules applied. Total rules applied 302 place count 673 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 320 place count 655 transition count 1696
Iterating global reduction 2 with 18 rules applied. Total rules applied 338 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 348 place count 645 transition count 1672
Iterating global reduction 2 with 10 rules applied. Total rules applied 358 place count 645 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 365 place count 638 transition count 1658
Iterating global reduction 2 with 7 rules applied. Total rules applied 372 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 379 place count 631 transition count 1644
Iterating global reduction 2 with 7 rules applied. Total rules applied 386 place count 631 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 393 place count 624 transition count 1630
Iterating global reduction 2 with 7 rules applied. Total rules applied 400 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 620 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 410 place count 618 transition count 1618
Iterating global reduction 2 with 2 rules applied. Total rules applied 412 place count 618 transition count 1618
Applied a total of 412 rules in 349 ms. Remains 618 /816 variables (removed 198) and now considering 1618/2110 (removed 492) transitions.
[2024-05-31 22:01:36] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-31 22:01:36] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 22:01:36] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-31 22:01:36] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-31 22:01:36] [INFO ] Invariant cache hit.
[2024-05-31 22:01:37] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 22:01:38] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-31 22:01:38] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-31 22:01:38] [INFO ] Invariant cache hit.
[2024-05-31 22:01:38] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1698 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/1698 variables, and 2503 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 69258ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69272ms
Starting structural reductions in LI_LTL mode, iteration 1 : 618/816 places, 1618/2110 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 72028 ms. Remains : 618/816 places, 1618/2110 transitions.
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07
Product exploration explored 100000 steps with 25019 reset in 421 ms.
Product exploration explored 100000 steps with 24994 reset in 467 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[false, p0]
RANDOM walk for 20618 steps (4 resets) in 52 ms. (389 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[false, p0]
Stuttering acceptance computed with spot in 83 ms :[false, p0]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1618/1618 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 618 transition count 1614
Applied a total of 4 rules in 142 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1618 (removed 4) transitions.
[2024-05-31 22:02:49] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-31 22:02:49] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 22:02:49] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-31 22:02:49] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 22:02:49] [INFO ] Invariant cache hit.
[2024-05-31 22:02:50] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 22:02:51] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2344 ms to find 0 implicit places.
[2024-05-31 22:02:51] [INFO ] Redundant transitions in 28 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-31 22:02:51] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 22:02:51] [INFO ] Invariant cache hit.
[2024-05-31 22:02:51] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31658 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 69410ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 69423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1614/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71951 ms. Remains : 618/618 places, 1614/1618 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[false, p0]
RANDOM walk for 18930 steps (5 resets) in 58 ms. (320 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[false, p0]
Stuttering acceptance computed with spot in 67 ms :[false, p0]
Stuttering acceptance computed with spot in 79 ms :[false, p0]
Product exploration explored 100000 steps with 33238 reset in 463 ms.
Product exploration explored 100000 steps with 33295 reset in 474 ms.
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 75 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-31 22:04:02] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 22:04:02] [INFO ] Invariant cache hit.
[2024-05-31 22:04:03] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-31 22:04:03] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 22:04:03] [INFO ] Invariant cache hit.
[2024-05-31 22:04:03] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 22:04:05] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
[2024-05-31 22:04:05] [INFO ] Redundant transitions in 28 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-31 22:04:05] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-31 22:04:05] [INFO ] Invariant cache hit.
[2024-05-31 22:04:05] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 69534ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 69558ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71940 ms. Remains : 618/618 places, 1614/1614 transitions.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 219164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-31 22:05:15] [INFO ] Flatten gal took : 71 ms
[2024-05-31 22:05:15] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:05:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 816 places, 2110 transitions and 8566 arcs took 14 ms.
Total runtime 1711808 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-c008-LTLCardinality-04
Could not compute solution for formula : FunctionPointer-PT-c008-LTLCardinality-05
Could not compute solution for formula : FunctionPointer-PT-c008-LTLCardinality-07
Could not compute solution for formula : FunctionPointer-PT-c008-LTLCardinality-13

BK_STOP 1717193595357

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-c008-LTLCardinality-04
ltl formula formula --ltl=/tmp/1764/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 816 places, 2110 transitions and 8566 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.230 real 0.070 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1764/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1764/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1764/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1764/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 817 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 817, there are 2116 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): ~2500 levels ~10000 states ~32752 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~65252 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~130252 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~260252 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~520252 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~1040252 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~2080200 transitions
pnml2lts-mc( 1/ 4): ~320000 levels ~1280000 states ~4160252 transitions
pnml2lts-mc( 2/ 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: 1932965
pnml2lts-mc( 0/ 4): unique transitions count: 8667329
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1122305
pnml2lts-mc( 0/ 4): - claim success count: 1932972
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1764690
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1932972 states 8667353 transitions, fanout: 4.484
pnml2lts-mc( 0/ 4): Total exploration time 100.340 sec (100.320 sec minimum, 100.330 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19264, Transitions per second: 86380
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.9MB, 17.9 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 115.9MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-c008-LTLCardinality-05
ltl formula formula --ltl=/tmp/1764/ltl_1_
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 816 places, 2110 transitions and 8566 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.210 real 0.060 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1764/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1764/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1764/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1764/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 817 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 817, there are 2119 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( 2/ 4): ~1188 levels ~10000 states ~29892 transitions
pnml2lts-mc( 2/ 4): ~2038 levels ~20000 states ~55684 transitions
pnml2lts-mc( 2/ 4): ~3737 levels ~40000 states ~107276 transitions
pnml2lts-mc( 2/ 4): ~7137 levels ~80000 states ~210544 transitions
pnml2lts-mc( 2/ 4): ~13936 levels ~160000 states ~417360 transitions
pnml2lts-mc( 2/ 4): ~27534 levels ~320000 states ~830540 transitions
pnml2lts-mc( 2/ 4): ~54731 levels ~640000 states ~1657212 transitions
pnml2lts-mc( 2/ 4): ~109123 levels ~1280000 states ~3310416 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: 2516358
pnml2lts-mc( 0/ 4): unique transitions count: 9051400
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 898746
pnml2lts-mc( 0/ 4): - claim success count: 2516364
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1856485
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2516364 states 9051418 transitions, fanout: 3.597
pnml2lts-mc( 0/ 4): Total exploration time 150.510 sec (150.500 sec minimum, 150.503 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16719, Transitions per second: 60138
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 121.3MB, 16.9 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 121.3MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-c008-LTLCardinality-07
ltl formula formula --ltl=/tmp/1764/ltl_2_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 816 places, 2110 transitions and 8566 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.210 real 0.060 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1764/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1764/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1764/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1764/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 818 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 817, there are 2114 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( 3/ 4): ~1254 levels ~10000 states ~39996 transitions
pnml2lts-mc( 0/ 4): ~2501 levels ~20000 states ~75644 transitions
pnml2lts-mc( 0/ 4): ~5001 levels ~40000 states ~150652 transitions
pnml2lts-mc( 0/ 4): ~10001 levels ~80000 states ~300652 transitions
pnml2lts-mc( 0/ 4): ~20001 levels ~160000 states ~600652 transitions
pnml2lts-mc( 3/ 4): ~40004 levels ~320000 states ~1280028 transitions
pnml2lts-mc( 0/ 4): ~80001 levels ~640000 states ~2400652 transitions
pnml2lts-mc( 0/ 4): ~160001 levels ~1280000 states ~4800652 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1062223
pnml2lts-mc( 0/ 4): unique states count: 2124448
pnml2lts-mc( 0/ 4): unique transitions count: 10633166
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 200015
pnml2lts-mc( 0/ 4): - claim found count: 200008
pnml2lts-mc( 0/ 4): - claim success count: 2124465
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1059332
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2124465 states 10633266 transitions, fanout: 5.005
pnml2lts-mc( 0/ 4): Total exploration time 107.620 sec (107.590 sec minimum, 107.602 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19740, Transitions per second: 98804
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 138.7MB, 14.9 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 138.7MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-c008-LTLCardinality-13
ltl formula formula --ltl=/tmp/1764/ltl_3_
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 816 places, 2110 transitions and 8566 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.210 real 0.090 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1764/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1764/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1764/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1764/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 818 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 817, there are 2113 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( 0/ 4): ~1838 levels ~10000 states ~40120 transitions
pnml2lts-mc( 0/ 4): ~3309 levels ~20000 states ~75584 transitions
pnml2lts-mc( 0/ 4): ~6044 levels ~40000 states ~145624 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~319976 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~639976 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~1279976 transitions
pnml2lts-mc( 2/ 4): ~106672 levels ~640000 states ~3199988 transitions
pnml2lts-mc( 2/ 4): ~213339 levels ~1280000 states ~6399988 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 158033
pnml2lts-mc( 0/ 4): unique states count: 1884312
pnml2lts-mc( 0/ 4): unique transitions count: 8181863
pnml2lts-mc( 0/ 4): - self-loop count: 158033
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 548430
pnml2lts-mc( 0/ 4): - claim success count: 1884318
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1507074
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1884318 states 8181881 transitions, fanout: 4.342
pnml2lts-mc( 0/ 4): Total exploration time 117.950 sec (117.920 sec minimum, 117.932 sec on average)
pnml2lts-mc( 0/ 4): States per second: 15976, Transitions per second: 69367
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 119.2MB, 17.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 119.2MB (~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-c008"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;