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-171640603100323.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-c128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 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-c128-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716492578200

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 19:29:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 19:29:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:29:39] [INFO ] Load time of PNML (sax parser for PT used): 388 ms
[2024-05-23 19:29:39] [INFO ] Transformed 2826 places.
[2024-05-23 19:29:39] [INFO ] Transformed 8960 transitions.
[2024-05-23 19:29:39] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 567 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 43 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 311 place count 1317 transition count 3708
Iterating global reduction 1 with 294 rules applied. Total rules applied 605 place count 1317 transition count 3708
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 967 place count 1317 transition count 3346
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1120 place count 1164 transition count 3040
Iterating global reduction 2 with 153 rules applied. Total rules applied 1273 place count 1164 transition count 3040
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1345 place count 1164 transition count 2968
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1358 place count 1151 transition count 2942
Iterating global reduction 3 with 13 rules applied. Total rules applied 1371 place count 1151 transition count 2942
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1383 place count 1139 transition count 2918
Iterating global reduction 3 with 12 rules applied. Total rules applied 1395 place count 1139 transition count 2918
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1407 place count 1127 transition count 2894
Iterating global reduction 3 with 12 rules applied. Total rules applied 1419 place count 1127 transition count 2894
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1431 place count 1115 transition count 2870
Iterating global reduction 3 with 12 rules applied. Total rules applied 1443 place count 1115 transition count 2870
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1455 place count 1103 transition count 2846
Iterating global reduction 3 with 12 rules applied. Total rules applied 1467 place count 1103 transition count 2846
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1478 place count 1092 transition count 2824
Iterating global reduction 3 with 11 rules applied. Total rules applied 1489 place count 1092 transition count 2824
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1500 place count 1081 transition count 2802
Iterating global reduction 3 with 11 rules applied. Total rules applied 1511 place count 1081 transition count 2802
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1553 place count 1039 transition count 2646
Iterating global reduction 3 with 42 rules applied. Total rules applied 1595 place count 1039 transition count 2646
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1649 place count 985 transition count 2430
Iterating global reduction 3 with 54 rules applied. Total rules applied 1703 place count 985 transition count 2430
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1757 place count 931 transition count 2286
Iterating global reduction 3 with 54 rules applied. Total rules applied 1811 place count 931 transition count 2286
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1865 place count 877 transition count 2178
Iterating global reduction 3 with 54 rules applied. Total rules applied 1919 place count 877 transition count 2178
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1973 place count 823 transition count 2070
Iterating global reduction 3 with 54 rules applied. Total rules applied 2027 place count 823 transition count 2070
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2081 place count 769 transition count 1962
Iterating global reduction 3 with 54 rules applied. Total rules applied 2135 place count 769 transition count 1962
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2183 place count 721 transition count 1866
Iterating global reduction 3 with 48 rules applied. Total rules applied 2231 place count 721 transition count 1866
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2249 place count 703 transition count 1830
Iterating global reduction 3 with 18 rules applied. Total rules applied 2267 place count 703 transition count 1830
Applied a total of 2267 rules in 1210 ms. Remains 703 /1628 variables (removed 925) and now considering 1830/5962 (removed 4132) transitions.
[2024-05-23 19:29:41] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
// Phase 1: matrix 1231 rows 703 cols
[2024-05-23 19:29:41] [INFO ] Computed 2 invariants in 29 ms
[2024-05-23 19:29:42] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-05-23 19:29:42] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-23 19:29:42] [INFO ] Invariant cache hit.
[2024-05-23 19:29:42] [INFO ] State equation strengthened by 304 read => feed constraints.
[2024-05-23 19:29:52] [INFO ] Implicit Places using invariants and state equation in 9759 ms returned []
Implicit Place search using SMT with State Equation took 10589 ms to find 0 implicit places.
Running 1828 sub problems to find dead transitions.
[2024-05-23 19:29:52] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-23 19:29:52] [INFO ] Invariant cache hit.
[2024-05-23 19:29:52] [INFO ] State equation strengthened by 304 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1828 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 703/1934 variables, and 2 constraints, problems are : Problem set: 0 solved, 1828 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/703 constraints, ReadFeed: 0/304 constraints, PredecessorRefiner: 1828/1828 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1828 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 3 (OVERLAPS) 1231/1934 variables, 703/705 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1934 variables, 304/1009 constraints. Problems are: Problem set: 0 solved, 1828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1934/1934 variables, and 2837 constraints, problems are : Problem set: 0 solved, 1828 unsolved in 31917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 constraints, PredecessorRefiner: 1828/1828 constraints, Known Traps: 0/0 constraints]
After SMT, in 70705ms problems are : Problem set: 0 solved, 1828 unsolved
Search for dead transitions found 0 dead transitions in 70745ms
Starting structural reductions in LTL mode, iteration 1 : 703/1628 places, 1830/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82578 ms. Remains : 703/1628 places, 1830/5962 transitions.
Support contains 23 out of 703 places after structural reductions.
[2024-05-23 19:31:03] [INFO ] Flatten gal took : 136 ms
[2024-05-23 19:31:03] [INFO ] Flatten gal took : 93 ms
[2024-05-23 19:31:03] [INFO ] Input system was already deterministic with 1830 transitions.
RANDOM walk for 40046 steps (8 resets) in 1888 ms. (21 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40004 steps (15 resets) in 133 ms. (298 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 102 ms. (388 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 80 ms. (493 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 80 ms. (493 steps per ms) remains 3/4 properties
[2024-05-23 19:31:04] [INFO ] Flow matrix only has 1231 transitions (discarded 599 similar events)
[2024-05-23 19:31:04] [INFO ] Invariant cache hit.
[2024-05-23 19:31:04] [INFO ] State equation strengthened by 304 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 390/403 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1284/1687 variables, 529/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1687 variables, 304/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1687 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 62/1749 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1749 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 170/1919 variables, 153/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1919 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 9/1928 variables, 4/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1928 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/1934 variables, 4/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1934 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1934 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1934/1934 variables, and 1009 constraints, problems are : Problem set: 0 solved, 3 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 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) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 390/403 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1284/1687 variables, 529/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1687 variables, 304/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1687 variables, 3/850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1687 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1749 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1749 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 170/1919 variables, 153/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1919 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 9/1928 variables, 4/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1928 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/1934 variables, 4/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1934 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1934 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1934/1934 variables, and 1012 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 703/703 constraints, ReadFeed: 304/304 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1897ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Graph (complete) has 3007 edges and 703 vertex of which 514 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.6 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 514 transition count 1452
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 390 place count 503 transition count 1430
Iterating global reduction 1 with 11 rules applied. Total rules applied 401 place count 503 transition count 1430
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 411 place count 503 transition count 1420
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 419 place count 495 transition count 1400
Iterating global reduction 2 with 8 rules applied. Total rules applied 427 place count 495 transition count 1400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 432 place count 490 transition count 1386
Iterating global reduction 2 with 5 rules applied. Total rules applied 437 place count 490 transition count 1386
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 443 place count 484 transition count 1370
Iterating global reduction 2 with 6 rules applied. Total rules applied 449 place count 484 transition count 1370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 455 place count 478 transition count 1354
Iterating global reduction 2 with 6 rules applied. Total rules applied 461 place count 478 transition count 1354
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 467 place count 472 transition count 1342
Iterating global reduction 2 with 6 rules applied. Total rules applied 473 place count 472 transition count 1342
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 479 place count 466 transition count 1330
Iterating global reduction 2 with 6 rules applied. Total rules applied 485 place count 466 transition count 1330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 492 place count 459 transition count 1312
Iterating global reduction 2 with 7 rules applied. Total rules applied 499 place count 459 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 504 place count 454 transition count 1296
Iterating global reduction 2 with 5 rules applied. Total rules applied 509 place count 454 transition count 1296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 514 place count 449 transition count 1284
Iterating global reduction 2 with 5 rules applied. Total rules applied 519 place count 449 transition count 1284
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 522 place count 446 transition count 1278
Iterating global reduction 2 with 3 rules applied. Total rules applied 525 place count 446 transition count 1278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 528 place count 443 transition count 1272
Iterating global reduction 2 with 3 rules applied. Total rules applied 531 place count 443 transition count 1272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 534 place count 440 transition count 1266
Iterating global reduction 2 with 3 rules applied. Total rules applied 537 place count 440 transition count 1266
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 540 place count 437 transition count 1260
Iterating global reduction 2 with 3 rules applied. Total rules applied 543 place count 437 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 544 place count 436 transition count 1258
Iterating global reduction 2 with 1 rules applied. Total rules applied 545 place count 436 transition count 1258
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 551 place count 436 transition count 1252
Applied a total of 551 rules in 366 ms. Remains 436 /703 variables (removed 267) and now considering 1252/1830 (removed 578) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 436/703 places, 1252/1830 transitions.
RANDOM walk for 40011 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-23 19:31:06] [INFO ] Flow matrix only has 714 transitions (discarded 538 similar events)
// Phase 1: matrix 714 rows 436 cols
[2024-05-23 19:31:06] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 19:31:06] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/228 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 763/991 variables, 348/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/991 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/991 variables, 83/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/1053 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1053 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/1128 variables, 69/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1128 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/1140 variables, 6/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1140 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/1150 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1150 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1150 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1150/1150 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 436/436 constraints, ReadFeed: 83/83 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/228 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 763/991 variables, 348/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/991 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/991 variables, 83/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1053 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1053 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 75/1128 variables, 69/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1128 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1140 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1140 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/1150 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1150 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1150 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1150/1150 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 436/436 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 1252/1252 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 434 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 434 transition count 1248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 432 transition count 1244
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 432 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 430 transition count 1236
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 430 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 428 transition count 1232
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 426 transition count 1228
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 424 transition count 1224
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 422 transition count 1220
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 422 transition count 1220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 420 transition count 1216
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 420 transition count 1216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 418 transition count 1212
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 418 transition count 1212
Applied a total of 36 rules in 133 ms. Remains 418 /436 variables (removed 18) and now considering 1212/1252 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 418/436 places, 1212/1252 transitions.
RANDOM walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 565210 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 565210 steps, saw 346577 distinct states, run finished after 3004 ms. (steps per millisecond=188 ) properties seen :0
[2024-05-23 19:31:10] [INFO ] Flow matrix only has 686 transitions (discarded 526 similar events)
// Phase 1: matrix 686 rows 418 cols
[2024-05-23 19:31:10] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 19:31:10] [INFO ] State equation strengthened by 77 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/222 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 739/961 variables, 338/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/961 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/961 variables, 77/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/1023 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1023 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 67/1090 variables, 65/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1090 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1098 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 418/418 constraints, ReadFeed: 77/77 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/222 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 739/961 variables, 338/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/961 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/961 variables, 77/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1023 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1023 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 67/1090 variables, 65/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1098 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 418/418 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1212/1212 transitions.
Applied a total of 0 rules in 51 ms. Remains 418 /418 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 418/418 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1212/1212 transitions.
Applied a total of 0 rules in 45 ms. Remains 418 /418 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 19:31:11] [INFO ] Flow matrix only has 686 transitions (discarded 526 similar events)
[2024-05-23 19:31:11] [INFO ] Invariant cache hit.
[2024-05-23 19:31:11] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-23 19:31:11] [INFO ] Flow matrix only has 686 transitions (discarded 526 similar events)
[2024-05-23 19:31:11] [INFO ] Invariant cache hit.
[2024-05-23 19:31:11] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 19:31:12] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
[2024-05-23 19:31:12] [INFO ] Redundant transitions in 74 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 19:31:12] [INFO ] Flow matrix only has 686 transitions (discarded 526 similar events)
[2024-05-23 19:31:12] [INFO ] Invariant cache hit.
[2024-05-23 19:31:12] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.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 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.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 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 686/1104 variables, 418/420 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34094ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35673 ms. Remains : 418/418 places, 1212/1212 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 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 536 rules applied. Total rules applied 536 place count 418 transition count 676
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 408 transition count 675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 548 place count 407 transition count 675
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 548 place count 407 transition count 608
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 682 place count 340 transition count 608
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 940 place count 211 transition count 479
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1004 place count 147 transition count 351
Iterating global reduction 3 with 64 rules applied. Total rules applied 1068 place count 147 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1069 place count 147 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1069 place count 147 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1071 place count 146 transition count 349
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1134 place count 83 transition count 223
Iterating global reduction 4 with 63 rules applied. Total rules applied 1197 place count 83 transition count 223
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1260 place count 20 transition count 97
Iterating global reduction 4 with 63 rules applied. Total rules applied 1323 place count 20 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1386 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1386 place count 20 transition count 33
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 1388 place count 19 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1391 place count 19 transition count 30
Applied a total of 1391 rules in 70 ms. Remains 19 /418 variables (removed 399) and now considering 30/1212 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 19 cols
[2024-05-23 19:31:46] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 19:31:46] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:31:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 19:31:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 19:31:46] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:31:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:31:46] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:31:46] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:31:46] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 198 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-11 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((p0 U (p1&&G(p2))))))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 693 transition count 1810
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 693 transition count 1810
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 693 transition count 1802
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 685 transition count 1784
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 685 transition count 1784
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 679 transition count 1766
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 679 transition count 1766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 672 transition count 1744
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 672 transition count 1744
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 665 transition count 1726
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 665 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 658 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 658 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 651 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 651 transition count 1698
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 120 place count 643 transition count 1678
Iterating global reduction 1 with 8 rules applied. Total rules applied 128 place count 643 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 636 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 636 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 147 place count 631 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 152 place count 631 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 628 transition count 1640
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 625 transition count 1634
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 625 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 622 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 622 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 619 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 618 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 618 transition count 1620
Applied a total of 178 rules in 271 ms. Remains 618 /703 variables (removed 85) and now considering 1620/1830 (removed 210) transitions.
[2024-05-23 19:31:47] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
// Phase 1: matrix 1085 rows 618 cols
[2024-05-23 19:31:47] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 19:31:47] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-23 19:31:47] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
[2024-05-23 19:31:47] [INFO ] Invariant cache hit.
[2024-05-23 19:31:48] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 19:31:49] [INFO ] Implicit Places using invariants and state equation in 2066 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
Running 1618 sub problems to find dead transitions.
[2024-05-23 19:31:49] [INFO ] Flow matrix only has 1085 transitions (discarded 535 similar events)
[2024-05-23 19:31:49] [INFO ] Invariant cache hit.
[2024-05-23 19:31:49] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1703 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1703 variables, 271/891 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1703/1703 variables, and 2509 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
After SMT, in 69620ms problems are : Problem set: 0 solved, 1618 unsolved
Search for dead transitions found 0 dead transitions in 69640ms
Starting structural reductions in LTL mode, iteration 1 : 618/703 places, 1620/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72416 ms. Remains : 618/703 places, 1620/1830 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-00 finished in 72854 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))))'
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 690 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 680 transition count 1768
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 680 transition count 1768
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 674 transition count 1750
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 674 transition count 1750
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 667 transition count 1730
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 667 transition count 1730
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 660 transition count 1712
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 660 transition count 1712
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 653 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1684
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 638 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 638 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 632 transition count 1646
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 632 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 627 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 627 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 173 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 176 place count 621 transition count 1622
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 179 place count 618 transition count 1616
Iterating global reduction 1 with 3 rules applied. Total rules applied 182 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 185 place count 615 transition count 1610
Iterating global reduction 1 with 3 rules applied. Total rules applied 188 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 614 transition count 1608
Applied a total of 190 rules in 181 ms. Remains 614 /703 variables (removed 89) and now considering 1608/1830 (removed 222) transitions.
[2024-05-23 19:33:00] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 19:33:00] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 19:33:00] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-23 19:33:00] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 19:33:00] [INFO ] Invariant cache hit.
[2024-05-23 19:33:00] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 19:33:02] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 19:33:02] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 19:33:02] [INFO ] Invariant cache hit.
[2024-05-23 19:33:02] [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 30032 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 30598 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 67925ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 67945ms
Starting structural reductions in LTL mode, iteration 1 : 614/703 places, 1608/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70777 ms. Remains : 614/703 places, 1608/1830 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-01
Product exploration explored 100000 steps with 742 reset in 629 ms.
Entered a terminal (fully accepting) state of product in 85364 steps with 661 reset in 489 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-01 finished in 72040 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&&X(G((p0||X(X(X(G(p1))))))))))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 691 transition count 1796
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 682 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 682 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 677 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 672 transition count 1742
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 672 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 667 transition count 1732
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 662 transition count 1722
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 662 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 657 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 652 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 652 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 646 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 640 transition count 1670
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 640 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 638 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 638 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 636 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 636 transition count 1662
Applied a total of 144 rules in 194 ms. Remains 636 /703 variables (removed 67) and now considering 1662/1830 (removed 168) transitions.
[2024-05-23 19:34:12] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 19:34:12] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 19:34:12] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-23 19:34:12] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:34:12] [INFO ] Invariant cache hit.
[2024-05-23 19:34:12] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 19:34:14] [INFO ] Implicit Places using invariants and state equation in 2052 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 19:34:14] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:34:14] [INFO ] Invariant cache hit.
[2024-05-23 19:34:14] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 9.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.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 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.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 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.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 1.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 1.0)
(s97 0.0)
(s98 1.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 31018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 70058ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 70077ms
Starting structural reductions in LTL mode, iteration 1 : 636/703 places, 1662/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72758 ms. Remains : 636/703 places, 1662/1830 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-05
Product exploration explored 100000 steps with 743 reset in 524 ms.
Product exploration explored 100000 steps with 697 reset in 567 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40050 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (22 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
[2024-05-23 19:35:27] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:35:27] [INFO ] Invariant cache hit.
[2024-05-23 19:35:27] [INFO ] State equation strengthened by 272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 3 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 913 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1926ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 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 444 transition count 1278
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 393 place count 444 transition count 1270
Applied a total of 393 rules in 101 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40001 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-23 19:35:29] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-23 19:35:29] [INFO ] Computed 3 invariants in 4 ms
[2024-05-23 19:35:29] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 727ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 66 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 444/444 places, 1270/1270 transitions.
RANDOM walk for 36477 steps (7 resets) in 166 ms. (218 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 412 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 480 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 465 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 14 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-23 19:35:31] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 19:35:31] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 19:35:31] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-23 19:35:31] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:35:31] [INFO ] Invariant cache hit.
[2024-05-23 19:35:32] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 19:35:34] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 19:35:34] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:35:34] [INFO ] Invariant cache hit.
[2024-05-23 19:35:34] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 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 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30932 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68751ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68769ms
Finished structural reductions in LTL mode , in 1 iterations and 71348 ms. Remains : 636/636 places, 1662/1662 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40017 steps (8 resets) in 117 ms. (339 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
[2024-05-23 19:36:43] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:36:43] [INFO ] Invariant cache hit.
[2024-05-23 19:36:43] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 3 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 913 constraints, problems are : Problem set: 0 solved, 3 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1741ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 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 444 transition count 1278
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 393 place count 444 transition count 1270
Applied a total of 393 rules in 92 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40001 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-23 19:36:45] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-23 19:36:45] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 19:36:45] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 50 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 444/444 places, 1270/1270 transitions.
RANDOM walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 569181 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 569181 steps, saw 350608 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-23 19:36:49] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 19:36:49] [INFO ] Invariant cache hit.
[2024-05-23 19:36:49] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 48 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 45 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-23 19:36:49] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 19:36:49] [INFO ] Invariant cache hit.
[2024-05-23 19:36:50] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 19:36:50] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 19:36:50] [INFO ] Invariant cache hit.
[2024-05-23 19:36:50] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-23 19:36:51] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
[2024-05-23 19:36:51] [INFO ] Redundant transitions in 25 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-23 19:36:51] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 19:36:51] [INFO ] Invariant cache hit.
[2024-05-23 19:36:51] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 1268/1797 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
After SMT, in 64392ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 64403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66028 ms. Remains : 444/444 places, 1270/1270 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 41 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-23 19:37:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 19:37:56] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:37:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 19:37:56] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:37:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:37:56] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:37:56] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:37:56] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 99 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 329 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 428 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 750 reset in 486 ms.
Product exploration explored 100000 steps with 694 reset in 498 ms.
Built C files in :
/tmp/ltsmin2201906912847455220
[2024-05-23 19:37:58] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2201906912847455220
Running compilation step : cd /tmp/ltsmin2201906912847455220;'/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/ltsmin2201906912847455220;'/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/ltsmin2201906912847455220;'/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 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 10 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-23 19:38:01] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 19:38:01] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 19:38:02] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-23 19:38:02] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:38:02] [INFO ] Invariant cache hit.
[2024-05-23 19:38:02] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 19:38:04] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2467 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 19:38:04] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:38:04] [INFO ] Invariant cache hit.
[2024-05-23 19:38:04] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30948 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68477ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68493ms
Finished structural reductions in LTL mode , in 1 iterations and 70976 ms. Remains : 636/636 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin6172393561155997111
[2024-05-23 19:39:12] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6172393561155997111
Running compilation step : cd /tmp/ltsmin6172393561155997111;'/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/ltsmin6172393561155997111;'/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/ltsmin6172393561155997111;'/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 19:39:16] [INFO ] Flatten gal took : 88 ms
[2024-05-23 19:39:16] [INFO ] Flatten gal took : 87 ms
[2024-05-23 19:39:16] [INFO ] Time to serialize gal into /tmp/LTL1766638809761314427.gal : 29 ms
[2024-05-23 19:39:16] [INFO ] Time to serialize properties into /tmp/LTL6881623033039696975.prop : 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/LTL1766638809761314427.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18249635083802159364.hoa' '-atoms' '/tmp/LTL6881623033039696975.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/LTL6881623033039696975.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18249635083802159364.hoa
Detected timeout of ITS tools.
[2024-05-23 19:39:31] [INFO ] Flatten gal took : 52 ms
[2024-05-23 19:39:31] [INFO ] Flatten gal took : 53 ms
[2024-05-23 19:39:31] [INFO ] Time to serialize gal into /tmp/LTL14501558386764963960.gal : 15 ms
[2024-05-23 19:39:31] [INFO ] Time to serialize properties into /tmp/LTL570949569671556605.ltl : 11 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/LTL14501558386764963960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL570949569671556605.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(("(l2172<2)")&&(X(G(("(l2172<2)")||(X(X(X(G("(l1982>0)")))))))))))
Formula 0 simplified : G(!"(l2172<2)" | XF(!"(l2172<2)" & XXXF!"(l1982>0)"))
Detected timeout of ITS tools.
[2024-05-23 19:39:46] [INFO ] Flatten gal took : 46 ms
[2024-05-23 19:39:46] [INFO ] Applying decomposition
[2024-05-23 19:39:46] [INFO ] Flatten gal took : 45 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/graph7336988125502507566.txt' '-o' '/tmp/graph7336988125502507566.bin' '-w' '/tmp/graph7336988125502507566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7336988125502507566.bin' '-l' '-1' '-v' '-w' '/tmp/graph7336988125502507566.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:39:47] [INFO ] Decomposing Gal with order
[2024-05-23 19:39:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:39:47] [INFO ] Removed a total of 2774 redundant transitions.
[2024-05-23 19:39:47] [INFO ] Flatten gal took : 165 ms
[2024-05-23 19:39:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1280 labels/synchronizations in 101 ms.
[2024-05-23 19:39:47] [INFO ] Time to serialize gal into /tmp/LTL7204945367905733786.gal : 18 ms
[2024-05-23 19:39:47] [INFO ] Time to serialize properties into /tmp/LTL8986238920357089123.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/LTL7204945367905733786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8986238920357089123.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...254
Read 1 LTL properties
Checking formula 0 : !((F(("(i26.i4.u156.l2172<2)")&&(X(G(("(i26.i4.u156.l2172<2)")||(X(X(X(G("(i26.i3.u154.l1982>0)")))))))))))
Formula 0 simplified : G(!"(i26.i4.u156.l2172<2)" | XF(!"(i26.i4.u156.l2172<2)" & XXXF!"(i26.i3.u154.l1982>0)"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-05 finished in 350522 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)&&F(G(p1)))))'
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 691 transition count 1794
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 682 transition count 1772
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 682 transition count 1772
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 677 transition count 1756
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 671 transition count 1738
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 671 transition count 1738
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 665 transition count 1722
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 665 transition count 1722
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 659 transition count 1710
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 659 transition count 1710
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 653 transition count 1698
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 653 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 119 place count 646 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 126 place count 646 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 641 transition count 1666
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 641 transition count 1666
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 140 place count 637 transition count 1658
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 637 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 635 transition count 1654
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 635 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 633 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 633 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 631 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 631 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 629 transition count 1642
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 629 transition count 1642
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 166 place count 629 transition count 1636
Applied a total of 166 rules in 504 ms. Remains 629 /703 variables (removed 74) and now considering 1636/1830 (removed 194) transitions.
[2024-05-23 19:40:03] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2024-05-23 19:40:03] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 19:40:03] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-23 19:40:03] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 19:40:03] [INFO ] Invariant cache hit.
[2024-05-23 19:40:03] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-23 19:40:06] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 2964 ms to find 0 implicit places.
[2024-05-23 19:40:06] [INFO ] Redundant transitions in 31 ms returned []
Running 1634 sub problems to find dead transitions.
[2024-05-23 19:40:06] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 19:40:06] [INFO ] Invariant cache hit.
[2024-05-23 19:40:06] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/1722 variables, and 2 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/629 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 3 (OVERLAPS) 1093/1722 variables, 629/631 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1722 variables, 270/901 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 2535 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 31144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 629/629 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
After SMT, in 68532ms problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 68546ms
Starting structural reductions in SI_LTL mode, iteration 1 : 629/703 places, 1636/1830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72058 ms. Remains : 629/703 places, 1636/1830 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-06
Stuttering criterion allowed to conclude after 178 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-06 finished in 72220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 690 transition count 1794
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 680 transition count 1770
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 680 transition count 1770
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 673 transition count 1748
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 673 transition count 1748
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 665 transition count 1724
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 665 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 649 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 126 place count 641 transition count 1672
Iterating global reduction 1 with 8 rules applied. Total rules applied 134 place count 641 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 143 place count 632 transition count 1650
Iterating global reduction 1 with 9 rules applied. Total rules applied 152 place count 632 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 158 place count 626 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 164 place count 626 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 169 place count 621 transition count 1620
Iterating global reduction 1 with 5 rules applied. Total rules applied 174 place count 621 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 177 place count 618 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 180 place count 618 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 615 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 612 transition count 1602
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 612 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 609 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 608 transition count 1594
Applied a total of 200 rules in 182 ms. Remains 608 /703 variables (removed 95) and now considering 1594/1830 (removed 236) transitions.
[2024-05-23 19:41:14] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
// Phase 1: matrix 1066 rows 608 cols
[2024-05-23 19:41:14] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 19:41:15] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-23 19:41:15] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2024-05-23 19:41:15] [INFO ] Invariant cache hit.
[2024-05-23 19:41:15] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 19:41:17] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2024-05-23 19:41:17] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2024-05-23 19:41:17] [INFO ] Invariant cache hit.
[2024-05-23 19:41:17] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1674 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 3 (OVERLAPS) 1066/1674 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1674 variables, 266/876 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/1674 variables, and 2468 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 608/608 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints]
After SMT, in 67824ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 67838ms
Starting structural reductions in LTL mode, iteration 1 : 608/703 places, 1594/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70432 ms. Remains : 608/703 places, 1594/1830 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 20358 steps with 151 reset in 100 ms.
FORMULA FunctionPointer-PT-c128-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLCardinality-09 finished in 70713 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 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 690 transition count 1804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 690 transition count 1804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 690 transition count 1794
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 679 transition count 1768
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 679 transition count 1768
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 672 transition count 1746
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 672 transition count 1746
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 664 transition count 1722
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 664 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 656 transition count 1702
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 656 transition count 1702
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 648 transition count 1686
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 648 transition count 1686
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 641 transition count 1672
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 641 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 633 transition count 1652
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 633 transition count 1652
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 627 transition count 1636
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 166 place count 623 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 170 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 172 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 174 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 176 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 178 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 180 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 182 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 615 transition count 1612
Applied a total of 186 rules in 183 ms. Remains 615 /703 variables (removed 88) and now considering 1612/1830 (removed 218) transitions.
[2024-05-23 19:42:25] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 19:42:25] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 19:42:26] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-23 19:42:26] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 19:42:26] [INFO ] Invariant cache hit.
[2024-05-23 19:42:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 19:42:27] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2289 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 19:42:27] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 19:42:27] [INFO ] Invariant cache hit.
[2024-05-23 19:42:27] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
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 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68214ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68229ms
Starting structural reductions in LTL mode, iteration 1 : 615/703 places, 1612/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70709 ms. Remains : 615/703 places, 1612/1830 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 537 ms.
Product exploration explored 100000 steps with 50000 reset in 514 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c128-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c128-LTLCardinality-12 finished in 71879 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&&X(G((p0||X(X(X(G(p1))))))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c128-LTLCardinality-05
Stuttering acceptance computed with spot in 388 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 703/703 places, 1830/1830 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 691 transition count 1806
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 691 transition count 1806
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 691 transition count 1796
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 682 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 682 transition count 1774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 677 transition count 1756
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 677 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 672 transition count 1742
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 672 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 667 transition count 1732
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 662 transition count 1722
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 662 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 657 transition count 1712
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 657 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 652 transition count 1702
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 652 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 116 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 646 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 646 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 644 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 644 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 642 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 642 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 640 transition count 1670
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 640 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 638 transition count 1666
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 638 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 636 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 636 transition count 1662
Applied a total of 144 rules in 240 ms. Remains 636 /703 variables (removed 67) and now considering 1662/1830 (removed 168) transitions.
[2024-05-23 19:43:38] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 19:43:38] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 19:43:38] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-23 19:43:38] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:43:38] [INFO ] Invariant cache hit.
[2024-05-23 19:43:38] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 19:43:40] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 2586 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 19:43:40] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:43:40] [INFO ] Invariant cache hit.
[2024-05-23 19:43:40] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 9.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.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 1.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 1.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 1.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 1.0)
(s97 0.0)
(s98 1.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 1.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 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.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 1.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 1.0)
(s405 0.0)
(s406 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30829 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68852ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68866ms
Starting structural reductions in LI_LTL mode, iteration 1 : 636/703 places, 1662/1830 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71701 ms. Remains : 636/703 places, 1662/1830 transitions.
Running random walk in product with property : FunctionPointer-PT-c128-LTLCardinality-05
Product exploration explored 100000 steps with 719 reset in 479 ms.
Product exploration explored 100000 steps with 730 reset in 495 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40080 steps (8 resets) in 105 ms. (378 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-23 19:44:51] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:44:51] [INFO ] Invariant cache hit.
[2024-05-23 19:44:51] [INFO ] State equation strengthened by 272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 962/1526 variables, 483/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 270/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1588 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 148/1736 variables, 139/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1736 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1744 variables, 5/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1745 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1745 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 557/564 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 962/1526 variables, 483/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 270/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1588 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 148/1736 variables, 139/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1736 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1744 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1744 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1745 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1745 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 933ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Graph (complete) has 2762 edges and 636 vertex of which 444 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 444 transition count 1278
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 393 place count 444 transition count 1270
Applied a total of 393 rules in 112 ms. Remains 444 /636 variables (removed 192) and now considering 1270/1662 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 444/636 places, 1270/1662 transitions.
RANDOM walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 616819 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 616819 steps, saw 379953 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2024-05-23 19:44:55] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
// Phase 1: matrix 723 rows 444 cols
[2024-05-23 19:44:55] [INFO ] Computed 3 invariants in 5 ms
[2024-05-23 19:44:55] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1163 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1163 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1167 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1163 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1163 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1167 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 659ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 46 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 444/444 places, 1270/1270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1270/1270 transitions.
Applied a total of 0 rules in 44 ms. Remains 444 /444 variables (removed 0) and now considering 1270/1270 (removed 0) transitions.
[2024-05-23 19:44:56] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 19:44:56] [INFO ] Invariant cache hit.
[2024-05-23 19:44:56] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 19:44:56] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 19:44:56] [INFO ] Invariant cache hit.
[2024-05-23 19:44:56] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-23 19:44:57] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2024-05-23 19:44:57] [INFO ] Redundant transitions in 20 ms returned []
Running 1268 sub problems to find dead transitions.
[2024-05-23 19:44:57] [INFO ] Flow matrix only has 723 transitions (discarded 547 similar events)
[2024-05-23 19:44:57] [INFO ] Invariant cache hit.
[2024-05-23 19:44:57] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/1167 variables, and 529 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 2 (OVERLAPS) 723/1167 variables, 444/447 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1167 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1167 variables, 1268/1797 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/1167 variables, and 1797 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 444/444 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1268/1268 constraints, Known Traps: 0/0 constraints]
After SMT, in 64531ms problems are : Problem set: 0 solved, 1268 unsolved
Search for dead transitions found 0 dead transitions in 64541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66138 ms. Remains : 444/444 places, 1270/1270 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 547 transitions
Reduce isomorphic transitions removed 547 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 444 transition count 709
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 575 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 575 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 737 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 995 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1059 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1123 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1124 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1187 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1250 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1313 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1376 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1439 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1439 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1441 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1443 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1449 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1452 place count 25 transition count 50
Applied a total of 1452 rules in 23 ms. Remains 25 /444 variables (removed 419) and now considering 50/1270 (removed 1220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-23 19:46:02] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 19:46:02] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 19:46:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 19:46:02] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 19:46:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 19:46:02] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 19:46:02] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 19:46:02] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 167 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 447 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 390 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 16 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-23 19:46:03] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
// Phase 1: matrix 1109 rows 636 cols
[2024-05-23 19:46:03] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 19:46:03] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-23 19:46:03] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:46:03] [INFO ] Invariant cache hit.
[2024-05-23 19:46:04] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 19:46:06] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 19:46:06] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:46:06] [INFO ] Invariant cache hit.
[2024-05-23 19:46:06] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 9.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.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 1.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 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.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 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.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 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.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 1.0)
(s97 0.0)
(s98 1.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 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 timeout
1.0)
(s149 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 31006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 68941ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 68957ms
Finished structural reductions in LTL mode , in 1 iterations and 71505 ms. Remains : 636/636 places, 1662/1662 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 38022 steps (8 resets) in 99 ms. (380 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 292 ms. Reduced automaton from 10 states, 30 edges and 2 AP (stutter sensitive) to 10 states, 30 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 375 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 722 reset in 476 ms.
Product exploration explored 100000 steps with 723 reset in 494 ms.
Built C files in :
/tmp/ltsmin4223217169248562042
[2024-05-23 19:47:18] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4223217169248562042
Running compilation step : cd /tmp/ltsmin4223217169248562042;'/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/ltsmin4223217169248562042;'/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/ltsmin4223217169248562042;'/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 636 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 636/636 places, 1662/1662 transitions.
Applied a total of 0 rules in 10 ms. Remains 636 /636 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2024-05-23 19:47:21] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:47:21] [INFO ] Invariant cache hit.
[2024-05-23 19:47:21] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-23 19:47:21] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:47:21] [INFO ] Invariant cache hit.
[2024-05-23 19:47:21] [INFO ] State equation strengthened by 272 read => feed constraints.
[2024-05-23 19:47:23] [INFO ] Implicit Places using invariants and state equation in 1996 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 19:47:23] [INFO ] Flow matrix only has 1109 transitions (discarded 553 similar events)
[2024-05-23 19:47:23] [INFO ] Invariant cache hit.
[2024-05-23 19:47:23] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 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 636/1745 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1745 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1745 variables, 272/910 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 2570 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 69023ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 69038ms
Finished structural reductions in LTL mode , in 1 iterations and 71466 ms. Remains : 636/636 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin13717963091996312895
[2024-05-23 19:48:32] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13717963091996312895
Running compilation step : cd /tmp/ltsmin13717963091996312895;'/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/ltsmin13717963091996312895;'/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/ltsmin13717963091996312895;'/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 19:48:35] [INFO ] Flatten gal took : 44 ms
[2024-05-23 19:48:35] [INFO ] Flatten gal took : 42 ms
[2024-05-23 19:48:35] [INFO ] Time to serialize gal into /tmp/LTL7458528437287497320.gal : 7 ms
[2024-05-23 19:48:35] [INFO ] Time to serialize properties into /tmp/LTL12995076780724454966.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/LTL7458528437287497320.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18334110313377310851.hoa' '-atoms' '/tmp/LTL12995076780724454966.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...319
Loading property file /tmp/LTL12995076780724454966.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18334110313377310851.hoa
Detected timeout of ITS tools.
[2024-05-23 19:48:50] [INFO ] Flatten gal took : 38 ms
[2024-05-23 19:48:50] [INFO ] Flatten gal took : 38 ms
[2024-05-23 19:48:50] [INFO ] Time to serialize gal into /tmp/LTL9924052890265600329.gal : 7 ms
[2024-05-23 19:48:50] [INFO ] Time to serialize properties into /tmp/LTL9417788433026425513.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/LTL9924052890265600329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9417788433026425513.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(("(l2172<2)")&&(X(G(("(l2172<2)")||(X(X(X(G("(l1982>0)")))))))))))
Formula 0 simplified : G(!"(l2172<2)" | XF(!"(l2172<2)" & XXXF!"(l1982>0)"))
Detected timeout of ITS tools.
[2024-05-23 19:49:05] [INFO ] Flatten gal took : 36 ms
[2024-05-23 19:49:05] [INFO ] Applying decomposition
[2024-05-23 19:49:05] [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/graph11513770516851682784.txt' '-o' '/tmp/graph11513770516851682784.bin' '-w' '/tmp/graph11513770516851682784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11513770516851682784.bin' '-l' '-1' '-v' '-w' '/tmp/graph11513770516851682784.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:49:06] [INFO ] Decomposing Gal with order
[2024-05-23 19:49:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:49:06] [INFO ] Removed a total of 2780 redundant transitions.
[2024-05-23 19:49:06] [INFO ] Flatten gal took : 98 ms
[2024-05-23 19:49:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1146 labels/synchronizations in 86 ms.
[2024-05-23 19:49:06] [INFO ] Time to serialize gal into /tmp/LTL11093056201115453700.gal : 9 ms
[2024-05-23 19:49:06] [INFO ] Time to serialize properties into /tmp/LTL900852946856598483.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/LTL11093056201115453700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL900852946856598483.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...254
Read 1 LTL properties
Checking formula 0 : !((F(("(i25.i1.i3.u154.l2172<2)")&&(X(G(("(i25.i1.i3.u154.l2172<2)")||(X(X(X(G("(i25.i0.i0.u157.l1982>0)")))))))))))
Formula 0 simplified : G(!"(i25.i1.i3.u154.l2172<2)" | XF(!"(i25.i1.i3.u154.l2172<2)" & XXXF!"(i25.i0.i0.u157.l1982>0)"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c128-LTLCardinality-05 finished in 344054 ms.
[2024-05-23 19:49:21] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12365049970922189257
[2024-05-23 19:49:21] [INFO ] Too many transitions (1830) to apply POR reductions. Disabling POR matrices.
[2024-05-23 19:49:21] [INFO ] Applying decomposition
[2024-05-23 19:49:21] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12365049970922189257
Running compilation step : cd /tmp/ltsmin12365049970922189257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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 19:49:21] [INFO ] Flatten gal took : 43 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/graph3946572317212204310.txt' '-o' '/tmp/graph3946572317212204310.bin' '-w' '/tmp/graph3946572317212204310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3946572317212204310.bin' '-l' '-1' '-v' '-w' '/tmp/graph3946572317212204310.weights' '-q' '0' '-e' '0.001'
[2024-05-23 19:49:21] [INFO ] Decomposing Gal with order
[2024-05-23 19:49:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 19:49:21] [INFO ] Removed a total of 3058 redundant transitions.
[2024-05-23 19:49:21] [INFO ] Flatten gal took : 83 ms
[2024-05-23 19:49:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1443 labels/synchronizations in 45 ms.
[2024-05-23 19:49:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality9810334205822123603.gal : 17 ms
[2024-05-23 19:49:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality11110998184001265126.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/LTLCardinality9810334205822123603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11110998184001265126.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...277
Read 1 LTL properties
Checking formula 0 : !((F(("(i30.i1.u182.l2172<2)")&&(X(G(("(i30.i1.u182.l2172<2)")||(X(X(X(G("(i29.i1.u176.l1982>0)")))))))))))
Formula 0 simplified : G(!"(i30.i1.u182.l2172<2)" | XF(!"(i30.i1.u182.l2172<2)" & XXXF!"(i29.i1.u176.l1982>0)"))
Compilation finished in 4094 ms.
Running link step : cd /tmp/ltsmin12365049970922189257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin12365049970922189257;'/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' '<>(((LTLAPp0==true)&&X([](((LTLAPp0==true)||X(X(X([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: LTL layer: formula: <>(((LTLAPp0==true)&&X([](((LTLAPp0==true)||X(X(X([]((LTLAPp1==true))))))))))
pins2lts-mc-linux64( 2/ 8), 0.009: "<>(((LTLAPp0==true)&&X([](((LTLAPp0==true)||X(X(X([]((LTLAPp1==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.431: There are 1833 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.431: State length is 704, there are 1878 groups
pins2lts-mc-linux64( 0/ 8), 0.431: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.431: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.431: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.431: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.576: [Blue] ~120 levels ~960 states ~6808 transitions
pins2lts-mc-linux64( 4/ 8), 0.730: [Blue] ~240 levels ~1920 states ~16664 transitions
pins2lts-mc-linux64( 2/ 8), 0.977: [Blue] ~480 levels ~3840 states ~27536 transitions
pins2lts-mc-linux64( 0/ 8), 1.343: [Blue] ~960 levels ~7680 states ~62112 transitions
pins2lts-mc-linux64( 0/ 8), 1.978: [Blue] ~1920 levels ~15360 states ~121632 transitions
pins2lts-mc-linux64( 2/ 8), 3.068: [Blue] ~3840 levels ~30720 states ~182992 transitions
pins2lts-mc-linux64( 2/ 8), 5.129: [Blue] ~7680 levels ~61440 states ~358936 transitions
pins2lts-mc-linux64( 0/ 8), 8.682: [Blue] ~15360 levels ~122880 states ~954912 transitions
pins2lts-mc-linux64( 2/ 8), 15.423: [Blue] ~30720 levels ~245760 states ~1414576 transitions
pins2lts-mc-linux64( 2/ 8), 28.980: [Blue] ~61440 levels ~491520 states ~2822096 transitions
pins2lts-mc-linux64( 2/ 8), 56.463: [Blue] ~122880 levels ~983040 states ~5637184 transitions
pins2lts-mc-linux64( 2/ 8), 110.747: [Blue] ~245760 levels ~1966080 states ~11267320 transitions
pins2lts-mc-linux64( 6/ 8), 134.072: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 134.444:
pins2lts-mc-linux64( 0/ 8), 134.444: Explored 2245373 states 18007247 transitions, fanout: 8.020
pins2lts-mc-linux64( 0/ 8), 134.444: Total exploration time 133.990 sec (133.630 sec minimum, 133.762 sec on average)
pins2lts-mc-linux64( 0/ 8), 134.444: States per second: 16758, Transitions per second: 134392
pins2lts-mc-linux64( 0/ 8), 134.444:
pins2lts-mc-linux64( 0/ 8), 134.444: State space has 17682851 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 134.444: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 134.444: blue states: 2245373 (12.70%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 134.444: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 134.444: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 134.445:
pins2lts-mc-linux64( 0/ 8), 134.445: Total memory used for local state coloring: 34.3MB
pins2lts-mc-linux64( 0/ 8), 134.445:
pins2lts-mc-linux64( 0/ 8), 134.445: Queue width: 8B, total height: 2245373, memory: 17.13MB
pins2lts-mc-linux64( 0/ 8), 134.445: Tree memory: 390.9MB, 23.2 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 134.445: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 134.445: Stored 2055 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 134.445: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 134.445: Est. total memory use: 408.0MB (~1041.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12365049970922189257;'/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' '<>(((LTLAPp0==true)&&X([](((LTLAPp0==true)||X(X(X([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12365049970922189257;'/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' '<>(((LTLAPp0==true)&&X([](((LTLAPp0==true)||X(X(X([]((LTLAPp1==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)
Detected timeout of ITS tools.
[2024-05-23 20:15:56] [INFO ] Flatten gal took : 41 ms
[2024-05-23 20:15:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality16316382158621053376.gal : 7 ms
[2024-05-23 20:15:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality17653397680650666034.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/LTLCardinality16316382158621053376.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17653397680650666034.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...299
Read 1 LTL properties
Checking formula 0 : !((F(("(l2172<2)")&&(X(G(("(l2172<2)")||(X(X(X(G("(l1982>0)")))))))))))
Formula 0 simplified : G(!"(l2172<2)" | XF(!"(l2172<2)" & XXXF!"(l1982>0)"))
ITS-tools command line returned an error code 137
[2024-05-23 20:26:58] [INFO ] Flatten gal took : 57 ms
[2024-05-23 20:26:58] [INFO ] Input system was already deterministic with 1830 transitions.
[2024-05-23 20:26:58] [INFO ] Transformed 703 places.
[2024-05-23 20:26:58] [INFO ] Transformed 1830 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 20:26:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality11835195123339146692.gal : 6 ms
[2024-05-23 20:26:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality10681295326057379340.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/LTLCardinality11835195123339146692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10681295326057379340.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(l2172<2)")&&(X(G(("(l2172<2)")||(X(X(X(G("(l1982>0)")))))))))))
Formula 0 simplified : G(!"(l2172<2)" | XF(!"(l2172<2)" & XXXF!"(l1982>0)"))

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-c128"
export BK_EXAMINATION="LTLCardinality"
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-c128, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603100323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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