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.r180-tall-171640603100292.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 itstools
Input is FunctionPointer-PT-c008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100292
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716480959147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 16:16:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 16:16:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:16:00] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2024-05-23 16:16:00] [INFO ] Transformed 2826 places.
[2024-05-23 16:16:00] [INFO ] Transformed 8960 transitions.
[2024-05-23 16:16:00] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1198 places in 37 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 309 place count 1319 transition count 3796
Iterating global reduction 1 with 292 rules applied. Total rules applied 601 place count 1319 transition count 3796
Ensure Unique test removed 430 transitions
Reduce isomorphic transitions removed 430 transitions.
Iterating post reduction 1 with 430 rules applied. Total rules applied 1031 place count 1319 transition count 3366
Discarding 149 places :
Symmetric choice reduction at 2 with 149 rule applications. Total rules 1180 place count 1170 transition count 3068
Iterating global reduction 2 with 149 rules applied. Total rules applied 1329 place count 1170 transition count 3068
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 1425 place count 1170 transition count 2972
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1439 place count 1156 transition count 2944
Iterating global reduction 3 with 14 rules applied. Total rules applied 1453 place count 1156 transition count 2944
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1466 place count 1143 transition count 2918
Iterating global reduction 3 with 13 rules applied. Total rules applied 1479 place count 1143 transition count 2918
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1492 place count 1130 transition count 2892
Iterating global reduction 3 with 13 rules applied. Total rules applied 1505 place count 1130 transition count 2892
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1518 place count 1117 transition count 2866
Iterating global reduction 3 with 13 rules applied. Total rules applied 1531 place count 1117 transition count 2866
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1544 place count 1104 transition count 2840
Iterating global reduction 3 with 13 rules applied. Total rules applied 1557 place count 1104 transition count 2840
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1570 place count 1091 transition count 2814
Iterating global reduction 3 with 13 rules applied. Total rules applied 1583 place count 1091 transition count 2814
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1595 place count 1079 transition count 2790
Iterating global reduction 3 with 12 rules applied. Total rules applied 1607 place count 1079 transition count 2790
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1659 place count 1027 transition count 2592
Iterating global reduction 3 with 52 rules applied. Total rules applied 1711 place count 1027 transition count 2592
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1763 place count 975 transition count 2384
Iterating global reduction 3 with 52 rules applied. Total rules applied 1815 place count 975 transition count 2384
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1867 place count 923 transition count 2270
Iterating global reduction 3 with 52 rules applied. Total rules applied 1919 place count 923 transition count 2270
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1971 place count 871 transition count 2166
Iterating global reduction 3 with 52 rules applied. Total rules applied 2023 place count 871 transition count 2166
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2075 place count 819 transition count 2062
Iterating global reduction 3 with 52 rules applied. Total rules applied 2127 place count 819 transition count 2062
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2179 place count 767 transition count 1958
Iterating global reduction 3 with 52 rules applied. Total rules applied 2231 place count 767 transition count 1958
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2282 place count 716 transition count 1856
Iterating global reduction 3 with 51 rules applied. Total rules applied 2333 place count 716 transition count 1856
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2338 place count 711 transition count 1846
Iterating global reduction 3 with 5 rules applied. Total rules applied 2343 place count 711 transition count 1846
Applied a total of 2343 rules in 1187 ms. Remains 711 /1628 variables (removed 917) and now considering 1846/5962 (removed 4116) transitions.
[2024-05-23 16:16:02] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
// Phase 1: matrix 1235 rows 711 cols
[2024-05-23 16:16:02] [INFO ] Computed 2 invariants in 37 ms
[2024-05-23 16:16:03] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-05-23 16:16:03] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-23 16:16:03] [INFO ] Invariant cache hit.
[2024-05-23 16:16:03] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-23 16:16:04] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2462 ms to find 0 implicit places.
Running 1844 sub problems to find dead transitions.
[2024-05-23 16:16:04] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-23 16:16:04] [INFO ] Invariant cache hit.
[2024-05-23 16:16:04] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/711 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/711 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 711/1946 variables, and 2 constraints, problems are : Problem set: 0 solved, 1844 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/711 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 1844/1844 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1844 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/711 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/711 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/711 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 3 (OVERLAPS) 1235/1946 variables, 711/713 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1946 variables, 298/1011 constraints. Problems are: Problem set: 0 solved, 1844 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1946/1946 variables, and 2855 constraints, problems are : Problem set: 0 solved, 1844 unsolved in 32030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 711/711 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 1844/1844 constraints, Known Traps: 0/0 constraints]
After SMT, in 71329ms problems are : Problem set: 0 solved, 1844 unsolved
Search for dead transitions found 0 dead transitions in 71367ms
Starting structural reductions in LTL mode, iteration 1 : 711/1628 places, 1846/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75058 ms. Remains : 711/1628 places, 1846/5962 transitions.
Support contains 21 out of 711 places after structural reductions.
[2024-05-23 16:17:16] [INFO ] Flatten gal took : 148 ms
[2024-05-23 16:17:16] [INFO ] Flatten gal took : 104 ms
[2024-05-23 16:17:16] [INFO ] Input system was already deterministic with 1846 transitions.
RANDOM walk for 40002 steps (8 resets) in 2703 ms. (14 steps per ms) remains 14/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
[2024-05-23 16:17:17] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-23 16:17:17] [INFO ] Invariant cache hit.
[2024-05-23 16:17:17] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 823/1214 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 77/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1214 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 592/1806 variables, 210/679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1806 variables, 221/900 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1806 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1807 variables, 1/901 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1807 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1807 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 130/1937 variables, 102/1004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1937 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 8/1945 variables, 6/1010 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1945 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/1946 variables, 1/1011 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1946 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1946 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1946/1946 variables, and 1011 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 711/711 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 823/1214 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 77/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1214 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 592/1806 variables, 210/679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1806 variables, 221/900 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1806 variables, 8/908 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1806 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/1807 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1807 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 16:17:22] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 24 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1807 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1807 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 130/1937 variables, 102/1013 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1937 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 8/1945 variables, 6/1019 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1945 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 1/1946 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1946 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1946/1946 variables, and 1020 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 711/711 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 7476ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 704 transition count 1830
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 704 transition count 1830
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 704 transition count 1828
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 697 transition count 1810
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 697 transition count 1810
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 692 transition count 1794
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 692 transition count 1794
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 687 transition count 1780
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 687 transition count 1780
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 682 transition count 1770
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 682 transition count 1770
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 677 transition count 1760
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 677 transition count 1760
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 672 transition count 1750
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 672 transition count 1750
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 668 transition count 1740
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 668 transition count 1740
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 665 transition count 1732
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 665 transition count 1732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 664 transition count 1730
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 664 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 663 transition count 1728
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 663 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 662 transition count 1726
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 662 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 661 transition count 1724
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 661 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 660 transition count 1722
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 660 transition count 1722
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 118 place count 660 transition count 1708
Applied a total of 118 rules in 548 ms. Remains 660 /711 variables (removed 51) and now considering 1708/1846 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 660/711 places, 1708/1846 transitions.
RANDOM walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 255076 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :1 out of 8
Probabilistic random walk after 255076 steps, saw 165574 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :1
[2024-05-23 16:17:29] [INFO ] Flow matrix only has 1143 transitions (discarded 565 similar events)
// Phase 1: matrix 1143 rows 660 cols
[2024-05-23 16:17:29] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 16:17:29] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 382/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 804/1194 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1194 variables, 71/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1194 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 506/1700 variables, 181/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1700 variables, 209/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1700 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1701 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1701 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1701 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 99/1800 variables, 85/939 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1800 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 3/1803 variables, 3/942 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1803 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/1803 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1803/1803 variables, and 942 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 660/660 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 382/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 804/1194 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1194 variables, 71/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1194 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 506/1700 variables, 181/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1700 variables, 209/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1700 variables, 7/859 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1700 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/1701 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1701 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:17:32] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1701 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1701 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 99/1800 variables, 85/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1800 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/1803 variables, 3/950 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1803 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1803 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1803/1803 variables, and 950 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 660/660 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 5859ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 1708/1708 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 659 transition count 1706
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 659 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 658 transition count 1704
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 658 transition count 1704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 657 transition count 1700
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 657 transition count 1700
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 656 transition count 1698
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 656 transition count 1698
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 655 transition count 1696
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 655 transition count 1696
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 654 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 654 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 653 transition count 1692
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 653 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 652 transition count 1690
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 652 transition count 1690
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 651 transition count 1688
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 651 transition count 1688
Applied a total of 18 rules in 447 ms. Remains 651 /660 variables (removed 9) and now considering 1688/1708 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 651/660 places, 1688/1708 transitions.
RANDOM walk for 40010 steps (8 resets) in 324 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 225760 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 7
Probabilistic random walk after 225760 steps, saw 146549 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-23 16:17:39] [INFO ] Flow matrix only has 1129 transitions (discarded 559 similar events)
// Phase 1: matrix 1129 rows 651 cols
[2024-05-23 16:17:39] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 16:17:39] [INFO ] State equation strengthened by 277 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 382/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 801/1191 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 70/461 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 493/1684 variables, 176/637 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1684 variables, 207/844 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1684 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1685 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1685 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1685 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 93/1778 variables, 82/928 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1778 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 2/1780 variables, 2/930 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1780 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/1780 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1780/1780 variables, and 930 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 382/390 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 801/1191 variables, 390/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 70/461 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 493/1684 variables, 176/637 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1684 variables, 207/844 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1684 variables, 7/851 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1684 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/1685 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1685 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 16:17:42] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1685 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1685 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 93/1778 variables, 82/936 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1778 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/1780 variables, 2/938 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1780 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1780 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1780/1780 variables, and 938 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4420 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 6300ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 1025 ms.
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 1688/1688 transitions.
Applied a total of 0 rules in 86 ms. Remains 651 /651 variables (removed 0) and now considering 1688/1688 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 651/651 places, 1688/1688 transitions.
RANDOM walk for 40008 steps (8 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 223568 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 5
Probabilistic random walk after 223568 steps, saw 145127 distinct states, run finished after 3003 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-23 16:17:49] [INFO ] Flow matrix only has 1129 transitions (discarded 559 similar events)
[2024-05-23 16:17:49] [INFO ] Invariant cache hit.
[2024-05-23 16:17:49] [INFO ] State equation strengthened by 277 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 354/360 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1201/1561 variables, 497/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1561 variables, 277/780 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1561 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 62/1623 variables, 1/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1623 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1624 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1624 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1624 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 154/1778 variables, 145/928 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1778 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/1780 variables, 2/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1780 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1780 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1780/1780 variables, and 930 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 354/360 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1201/1561 variables, 497/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1561 variables, 277/780 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1561 variables, 5/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1561 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 62/1623 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1623 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/1624 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1624 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1624 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 154/1778 variables, 145/933 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 16:17:52] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1778 variables, 1/934 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1778 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/1780 variables, 2/936 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1780 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1780 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1780/1780 variables, and 936 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 4765ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 1626 ms.
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 1688/1688 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 649 transition count 1684
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 649 transition count 1684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 649 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 647 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 647 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 645 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 645 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 643 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 643 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 641 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 641 transition count 1662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 639 transition count 1658
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 639 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 637 transition count 1654
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 637 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 635 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 635 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 633 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 633 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 632 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 632 transition count 1644
Applied a total of 40 rules in 316 ms. Remains 632 /651 variables (removed 19) and now considering 1644/1688 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 632/651 places, 1644/1688 transitions.
RANDOM walk for 40020 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 333433 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 3
Probabilistic random walk after 333433 steps, saw 216429 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-23 16:17:59] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2024-05-23 16:17:59] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 16:17:59] [INFO ] State equation strengthened by 271 read => feed constraints.
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) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 62/1580 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1581 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 148/1729 variables, 141/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/1731 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 905 constraints, problems are : Problem set: 0 solved, 3 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 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) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 3/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1518 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1580 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1581 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 148/1729 variables, 141/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 16:18:01] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1729 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/1731 variables, 2/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1731 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1731 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 909 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3177ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 922 ms.
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 80 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 632/632 places, 1644/1644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 81 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2024-05-23 16:18:03] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 16:18:03] [INFO ] Invariant cache hit.
[2024-05-23 16:18:04] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-23 16:18:04] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 16:18:04] [INFO ] Invariant cache hit.
[2024-05-23 16:18:04] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 16:18:05] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
[2024-05-23 16:18:05] [INFO ] Redundant transitions in 92 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-23 16:18:05] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 16:18:06] [INFO ] Invariant cache hit.
[2024-05-23 16:18:06] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/632 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 3 (OVERLAPS) 1099/1731 variables, 632/634 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1731 variables, 271/905 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 2547 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 31537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
After SMT, in 69328ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 69344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71673 ms. Remains : 632/632 places, 1644/1644 transitions.
FORMULA FunctionPointer-PT-c008-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c008-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X(X(F(p0))))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 698 transition count 1818
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 698 transition count 1818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 698 transition count 1814
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 685 transition count 1784
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 685 transition count 1784
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 674 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 674 transition count 1746
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 663 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 663 transition count 1708
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 652 transition count 1684
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 652 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 641 transition count 1662
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 641 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 630 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 630 transition count 1640
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 620 transition count 1618
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 620 transition count 1618
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 611 transition count 1598
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 611 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 1 with 2 rules applied. Total rules applied 208 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 215 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 216 place count 605 transition count 1586
Applied a total of 216 rules in 251 ms. Remains 605 /711 variables (removed 106) and now considering 1586/1846 (removed 260) transitions.
[2024-05-23 16:19:15] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-23 16:19:15] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 16:19:16] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-23 16:19:16] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 16:19:16] [INFO ] Invariant cache hit.
[2024-05-23 16:19:16] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 16:19:17] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 16:19:17] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 16:19:17] [INFO ] Invariant cache hit.
[2024-05-23 16:19:17] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1663 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1663 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 2453 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 31492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
After SMT, in 68327ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 68342ms
Starting structural reductions in LTL mode, iteration 1 : 605/711 places, 1586/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70649 ms. Remains : 605/711 places, 1586/1846 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 567 ms.
Product exploration explored 100000 steps with 33333 reset in 494 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLFireability-00 finished in 72049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 698 transition count 1818
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 698 transition count 1818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 698 transition count 1814
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 685 transition count 1784
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 685 transition count 1784
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 674 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 674 transition count 1746
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 663 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 663 transition count 1708
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 652 transition count 1684
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 652 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 641 transition count 1662
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 641 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 630 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 630 transition count 1640
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 620 transition count 1618
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 620 transition count 1618
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 611 transition count 1598
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 611 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 1 with 2 rules applied. Total rules applied 208 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 215 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 216 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 1 with 2 rules applied. Total rules applied 218 place count 605 transition count 1584
Applied a total of 218 rules in 532 ms. Remains 605 /711 variables (removed 106) and now considering 1584/1846 (removed 262) transitions.
[2024-05-23 16:20:28] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 16:20:28] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 16:20:28] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-23 16:20:28] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:20:28] [INFO ] Invariant cache hit.
[2024-05-23 16:20:28] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 16:20:30] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
[2024-05-23 16:20:30] [INFO ] Redundant transitions in 86 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 16:20:30] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:20:30] [INFO ] Invariant cache hit.
[2024-05-23 16:20:30] [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 30035 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 31395 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 68467ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68483ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/711 places, 1584/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71334 ms. Remains : 605/711 places, 1584/1846 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 509 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-01 finished in 71919 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(F(p0)))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Applied a total of 198 rules in 234 ms. Remains 614 /711 variables (removed 97) and now considering 1608/1846 (removed 238) transitions.
[2024-05-23 16:21:39] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 16:21:39] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 16:21:40] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-23 16:21:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 16:21:40] [INFO ] Invariant cache hit.
[2024-05-23 16:21:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:21:41] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 16:21:41] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 16:21:41] [INFO ] Invariant cache hit.
[2024-05-23 16:21:41] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68284ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68303ms
Starting structural reductions in LTL mode, iteration 1 : 614/711 places, 1608/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70583 ms. Remains : 614/711 places, 1608/1846 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 422 ms.
Stack based approach found an accepted trace after 89 steps with 0 reset with depth 90 and stack size 90 in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-05 finished in 71114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p1))&&p0)))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1790
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1790
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1756
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 179 place count 619 transition count 1618
Iterating global reduction 1 with 9 rules applied. Total rules applied 188 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 617 transition count 1614
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 613 transition count 1606
Applied a total of 200 rules in 210 ms. Remains 613 /711 variables (removed 98) and now considering 1606/1846 (removed 240) transitions.
[2024-05-23 16:22:50] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 16:22:50] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 16:22:51] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-23 16:22:51] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 16:22:51] [INFO ] Invariant cache hit.
[2024-05-23 16:22:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:22:52] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 16:22:52] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 16:22:52] [INFO ] Invariant cache hit.
[2024-05-23 16:22:52] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31425 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 68772ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68789ms
Starting structural reductions in LTL mode, iteration 1 : 613/711 places, 1606/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70744 ms. Remains : 613/711 places, 1606/1846 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 383 ms.
Stack based approach found an accepted trace after 776 steps with 0 reset with depth 777 and stack size 777 in 3 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-07 finished in 71326 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(p1))||p0))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 614 transition count 1604
Applied a total of 202 rules in 373 ms. Remains 614 /711 variables (removed 97) and now considering 1604/1846 (removed 242) transitions.
[2024-05-23 16:24:02] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 16:24:02] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 16:24:02] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-23 16:24:02] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:24:02] [INFO ] Invariant cache hit.
[2024-05-23 16:24:02] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:24:04] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
[2024-05-23 16:24:04] [INFO ] Redundant transitions in 30 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:24:04] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:24:04] [INFO ] Invariant cache hit.
[2024-05-23 16:24:04] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68570ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68583ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/711 places, 1604/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70964 ms. Remains : 614/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 391 ms.
Product exploration explored 100000 steps with 0 reset in 481 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 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 154 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 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/4 properties
[2024-05-23 16:25:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:25:14] [INFO ] Invariant cache hit.
[2024-05-23 16:25:14] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 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) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/1677 variables, 72/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 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) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:25:15] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 78/1677 variables, 72/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2430ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 285 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 76 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 614/614 places, 1604/1604 transitions.
RANDOM walk for 40007 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 333368 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 333368 steps, saw 216388 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-23 16:25:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:25:20] [INFO ] Invariant cache hit.
[2024-05-23 16:25:20] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 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) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/1677 variables, 72/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 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) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:25:21] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 78/1677 variables, 72/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2499ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 237 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 72 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 16:25:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:25:23] [INFO ] Invariant cache hit.
[2024-05-23 16:25:23] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-23 16:25:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:25:23] [INFO ] Invariant cache hit.
[2024-05-23 16:25:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:25:25] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
[2024-05-23 16:25:25] [INFO ] Redundant transitions in 28 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:25:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:25:25] [INFO ] Invariant cache hit.
[2024-05-23 16:25:25] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31680 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69431ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69451ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71397 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 9 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 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 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
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 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
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 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
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 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 104 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-23 16:26:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 16:26:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 16:26:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:26:34] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 16:26:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 16:26:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:26:34] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 16:26:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:26:34] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 16:26:34] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 16:26:34] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 223 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 136 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 92 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 16:26:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 16:26:35] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 16:26:35] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 16:26:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:26:35] [INFO ] Invariant cache hit.
[2024-05-23 16:26:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:26:37] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2024-05-23 16:26:37] [INFO ] Redundant transitions in 30 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:26:37] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:26:37] [INFO ] Invariant cache hit.
[2024-05-23 16:26:37] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31473 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69199ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69213ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71372 ms. Remains : 614/614 places, 1604/1604 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 (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 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 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40001 steps (8 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/4 properties
[2024-05-23 16:27:46] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:27:46] [INFO ] Invariant cache hit.
[2024-05-23 16:27:46] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 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) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/1677 variables, 72/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 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) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:27:48] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 78/1677 variables, 72/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2306ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 342 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 71 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 614/614 places, 1604/1604 transitions.
RANDOM walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 301369 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 301369 steps, saw 195620 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-23 16:27:52] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:27:52] [INFO ] Invariant cache hit.
[2024-05-23 16:27:52] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 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) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/1677 variables, 72/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 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) 853/1240 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1240 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1240 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/1599 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 2/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:27:54] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 78/1677 variables, 72/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2378ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 335 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 74 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 16:27:55] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:27:55] [INFO ] Invariant cache hit.
[2024-05-23 16:27:55] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-23 16:27:55] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:27:55] [INFO ] Invariant cache hit.
[2024-05-23 16:27:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:27:57] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2024-05-23 16:27:57] [INFO ] Redundant transitions in 26 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:27:57] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:27:57] [INFO ] Invariant cache hit.
[2024-05-23 16:27:57] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69106ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71237 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 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 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
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 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
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 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 34 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-23 16:29:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 16:29:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 16:29:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:29:06] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 16:29:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 16:29:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:29:06] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 16:29:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:29:06] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 16:29:06] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 16:29:06] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 140 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 156 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 439 ms.
Product exploration explored 100000 steps with 0 reset in 477 ms.
Built C files in :
/tmp/ltsmin8395556925737071798
[2024-05-23 16:29:08] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:29:08] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8395556925737071798
Running compilation step : cd /tmp/ltsmin8395556925737071798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8395556925737071798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8395556925737071798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 88 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 16:29:11] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 16:29:11] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 16:29:11] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-23 16:29:11] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:29:11] [INFO ] Invariant cache hit.
[2024-05-23 16:29:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:29:13] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
[2024-05-23 16:29:13] [INFO ] Redundant transitions in 26 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:29:13] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:29:13] [INFO ] Invariant cache hit.
[2024-05-23 16:29:13] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31467 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 70479ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 70496ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72848 ms. Remains : 614/614 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin3467542603829442656
[2024-05-23 16:30:24] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:30:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3467542603829442656
Running compilation step : cd /tmp/ltsmin3467542603829442656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3467542603829442656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3467542603829442656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 16:30:27] [INFO ] Flatten gal took : 58 ms
[2024-05-23 16:30:27] [INFO ] Flatten gal took : 56 ms
[2024-05-23 16:30:27] [INFO ] Time to serialize gal into /tmp/LTL7038193155934391370.gal : 16 ms
[2024-05-23 16:30:27] [INFO ] Time to serialize properties into /tmp/LTL5764432883407182160.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7038193155934391370.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10694027336758355653.hoa' '-atoms' '/tmp/LTL5764432883407182160.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5764432883407182160.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10694027336758355653.hoa
Detected timeout of ITS tools.
[2024-05-23 16:30:42] [INFO ] Flatten gal took : 49 ms
[2024-05-23 16:30:42] [INFO ] Flatten gal took : 48 ms
[2024-05-23 16:30:42] [INFO ] Time to serialize gal into /tmp/LTL7149873449851636443.gal : 10 ms
[2024-05-23 16:30:42] [INFO ] Time to serialize properties into /tmp/LTL1832244186065282960.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7149873449851636443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1832244186065282960.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2083<1))")||(X(F("((s1>=1)&&(l976>=1))")))))))
Formula 0 simplified : G(F!"((s0<1)||(l2083<1))" & FG!"((s1>=1)&&(l976>=1))")
Detected timeout of ITS tools.
[2024-05-23 16:30:57] [INFO ] Flatten gal took : 59 ms
[2024-05-23 16:30:57] [INFO ] Applying decomposition
[2024-05-23 16:30:57] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4050680456901369955.txt' '-o' '/tmp/graph4050680456901369955.bin' '-w' '/tmp/graph4050680456901369955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4050680456901369955.bin' '-l' '-1' '-v' '-w' '/tmp/graph4050680456901369955.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:30:57] [INFO ] Decomposing Gal with order
[2024-05-23 16:30:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:30:58] [INFO ] Removed a total of 2667 redundant transitions.
[2024-05-23 16:30:58] [INFO ] Flatten gal took : 156 ms
[2024-05-23 16:30:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1166 labels/synchronizations in 85 ms.
[2024-05-23 16:30:58] [INFO ] Time to serialize gal into /tmp/LTL3737273756093429529.gal : 14 ms
[2024-05-23 16:30:58] [INFO ] Time to serialize properties into /tmp/LTL11047569477798982215.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3737273756093429529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11047569477798982215.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.u0.s0<1)||(i27.i4.u147.l2083<1))")||(X(F("((i20.i0.u1.s1>=1)&&(i0.u115.l976>=1))")))))))
Formula 0 simplified : G(F!"((i0.u0.s0<1)||(i27.i4.u147.l2083<1))" & FG!"((i20.i0.u1.s1>=1)&&(i0.u115.l976>=1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLFireability-09 finished in 431475 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 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 614 transition count 1604
Applied a total of 202 rules in 394 ms. Remains 614 /711 variables (removed 97) and now considering 1604/1846 (removed 242) transitions.
[2024-05-23 16:31:13] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 16:31:13] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 16:31:14] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-23 16:31:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:31:14] [INFO ] Invariant cache hit.
[2024-05-23 16:31:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:31:15] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2024-05-23 16:31:15] [INFO ] Redundant transitions in 30 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:31:15] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:31:15] [INFO ] Invariant cache hit.
[2024-05-23 16:31:15] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(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 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 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 timeout
0.0)
(s563 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69363ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/711 places, 1604/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71822 ms. Remains : 614/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 427 ms.
Stack based approach found an accepted trace after 542 steps with 0 reset with depth 543 and stack size 543 in 2 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-10 finished in 72358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(p1))))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 700 transition count 1822
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 700 transition count 1822
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 689 transition count 1796
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 689 transition count 1796
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 679 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 679 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 669 transition count 1726
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 669 transition count 1726
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 659 transition count 1706
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 659 transition count 1706
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 114 place count 649 transition count 1686
Iterating global reduction 0 with 10 rules applied. Total rules applied 124 place count 649 transition count 1686
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 134 place count 639 transition count 1666
Iterating global reduction 0 with 10 rules applied. Total rules applied 144 place count 639 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 153 place count 630 transition count 1646
Iterating global reduction 0 with 9 rules applied. Total rules applied 162 place count 630 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 170 place count 622 transition count 1628
Iterating global reduction 0 with 8 rules applied. Total rules applied 178 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 621 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 181 place count 620 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 620 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 183 place count 619 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 184 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 618 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 618 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 187 place count 617 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 188 place count 617 transition count 1618
Applied a total of 188 rules in 228 ms. Remains 617 /711 variables (removed 94) and now considering 1618/1846 (removed 228) transitions.
[2024-05-23 16:32:26] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 617 cols
[2024-05-23 16:32:26] [INFO ] Computed 2 invariants in 19 ms
[2024-05-23 16:32:26] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-23 16:32:26] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:32:26] [INFO ] Invariant cache hit.
[2024-05-23 16:32:26] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:32:28] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-23 16:32:28] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:32:28] [INFO ] Invariant cache hit.
[2024-05-23 16:32:28] [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, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 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 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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30025 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: 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/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1697 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1697 variables, 267/886 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31525 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: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 68961ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 68976ms
Starting structural reductions in LTL mode, iteration 1 : 617/711 places, 1618/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71236 ms. Remains : 617/711 places, 1618/1846 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 465 ms.
Product exploration explored 100000 steps with 25000 reset in 461 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40005 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 542922 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 542922 steps, saw 352620 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-23 16:33:41] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:33:41] [INFO ] Invariant cache hit.
[2024-05-23 16:33:41] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 271/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1348 variables, 406/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1348 variables, 203/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1348 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1410 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1410 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1411 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1411 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 269/1680 variables, 199/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1680 variables, 64/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1692 variables, 5/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1692 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1697 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1697 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/1697 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1697/1697 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 586 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: 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) 271/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1348 variables, 406/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1348 variables, 203/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1348 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1348 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1410 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1410 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1411 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1411 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 269/1680 variables, 199/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 64/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1680 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1692 variables, 5/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1692 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1697 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 923 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1526ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Graph (complete) has 2693 edges and 617 vertex of which 425 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 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 425 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 424 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 424 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 389 place count 424 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 423 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 423 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 422 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 422 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 421 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 421 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 396 place count 420 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 420 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 398 place count 419 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 419 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 400 place count 418 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 401 place count 418 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 402 place count 417 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 417 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 416 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 416 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 415 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 415 transition count 1208
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 409 place count 415 transition count 1206
Applied a total of 409 rules in 184 ms. Remains 415 /617 variables (removed 202) and now considering 1206/1618 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 415/617 places, 1206/1618 transitions.
RANDOM walk for 36770 steps (8 resets) in 144 ms. (253 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 617 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Applied a total of 0 rules in 13 ms. Remains 617 /617 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2024-05-23 16:33:43] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:33:43] [INFO ] Invariant cache hit.
[2024-05-23 16:33:44] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-23 16:33:44] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:33:44] [INFO ] Invariant cache hit.
[2024-05-23 16:33:44] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:33:45] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-23 16:33:45] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:33:45] [INFO ] Invariant cache hit.
[2024-05-23 16:33:45] [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, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30032 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: 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/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1697 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1697 variables, 267/886 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31637 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: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 69467ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69483ms
Finished structural reductions in LTL mode , in 1 iterations and 71437 ms. Remains : 617/617 places, 1618/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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40006 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 528692 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 528692 steps, saw 343382 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-23 16:34:58] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:34:58] [INFO ] Invariant cache hit.
[2024-05-23 16:34:58] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 271/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1348 variables, 406/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1348 variables, 203/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1348 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1410 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1410 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1411 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1411 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 269/1680 variables, 199/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1680 variables, 64/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1692 variables, 5/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1692 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1697 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1697 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/1697 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1697/1697 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 611 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: 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) 271/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1348 variables, 406/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1348 variables, 203/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1348 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1348 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1410 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1410 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1411 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1411 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 269/1680 variables, 199/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 64/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1680 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1692 variables, 5/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1692 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1697 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 964 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Graph (complete) has 2693 edges and 617 vertex of which 425 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 425 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 424 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 424 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 389 place count 424 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 423 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 423 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 422 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 422 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 421 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 421 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 396 place count 420 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 420 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 398 place count 419 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 419 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 400 place count 418 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 401 place count 418 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 402 place count 417 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 417 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 416 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 416 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 415 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 415 transition count 1208
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 409 place count 415 transition count 1206
Applied a total of 409 rules in 198 ms. Remains 415 /617 variables (removed 202) and now considering 1206/1618 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 415/617 places, 1206/1618 transitions.
RANDOM walk for 36765 steps (8 resets) in 134 ms. (272 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 463 ms.
Product exploration explored 100000 steps with 25000 reset in 467 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 616 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 616 transition count 1616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 615 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 614 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 614 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 612 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 610 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 609 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 607 transition count 1592
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 607 transition count 1590
Applied a total of 24 rules in 514 ms. Remains 607 /617 variables (removed 10) and now considering 1590/1618 (removed 28) transitions.
[2024-05-23 16:35:03] [INFO ] Redundant transitions in 26 ms returned []
Running 1588 sub problems to find dead transitions.
[2024-05-23 16:35:03] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2024-05-23 16:35:03] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 16:35:03] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1669 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 3 (OVERLAPS) 1062/1669 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1669 variables, 264/873 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1669/1669 variables, and 2461 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 31431 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints]
After SMT, in 70097ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 70114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 607/617 places, 1590/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70669 ms. Remains : 607/617 places, 1590/1618 transitions.
Built C files in :
/tmp/ltsmin11457187395124643320
[2024-05-23 16:36:13] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11457187395124643320
Running compilation step : cd /tmp/ltsmin11457187395124643320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11457187395124643320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11457187395124643320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 616 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 616 transition count 1616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 615 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 614 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 614 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 612 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 610 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 609 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 607 transition count 1592
Applied a total of 22 rules in 177 ms. Remains 607 /617 variables (removed 10) and now considering 1592/1618 (removed 26) transitions.
[2024-05-23 16:36:16] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-23 16:36:16] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 16:36:16] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-23 16:36:16] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 16:36:16] [INFO ] Invariant cache hit.
[2024-05-23 16:36:17] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 16:36:18] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-23 16:36:18] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 16:36:18] [INFO ] Invariant cache hit.
[2024-05-23 16:36:18] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1670 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1670 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1670 variables, 264/873 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1670/1670 variables, and 2463 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 31644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 69262ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 69277ms
Starting structural reductions in LTL mode, iteration 1 : 607/617 places, 1592/1618 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71539 ms. Remains : 607/617 places, 1592/1618 transitions.
Built C files in :
/tmp/ltsmin11793267919090420823
[2024-05-23 16:37:27] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11793267919090420823
Running compilation step : cd /tmp/ltsmin11793267919090420823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11793267919090420823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11793267919090420823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 16:37:30] [INFO ] Flatten gal took : 40 ms
[2024-05-23 16:37:30] [INFO ] Flatten gal took : 40 ms
[2024-05-23 16:37:30] [INFO ] Time to serialize gal into /tmp/LTL18151332920595337048.gal : 9 ms
[2024-05-23 16:37:30] [INFO ] Time to serialize properties into /tmp/LTL16748010248494277976.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18151332920595337048.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17516514331088237423.hoa' '-atoms' '/tmp/LTL16748010248494277976.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16748010248494277976.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17516514331088237423.hoa
Detected timeout of ITS tools.
[2024-05-23 16:37:46] [INFO ] Flatten gal took : 36 ms
[2024-05-23 16:37:46] [INFO ] Flatten gal took : 38 ms
[2024-05-23 16:37:46] [INFO ] Time to serialize gal into /tmp/LTL7445101015242236577.gal : 7 ms
[2024-05-23 16:37:46] [INFO ] Time to serialize properties into /tmp/LTL8211214501332541836.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7445101015242236577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8211214501332541836.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((s0>=1)&&(p1679>=1))"))||(X(F("((s1<1)||(p1109<1))")))))))
Formula 0 simplified : XX(F!"((s0>=1)&&(p1679>=1))" & XG!"((s1<1)||(p1109<1))")
Detected timeout of ITS tools.
[2024-05-23 16:38:01] [INFO ] Flatten gal took : 33 ms
[2024-05-23 16:38:01] [INFO ] Applying decomposition
[2024-05-23 16:38:01] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16136806347711742204.txt' '-o' '/tmp/graph16136806347711742204.bin' '-w' '/tmp/graph16136806347711742204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16136806347711742204.bin' '-l' '-1' '-v' '-w' '/tmp/graph16136806347711742204.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:38:01] [INFO ] Decomposing Gal with order
[2024-05-23 16:38:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:38:01] [INFO ] Removed a total of 2686 redundant transitions.
[2024-05-23 16:38:01] [INFO ] Flatten gal took : 72 ms
[2024-05-23 16:38:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1131 labels/synchronizations in 58 ms.
[2024-05-23 16:38:01] [INFO ] Time to serialize gal into /tmp/LTL18174818628203362279.gal : 8 ms
[2024-05-23 16:38:01] [INFO ] Time to serialize properties into /tmp/LTL3741566669507923008.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18174818628203362279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3741566669507923008.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((i1.u1.s0>=1)&&(i25.i0.u140.p1679>=1))"))||(X(F("((i6.u0.s1<1)||(i1.u134.p1109<1))")))))))
Formula 0 simplified : XX(F!"((i1.u1.s0>=1)&&(i25.i0.u140.p1679>=1))" & XG!"((i6.u0.s1<1)||(i1.u134.p1109<1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLFireability-11 finished in 350748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)||G(F(p2))||G(p0))))'
Support contains 5 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 701 transition count 1824
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 701 transition count 1824
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 701 transition count 1820
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 691 transition count 1796
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 691 transition count 1796
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 683 transition count 1770
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 683 transition count 1770
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 675 transition count 1744
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 675 transition count 1744
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 84 place count 667 transition count 1726
Iterating global reduction 1 with 8 rules applied. Total rules applied 92 place count 667 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 659 transition count 1710
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 659 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 651 transition count 1694
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 651 transition count 1694
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 644 transition count 1678
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 644 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 144 place count 638 transition count 1664
Iterating global reduction 1 with 6 rules applied. Total rules applied 150 place count 638 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 636 transition count 1660
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 636 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 635 transition count 1658
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 635 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 634 transition count 1656
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 634 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 633 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 632 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 632 transition count 1652
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 632 transition count 1644
Applied a total of 170 rules in 418 ms. Remains 632 /711 variables (removed 79) and now considering 1644/1846 (removed 202) transitions.
[2024-05-23 16:38:16] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2024-05-23 16:38:16] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 16:38:17] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-23 16:38:17] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 16:38:17] [INFO ] Invariant cache hit.
[2024-05-23 16:38:17] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 16:38:19] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2196 ms to find 0 implicit places.
[2024-05-23 16:38:19] [INFO ] Redundant transitions in 34 ms returned []
Running 1642 sub problems to find dead transitions.
[2024-05-23 16:38:19] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-23 16:38:19] [INFO ] Invariant cache hit.
[2024-05-23 16:38:19] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/632 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 3 (OVERLAPS) 1099/1731 variables, 632/634 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1731 variables, 271/905 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 2547 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 31509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
After SMT, in 69154ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 69168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 632/711 places, 1644/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71829 ms. Remains : 632/711 places, 1644/1846 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 396 ms.
Stack based approach found an accepted trace after 408 steps with 0 reset with depth 409 and stack size 409 in 2 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-12 finished in 72420 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||G(p1)))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 700 transition count 1822
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 700 transition count 1822
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 700 transition count 1818
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 689 transition count 1792
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 689 transition count 1792
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 680 transition count 1760
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 680 transition count 1760
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 75 place count 671 transition count 1728
Iterating global reduction 1 with 9 rules applied. Total rules applied 84 place count 671 transition count 1728
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 93 place count 662 transition count 1708
Iterating global reduction 1 with 9 rules applied. Total rules applied 102 place count 662 transition count 1708
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 111 place count 653 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 120 place count 653 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 129 place count 644 transition count 1672
Iterating global reduction 1 with 9 rules applied. Total rules applied 138 place count 644 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 146 place count 636 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 154 place count 636 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 161 place count 629 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 168 place count 629 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 628 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 628 transition count 1640
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 176 place count 628 transition count 1634
Applied a total of 176 rules in 314 ms. Remains 628 /711 variables (removed 83) and now considering 1634/1846 (removed 212) transitions.
[2024-05-23 16:39:29] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-23 16:39:29] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 16:39:29] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-23 16:39:29] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:39:29] [INFO ] Invariant cache hit.
[2024-05-23 16:39:29] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 16:39:31] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2024-05-23 16:39:31] [INFO ] Redundant transitions in 26 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 16:39:31] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:39:31] [INFO ] Invariant cache hit.
[2024-05-23 16:39:31] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 69489ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 69502ms
Starting structural reductions in SI_LTL mode, iteration 1 : 628/711 places, 1634/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71761 ms. Remains : 628/711 places, 1634/1846 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 464 ms.
Product exploration explored 100000 steps with 0 reset in 519 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)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 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))]
RANDOM walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2024-05-23 16:40:42] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:40:42] [INFO ] Invariant cache hit.
[2024-05-23 16:40:42] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 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) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:40:43] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1560 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/1704 variables, 137/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/1713 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1713 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1719 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 902 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2435ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 76 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 628/628 places, 1634/1634 transitions.
RANDOM walk for 40017 steps (8 resets) in 338 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 292285 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 292285 steps, saw 189725 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-23 16:40:48] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:40:48] [INFO ] Invariant cache hit.
[2024-05-23 16:40:48] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 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) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:40:49] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1560 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/1704 variables, 137/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/1713 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1713 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1719 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 902 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2507ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 191 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 103 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 75 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-23 16:40:50] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:40:50] [INFO ] Invariant cache hit.
[2024-05-23 16:40:51] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-23 16:40:51] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:40:51] [INFO ] Invariant cache hit.
[2024-05-23 16:40:51] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 16:40:52] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 1983 ms to find 0 implicit places.
[2024-05-23 16:40:52] [INFO ] Redundant transitions in 33 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 16:40:52] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:40:52] [INFO ] Invariant cache hit.
[2024-05-23 16:40:52] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31456 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 70005ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 70025ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72125 ms. Remains : 628/628 places, 1634/1634 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 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 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
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 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
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 1137 place count 27 transition count 46
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 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 28 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 24 cols
[2024-05-23 16:42:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 16:42:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 16:42:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:42:03] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 16:42:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 16:42:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:42:03] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 16:42:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:42:03] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 16:42:03] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 16:42:03] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 146 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 136 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 92 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-23 16:42:03] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-23 16:42:03] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 16:42:03] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-23 16:42:03] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:42:03] [INFO ] Invariant cache hit.
[2024-05-23 16:42:04] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 16:42:05] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2024-05-23 16:42:05] [INFO ] Redundant transitions in 34 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 16:42:05] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:42:05] [INFO ] Invariant cache hit.
[2024-05-23 16:42:05] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 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 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 69160ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 69173ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71293 ms. Remains : 628/628 places, 1634/1634 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40014 steps (8 resets) in 544 ms. (73 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2024-05-23 16:43:15] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:43:15] [INFO ] Invariant cache hit.
[2024-05-23 16:43:15] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 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) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:43:16] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1560 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/1704 variables, 137/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/1713 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1713 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1719 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 902 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1812 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2508ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 73 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 628/628 places, 1634/1634 transitions.
RANDOM walk for 40007 steps (8 resets) in 434 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 314433 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 314433 steps, saw 204100 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-23 16:43:21] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:43:21] [INFO ] Invariant cache hit.
[2024-05-23 16:43:21] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 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) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:43:22] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1560 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/1704 variables, 137/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/1713 variables, 5/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1713 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/1719 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 902 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1830 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2490ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 74 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 79 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-23 16:43:23] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:43:23] [INFO ] Invariant cache hit.
[2024-05-23 16:43:24] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-23 16:43:24] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:43:24] [INFO ] Invariant cache hit.
[2024-05-23 16:43:24] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 16:43:25] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2024-05-23 16:43:25] [INFO ] Redundant transitions in 29 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 16:43:25] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:43:25] [INFO ] Invariant cache hit.
[2024-05-23 16:43:25] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 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 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 69227ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 69241ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71303 ms. Remains : 628/628 places, 1634/1634 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 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 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
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 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
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 1137 place count 27 transition count 46
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 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 29 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 24 cols
[2024-05-23 16:44:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 16:44:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 16:44:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:44:35] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 16:44:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 16:44:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:44:35] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 16:44:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:44:35] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 16:44:35] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 16:44:35] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 138 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 180 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 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 515 ms.
Product exploration explored 100000 steps with 0 reset in 550 ms.
Built C files in :
/tmp/ltsmin18404062277387492069
[2024-05-23 16:44:36] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:44:36] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18404062277387492069
Running compilation step : cd /tmp/ltsmin18404062277387492069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18404062277387492069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18404062277387492069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 85 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-23 16:44:39] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-23 16:44:39] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 16:44:40] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 16:44:40] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:44:40] [INFO ] Invariant cache hit.
[2024-05-23 16:44:40] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 16:44:41] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2024-05-23 16:44:41] [INFO ] Redundant transitions in 28 ms returned []
Running 1632 sub problems to find dead transitions.
[2024-05-23 16:44:41] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-23 16:44:41] [INFO ] Invariant cache hit.
[2024-05-23 16:44:41] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 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 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 3 (OVERLAPS) 1091/1719 variables, 628/630 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 269/899 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 31463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints]
After SMT, in 69098ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 69112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71149 ms. Remains : 628/628 places, 1634/1634 transitions.
Built C files in :
/tmp/ltsmin5639833989953895175
[2024-05-23 16:45:51] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:45:51] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5639833989953895175
Running compilation step : cd /tmp/ltsmin5639833989953895175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5639833989953895175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5639833989953895175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 16:45:54] [INFO ] Flatten gal took : 35 ms
[2024-05-23 16:45:54] [INFO ] Flatten gal took : 33 ms
[2024-05-23 16:45:54] [INFO ] Time to serialize gal into /tmp/LTL9242711522806605059.gal : 6 ms
[2024-05-23 16:45:54] [INFO ] Time to serialize properties into /tmp/LTL8196652942337187473.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9242711522806605059.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7349821033453280283.hoa' '-atoms' '/tmp/LTL8196652942337187473.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8196652942337187473.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7349821033453280283.hoa
Detected timeout of ITS tools.
[2024-05-23 16:46:09] [INFO ] Flatten gal took : 34 ms
[2024-05-23 16:46:09] [INFO ] Flatten gal took : 35 ms
[2024-05-23 16:46:09] [INFO ] Time to serialize gal into /tmp/LTL12900632879762328059.gal : 7 ms
[2024-05-23 16:46:09] [INFO ] Time to serialize properties into /tmp/LTL8609107513911859039.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12900632879762328059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8609107513911859039.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((s0<1)||(l2079<1))"))||("((s1>=1)&&(l1979>=1))")))))
Formula 0 simplified : G(F!"((s0<1)||(l2079<1))" & FG!"((s1>=1)&&(l1979>=1))")
Detected timeout of ITS tools.
[2024-05-23 16:46:24] [INFO ] Flatten gal took : 33 ms
[2024-05-23 16:46:24] [INFO ] Applying decomposition
[2024-05-23 16:46:24] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10162757041583664532.txt' '-o' '/tmp/graph10162757041583664532.bin' '-w' '/tmp/graph10162757041583664532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10162757041583664532.bin' '-l' '-1' '-v' '-w' '/tmp/graph10162757041583664532.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:46:24] [INFO ] Decomposing Gal with order
[2024-05-23 16:46:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:46:24] [INFO ] Removed a total of 2724 redundant transitions.
[2024-05-23 16:46:24] [INFO ] Flatten gal took : 76 ms
[2024-05-23 16:46:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1087 labels/synchronizations in 37 ms.
[2024-05-23 16:46:24] [INFO ] Time to serialize gal into /tmp/LTL11284454303450782546.gal : 8 ms
[2024-05-23 16:46:24] [INFO ] Time to serialize properties into /tmp/LTL15523000327996787204.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11284454303450782546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15523000327996787204.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i20.u0.s0<1)||(i23.i0.u155.l2079<1))"))||("((i24.u1.s1>=1)&&(i23.i4.u154.l1979>=1))")))))
Formula 0 simplified : G(F!"((i20.u0.s0<1)||(i23.i0.u155.l2079<1))" & FG!"((i24.u1.s1>=1)&&(i23.i4.u154.l1979>=1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLFireability-13 finished in 430793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1822
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1822
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1818
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1792
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1756
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 162 place count 627 transition count 1636
Iterating global reduction 1 with 10 rules applied. Total rules applied 172 place count 627 transition count 1636
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 618 transition count 1616
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 192 place count 616 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 612 transition count 1604
Applied a total of 202 rules in 223 ms. Remains 612 /711 variables (removed 99) and now considering 1604/1846 (removed 242) transitions.
[2024-05-23 16:46:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-23 16:46:39] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 16:46:40] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-23 16:46:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:46:40] [INFO ] Invariant cache hit.
[2024-05-23 16:46:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:46:41] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:46:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:46:41] [INFO ] Invariant cache hit.
[2024-05-23 16:46:41] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68909ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68922ms
Starting structural reductions in LTL mode, iteration 1 : 612/711 places, 1604/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71044 ms. Remains : 612/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 442 ms.
Product exploration explored 100000 steps with 1 reset in 481 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30129 steps (6 resets) in 124 ms. (241 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 14 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 16:47:52] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:47:52] [INFO ] Invariant cache hit.
[2024-05-23 16:47:52] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-23 16:47:52] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:47:52] [INFO ] Invariant cache hit.
[2024-05-23 16:47:53] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:47:54] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:47:54] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:47:54] [INFO ] Invariant cache hit.
[2024-05-23 16:47:54] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31279 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68972ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68985ms
Finished structural reductions in LTL mode , in 1 iterations and 70940 ms. Remains : 612/612 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40001 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527845 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527845 steps, saw 342605 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-23 16:49:06] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:49:06] [INFO ] Invariant cache hit.
[2024-05-23 16:49:06] [INFO ] State equation strengthened by 265 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) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 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) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/1677 variables, 71/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:49:07] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1683 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1683 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1683 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1513ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5159 steps, including 80 resets, run visited all 1 properties in 18 ms. (steps per millisecond=286 )
Parikh walk visited 1 properties in 22 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 410 ms.
Product exploration explored 100000 steps with 0 reset in 544 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1602
Applied a total of 2 rules in 156 ms. Remains 612 /612 variables (removed 0) and now considering 1602/1604 (removed 2) transitions.
[2024-05-23 16:49:10] [INFO ] Redundant transitions in 27 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-23 16:49:10] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2024-05-23 16:49:10] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 16:49:10] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1682 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1682/1682 variables, and 2479 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 31440 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
After SMT, in 68965ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68984ms
Starting structural reductions in SI_LTL mode, iteration 1 : 612/612 places, 1602/1604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69180 ms. Remains : 612/612 places, 1602/1604 transitions.
Built C files in :
/tmp/ltsmin5988992103309134877
[2024-05-23 16:50:19] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5988992103309134877
Running compilation step : cd /tmp/ltsmin5988992103309134877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5988992103309134877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5988992103309134877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 12 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 16:50:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-23 16:50:22] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 16:50:22] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-23 16:50:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:50:22] [INFO ] Invariant cache hit.
[2024-05-23 16:50:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:50:24] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:50:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:50:24] [INFO ] Invariant cache hit.
[2024-05-23 16:50:24] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68863ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68878ms
Finished structural reductions in LTL mode , in 1 iterations and 70803 ms. Remains : 612/612 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin13521144240133670202
[2024-05-23 16:51:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13521144240133670202
Running compilation step : cd /tmp/ltsmin13521144240133670202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13521144240133670202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13521144240133670202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 16:51:36] [INFO ] Flatten gal took : 31 ms
[2024-05-23 16:51:36] [INFO ] Flatten gal took : 31 ms
[2024-05-23 16:51:36] [INFO ] Time to serialize gal into /tmp/LTL17678188048845729316.gal : 5 ms
[2024-05-23 16:51:36] [INFO ] Time to serialize properties into /tmp/LTL12645471061430363011.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17678188048845729316.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11463861585372752558.hoa' '-atoms' '/tmp/LTL12645471061430363011.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12645471061430363011.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11463861585372752558.hoa
Detected timeout of ITS tools.
[2024-05-23 16:51:51] [INFO ] Flatten gal took : 32 ms
[2024-05-23 16:51:51] [INFO ] Flatten gal took : 34 ms
[2024-05-23 16:51:51] [INFO ] Time to serialize gal into /tmp/LTL3933212269839965963.gal : 6 ms
[2024-05-23 16:51:51] [INFO ] Time to serialize properties into /tmp/LTL12601886244492977015.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3933212269839965963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12601886244492977015.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("((((s0<1)||(l1476<1))&&((s1<1)||(l2624<1)))&&((s0<1)||(l1476<1)))")))))))
Formula 0 simplified : XXXXF!"((((s0<1)||(l1476<1))&&((s1<1)||(l2624<1)))&&((s0<1)||(l1476<1)))"
Detected timeout of ITS tools.
[2024-05-23 16:52:06] [INFO ] Flatten gal took : 35 ms
[2024-05-23 16:52:06] [INFO ] Applying decomposition
[2024-05-23 16:52:06] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16496057450365875461.txt' '-o' '/tmp/graph16496057450365875461.bin' '-w' '/tmp/graph16496057450365875461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16496057450365875461.bin' '-l' '-1' '-v' '-w' '/tmp/graph16496057450365875461.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:52:06] [INFO ] Decomposing Gal with order
[2024-05-23 16:52:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:52:06] [INFO ] Removed a total of 2661 redundant transitions.
[2024-05-23 16:52:06] [INFO ] Flatten gal took : 59 ms
[2024-05-23 16:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1095 labels/synchronizations in 29 ms.
[2024-05-23 16:52:06] [INFO ] Time to serialize gal into /tmp/LTL6373350930851663550.gal : 7 ms
[2024-05-23 16:52:06] [INFO ] Time to serialize properties into /tmp/LTL16532027272243106825.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6373350930851663550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16532027272243106825.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("((((i0.u0.s0<1)||(i26.i0.u147.l1476<1))&&((i7.u1.s1<1)||(i11.u108.l2624<1)))&&((i0.u0.s0<1)||(i26.i0.u147.l1476<1)))")))...159
Formula 0 simplified : XXXXF!"((((i0.u0.s0<1)||(i26.i0.u147.l1476<1))&&((i7.u1.s1<1)||(i11.u108.l2624<1)))&&((i0.u0.s0<1)||(i26.i0.u147.l1476<1)))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLFireability-15 finished in 342183 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(p1))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(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' '!(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' '!(X(X(X(X(G(p0))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c008-LTLFireability-15
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1822
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1822
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1818
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1792
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1756
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 162 place count 627 transition count 1636
Iterating global reduction 1 with 10 rules applied. Total rules applied 172 place count 627 transition count 1636
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 618 transition count 1616
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 192 place count 616 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 612 transition count 1604
Applied a total of 202 rules in 255 ms. Remains 612 /711 variables (removed 99) and now considering 1604/1846 (removed 242) transitions.
[2024-05-23 16:52:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:52:22] [INFO ] Invariant cache hit.
[2024-05-23 16:52:23] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 16:52:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:52:23] [INFO ] Invariant cache hit.
[2024-05-23 16:52:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:52:24] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-23 16:52:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 16:52:24] [INFO ] Invariant cache hit.
[2024-05-23 16:52:24] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(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 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 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31273 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68940ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68955ms
Starting structural reductions in LI_LTL mode, iteration 1 : 612/711 places, 1604/1846 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71106 ms. Remains : 612/711 places, 1604/1846 transitions.
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 412 ms.
Entered a terminal (fully accepting) state of product in 81 steps with 0 reset in 1 ms.
Treatment of property FunctionPointer-PT-c008-LTLFireability-15 finished in 71817 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-23 16:53:34] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14049578351951226631
[2024-05-23 16:53:34] [INFO ] Too many transitions (1846) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:53:34] [INFO ] Applying decomposition
[2024-05-23 16:53:34] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14049578351951226631
Running compilation step : cd /tmp/ltsmin14049578351951226631;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 16:53:34] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph892746214521451688.txt' '-o' '/tmp/graph892746214521451688.bin' '-w' '/tmp/graph892746214521451688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph892746214521451688.bin' '-l' '-1' '-v' '-w' '/tmp/graph892746214521451688.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:53:34] [INFO ] Decomposing Gal with order
[2024-05-23 16:53:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:53:34] [INFO ] Removed a total of 3042 redundant transitions.
[2024-05-23 16:53:34] [INFO ] Flatten gal took : 74 ms
[2024-05-23 16:53:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1338 labels/synchronizations in 38 ms.
[2024-05-23 16:53:34] [INFO ] Time to serialize gal into /tmp/LTLFireability2680699546099846254.gal : 9 ms
[2024-05-23 16:53:34] [INFO ] Time to serialize properties into /tmp/LTLFireability4356839978413678299.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2680699546099846254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4356839978413678299.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(G(("((i31.i0.u0.s0<1)||(i32.i0.u179.l2083<1))")||(X(F("((i7.u1.s1>=1)&&(i31.i0.u116.l976>=1))")))))))
Formula 0 simplified : G(F!"((i31.i0.u0.s0<1)||(i32.i0.u179.l2083<1))" & FG!"((i7.u1.s1>=1)&&(i31.i0.u116.l976>=1))")
Compilation finished in 4258 ms.
Running link step : cd /tmp/ltsmin14049578351951226631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14049578351951226631;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.129: LTL layer: formula: <>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))
pins2lts-mc-linux64( 3/ 8), 0.129: "<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.130: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.173: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.179: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.509: There are 1854 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.509: State length is 712, there are 1852 groups
pins2lts-mc-linux64( 0/ 8), 0.509: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.509: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.509: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.509: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.619: [Blue] ~120 levels ~960 states ~5768 transitions
pins2lts-mc-linux64( 5/ 8), 0.726: [Blue] ~240 levels ~1920 states ~11528 transitions
pins2lts-mc-linux64( 5/ 8), 0.939: [Blue] ~480 levels ~3840 states ~23048 transitions
pins2lts-mc-linux64( 6/ 8), 1.325: [Blue] ~960 levels ~7680 states ~54192 transitions
pins2lts-mc-linux64( 6/ 8), 1.948: [Blue] ~1920 levels ~15360 states ~108528 transitions
pins2lts-mc-linux64( 6/ 8), 3.046: [Blue] ~3840 levels ~30720 states ~217216 transitions
pins2lts-mc-linux64( 5/ 8), 5.143: [Blue] ~7680 levels ~61440 states ~368648 transitions
pins2lts-mc-linux64( 5/ 8), 8.537: [Blue] ~15360 levels ~122880 states ~737288 transitions
pins2lts-mc-linux64( 5/ 8), 15.431: [Blue] ~30720 levels ~245760 states ~1474568 transitions
pins2lts-mc-linux64( 5/ 8), 29.248: [Blue] ~61440 levels ~491520 states ~2949128 transitions
pins2lts-mc-linux64( 3/ 8), 56.893: [Blue] ~122880 levels ~983040 states ~6390816 transitions
pins2lts-mc-linux64( 3/ 8), 111.360: [Blue] ~245760 levels ~1966080 states ~12780576 transitions
pins2lts-mc-linux64( 7/ 8), 156.983: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 157.157:
pins2lts-mc-linux64( 0/ 8), 157.157: Explored 2681201 states 22755372 transitions, fanout: 8.487
pins2lts-mc-linux64( 0/ 8), 157.157: Total exploration time 156.630 sec (156.460 sec minimum, 156.548 sec on average)
pins2lts-mc-linux64( 0/ 8), 157.157: States per second: 17118, Transitions per second: 145281
pins2lts-mc-linux64( 0/ 8), 157.157:
pins2lts-mc-linux64( 0/ 8), 157.157: State space has 21970622 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 157.157: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 157.157: blue states: 2681201 (12.20%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 157.157: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 157.157: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 157.157:
pins2lts-mc-linux64( 0/ 8), 157.157: Total memory used for local state coloring: 40.9MB
pins2lts-mc-linux64( 0/ 8), 157.157:
pins2lts-mc-linux64( 0/ 8), 157.157: Queue width: 8B, total height: 2681201, memory: 20.46MB
pins2lts-mc-linux64( 0/ 8), 157.157: Tree memory: 423.6MB, 20.2 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 157.157: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 157.157: Stored 1873 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 157.157: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 157.157: Est. total memory use: 444.1MB (~1044.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14049578351951226631;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14049578351951226631;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FunctionPointer-PT-c008, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603100292"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;