About the Execution of ITS-Tools for FunctionPointer-PT-c002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFF??FTTFFFFTFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FunctionPointer-PT-c002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748817716854
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 22:41:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 22:41:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:42:00] [INFO ] Load time of PNML (sax parser for PT used): 897 ms
[2025-06-01 22:42:00] [INFO ] Transformed 2826 places.
[2025-06-01 22:42:00] [INFO ] Transformed 8960 transitions.
[2025-06-01 22:42:00] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 1158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 57 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c002-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 288 places :
Symmetric choice reduction at 1 with 288 rule applications. Total rules 305 place count 1323 transition count 3844
Iterating global reduction 1 with 288 rules applied. Total rules applied 593 place count 1323 transition count 3844
Ensure Unique test removed 458 transitions
Reduce isomorphic transitions removed 458 transitions.
Iterating post reduction 1 with 458 rules applied. Total rules applied 1051 place count 1323 transition count 3386
Discarding 145 places :
Symmetric choice reduction at 2 with 145 rule applications. Total rules 1196 place count 1178 transition count 3096
Iterating global reduction 2 with 145 rules applied. Total rules applied 1341 place count 1178 transition count 3096
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 1449 place count 1178 transition count 2988
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1462 place count 1165 transition count 2962
Iterating global reduction 3 with 13 rules applied. Total rules applied 1475 place count 1165 transition count 2962
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1488 place count 1152 transition count 2936
Iterating global reduction 3 with 13 rules applied. Total rules applied 1501 place count 1152 transition count 2936
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1514 place count 1139 transition count 2910
Iterating global reduction 3 with 13 rules applied. Total rules applied 1527 place count 1139 transition count 2910
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1540 place count 1126 transition count 2884
Iterating global reduction 3 with 13 rules applied. Total rules applied 1553 place count 1126 transition count 2884
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1565 place count 1114 transition count 2860
Iterating global reduction 3 with 12 rules applied. Total rules applied 1577 place count 1114 transition count 2860
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1589 place count 1102 transition count 2836
Iterating global reduction 3 with 12 rules applied. Total rules applied 1601 place count 1102 transition count 2836
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1613 place count 1090 transition count 2812
Iterating global reduction 3 with 12 rules applied. Total rules applied 1625 place count 1090 transition count 2812
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1674 place count 1041 transition count 2626
Iterating global reduction 3 with 49 rules applied. Total rules applied 1723 place count 1041 transition count 2626
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1772 place count 992 transition count 2430
Iterating global reduction 3 with 49 rules applied. Total rules applied 1821 place count 992 transition count 2430
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1870 place count 943 transition count 2322
Iterating global reduction 3 with 49 rules applied. Total rules applied 1919 place count 943 transition count 2322
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1968 place count 894 transition count 2224
Iterating global reduction 3 with 49 rules applied. Total rules applied 2017 place count 894 transition count 2224
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2066 place count 845 transition count 2126
Iterating global reduction 3 with 49 rules applied. Total rules applied 2115 place count 845 transition count 2126
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2164 place count 796 transition count 2028
Iterating global reduction 3 with 49 rules applied. Total rules applied 2213 place count 796 transition count 2028
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2261 place count 748 transition count 1932
Iterating global reduction 3 with 48 rules applied. Total rules applied 2309 place count 748 transition count 1932
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2314 place count 743 transition count 1922
Iterating global reduction 3 with 5 rules applied. Total rules applied 2319 place count 743 transition count 1922
Applied a total of 2319 rules in 2077 ms. Remains 743 /1628 variables (removed 885) and now considering 1922/5962 (removed 4040) transitions.
[2025-06-01 22:42:03] [INFO ] Flow matrix only has 1287 transitions (discarded 635 similar events)
// Phase 1: matrix 1287 rows 743 cols
[2025-06-01 22:42:03] [INFO ] Computed 2 invariants in 54 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:04] [INFO ] Implicit Places using invariants in 1580 ms returned []
[2025-06-01 22:42:04] [INFO ] Flow matrix only has 1287 transitions (discarded 635 similar events)
[2025-06-01 22:42:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:05] [INFO ] State equation strengthened by 308 read => feed constraints.
[2025-06-01 22:42:10] [INFO ] Implicit Places using invariants and state equation in 5872 ms returned []
Implicit Place search using SMT with State Equation took 7505 ms to find 0 implicit places.
Running 1920 sub problems to find dead transitions.
[2025-06-01 22:42:10] [INFO ] Flow matrix only has 1287 transitions (discarded 635 similar events)
[2025-06-01 22:42:10] [INFO ] Invariant cache hit.
[2025-06-01 22:42:10] [INFO ] State equation strengthened by 308 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
SMT process timed out in 35936ms, After SMT, problems are : Problem set: 0 solved, 1920 unsolved
Search for dead transitions found 0 dead transitions in 35991ms
Starting structural reductions in LTL mode, iteration 1 : 743/1628 places, 1922/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45629 ms. Remains : 743/1628 places, 1922/5962 transitions.
Support contains 22 out of 743 places after structural reductions.
[2025-06-01 22:42:47] [INFO ] Flatten gal took : 272 ms
[2025-06-01 22:42:47] [INFO ] Flatten gal took : 144 ms
[2025-06-01 22:42:47] [INFO ] Input system was already deterministic with 1922 transitions.
RANDOM walk for 40000 steps (9 resets) in 3158 ms. (12 steps per ms) remains 14/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
[2025-06-01 22:42:49] [INFO ] Flow matrix only has 1287 transitions (discarded 635 similar events)
[2025-06-01 22:42:49] [INFO ] Invariant cache hit.
[2025-06-01 22:42:49] [INFO ] State equation strengthened by 308 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 382/398 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 34/432 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 974/1406 variables, 432/434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1406 variables, 241/675 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1406 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 8 (OVERLAPS) 490/1896 variables, 197/872 constraints. Problems are: Problem set: 2 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1896 variables, 67/939 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1896 variables, 0/939 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 126/2022 variables, 109/1048 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2022 variables, 0/1048 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 7/2029 variables, 4/1052 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:42:53] [INFO ] Deduced a trap composed of 131 places in 744 ms of which 28 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2029 variables, 1/1053 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2029 variables, 0/1053 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/2030 variables, 1/1054 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2030/2030 variables, and 1054 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 743/743 constraints, ReadFeed: 308/308 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 34/46 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 651/697 variables, 46/47 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 17/64 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1069/1766 variables, 517/581 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1766 variables, 291/872 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1766 variables, 6/878 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:42:55] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:42:55] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1766 variables, 2/880 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1766 variables, 0/880 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 62/1828 variables, 1/881 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1828 variables, 1/882 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1828/2030 variables, and 882 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 563/743 constraints, ReadFeed: 308/308 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10150ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 736 transition count 1908
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 736 transition count 1908
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 736 transition count 1904
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 729 transition count 1888
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 729 transition count 1888
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 724 transition count 1870
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 724 transition count 1870
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 719 transition count 1854
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 719 transition count 1854
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 714 transition count 1844
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 714 transition count 1844
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 709 transition count 1832
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 709 transition count 1832
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 704 transition count 1820
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 704 transition count 1820
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 699 transition count 1810
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 699 transition count 1810
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 695 transition count 1802
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 695 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 694 transition count 1800
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 694 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 693 transition count 1798
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 693 transition count 1798
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 692 transition count 1796
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 692 transition count 1796
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 126 place count 692 transition count 1776
Applied a total of 126 rules in 1149 ms. Remains 692 /743 variables (removed 51) and now considering 1776/1922 (removed 146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1151 ms. Remains : 692/743 places, 1776/1922 transitions.
RANDOM walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 149534 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 7
Probabilistic random walk after 149534 steps, saw 97078 distinct states, run finished after 3008 ms. (steps per millisecond=49 ) properties seen :0
[2025-06-01 22:43:04] [INFO ] Flow matrix only has 1192 transitions (discarded 584 similar events)
// Phase 1: matrix 1192 rows 692 cols
[2025-06-01 22:43:04] [INFO ] Computed 2 invariants in 18 ms
[2025-06-01 22:43:04] [INFO ] State equation strengthened by 291 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 614/650 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1010/1660 variables, 500/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1660 variables, 279/828 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1660 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1722 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1722 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 155/1877 variables, 152/981 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1877 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 4/1881 variables, 2/983 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1881 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 3/1884 variables, 2/985 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1884 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1884 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1884/1884 variables, and 985 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 692/692 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 614/650 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1010/1660 variables, 500/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1660 variables, 279/828 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1660 variables, 7/835 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:08] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:08] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1660 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1660 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 62/1722 variables, 1/838 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:11] [INFO ] Deduced a trap composed of 131 places in 355 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1722 variables, 1/839 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:13] [INFO ] Deduced a trap along path composed of 3 places in 97 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:13] [INFO ] Deduced a trap along path composed of 3 places in 101 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:13] [INFO ] Deduced a trap along path composed of 3 places in 107 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:14] [INFO ] Deduced a trap along path composed of 3 places in 107 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:14] [INFO ] Deduced a trap along path composed of 3 places in 102 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:14] [INFO ] Deduced a trap along path composed of 3 places in 92 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:14] [INFO ] Deduced a trap along path composed of 3 places in 97 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:14] [INFO ] Deduced a trap along path composed of 3 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:14] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:15] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:15] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:15] [INFO ] Deduced a trap along path composed of 3 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:15] [INFO ] Deduced a trap along path composed of 3 places in 84 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:15] [INFO ] Deduced a trap along path composed of 3 places in 75 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:15] [INFO ] Deduced a trap along path composed of 3 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:16] [INFO ] Deduced a trap along path composed of 3 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:16] [INFO ] Deduced a trap along path composed of 3 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:16] [INFO ] Deduced a trap along path composed of 3 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:16] [INFO ] Deduced a trap along path composed of 3 places in 64 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:16] [INFO ] Deduced a trap along path composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1722 variables, 20/859 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:18] [INFO ] Deduced a trap along path composed of 3 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:18] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:18] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:18] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:18] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:18] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:18] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:18] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:19] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1722 variables, 17/876 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1722 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 155/1877 variables, 152/1028 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:25] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Problem AtomicPropp14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:25] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1877 variables, 2/1030 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1877 variables, 0/1030 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/1881 variables, 2/1032 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:30] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:30] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:30] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:30] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:30] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:30] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:30] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:31] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:31] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:32] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1881 variables, 10/1042 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:36] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1881 variables, 1/1043 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1881 variables, 0/1043 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 3/1884 variables, 2/1045 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:42] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:43] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:44] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:44] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:44] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:45] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:45] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:45] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:45] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:45] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:45] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:46] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1884 variables, 12/1057 constraints. Problems are: Problem set: 1 solved, 6 unsolved
(s407 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1884/1884 variables, and 1057 constraints, problems are : Problem set: 1 solved, 6 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 692/692 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 64/64 constraints]
After SMT, in 47682ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 690 transition count 1772
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 690 transition count 1772
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 688 transition count 1768
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 688 transition count 1768
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 686 transition count 1760
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 686 transition count 1760
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 684 transition count 1756
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 684 transition count 1756
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 682 transition count 1752
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 682 transition count 1752
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 680 transition count 1748
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 680 transition count 1748
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 678 transition count 1744
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 678 transition count 1744
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 676 transition count 1740
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 676 transition count 1740
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 674 transition count 1736
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 674 transition count 1736
Applied a total of 36 rules in 472 ms. Remains 674 /692 variables (removed 18) and now considering 1736/1776 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 674/692 places, 1736/1776 transitions.
RANDOM walk for 40002 steps (8 resets) in 652 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
[2025-06-01 22:43:52] [INFO ] Flow matrix only has 1164 transitions (discarded 572 similar events)
// Phase 1: matrix 1164 rows 674 cols
[2025-06-01 22:43:52] [INFO ] Computed 2 invariants in 12 ms
[2025-06-01 22:43:52] [INFO ] State equation strengthened by 285 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 20/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 392/419 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1191/1610 variables, 490/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1610 variables, 275/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1610 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 62/1672 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1672 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 157/1829 variables, 151/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1829 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/1835 variables, 4/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1835 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/1838 variables, 2/961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1838 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1838 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1838/1838 variables, and 961 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 674/674 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 20/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 392/419 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1191/1610 variables, 490/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1610 variables, 275/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1610 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:58] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:43:58] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1610 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1610 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 62/1672 variables, 1/810 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1672 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 157/1829 variables, 151/961 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:01] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:01] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:01] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1829 variables, 3/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:04] [INFO ] Deduced a trap composed of 131 places in 445 ms of which 25 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1829 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:05] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:05] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:05] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:05] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:06] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:06] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:06] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:06] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:06] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:08] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:08] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1829 variables, 11/976 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1829 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 6/1835 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1835 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 3/1838 variables, 2/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1838 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1838 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1838/1838 variables, and 982 constraints, problems are : Problem set: 0 solved, 4 unsolved in 18990 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 674/674 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 16/16 constraints]
After SMT, in 23257ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 319 ms.
Support contains 4 out of 674 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 674/674 places, 1736/1736 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 670 transition count 1726
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 670 transition count 1726
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 666 transition count 1718
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 666 transition count 1718
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 662 transition count 1706
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 662 transition count 1706
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 658 transition count 1698
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 658 transition count 1698
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 654 transition count 1690
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 654 transition count 1690
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 650 transition count 1682
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 650 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 646 transition count 1674
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 646 transition count 1674
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 643 transition count 1668
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 643 transition count 1668
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 640 transition count 1662
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 640 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 639 transition count 1660
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 639 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 638 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 638 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 637 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 637 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 636 transition count 1652
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 636 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 635 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 635 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 634 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 634 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 633 transition count 1646
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 633 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 632 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 632 transition count 1644
Applied a total of 84 rules in 749 ms. Remains 632 /674 variables (removed 42) and now considering 1644/1736 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 632/674 places, 1644/1736 transitions.
RANDOM walk for 40000 steps (8 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 208329 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 208329 steps, saw 135237 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2025-06-01 22:44:20] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2025-06-01 22:44:20] [INFO ] Computed 2 invariants in 19 ms
[2025-06-01 22:44:20] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1580 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1581 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 148/1729 variables, 141/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/1731 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1731 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1731/1731 variables, and 905 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1170/1518 variables, 484/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1518 variables, 271/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1518 variables, 2/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1518 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1580 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:24] [INFO ] Deduced a trap along path composed of 3 places in 195 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:24] [INFO ] Deduced a trap along path composed of 3 places in 172 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:25] [INFO ] Deduced a trap along path composed of 3 places in 181 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:25] [INFO ] Deduced a trap along path composed of 3 places in 178 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:25] [INFO ] Deduced a trap along path composed of 3 places in 176 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:25] [INFO ] Deduced a trap along path composed of 3 places in 174 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:26] [INFO ] Deduced a trap along path composed of 3 places in 173 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:26] [INFO ] Deduced a trap along path composed of 3 places in 166 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:26] [INFO ] Deduced a trap along path composed of 3 places in 157 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:26] [INFO ] Deduced a trap along path composed of 3 places in 156 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:27] [INFO ] Deduced a trap along path composed of 3 places in 184 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:27] [INFO ] Deduced a trap along path composed of 3 places in 129 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:27] [INFO ] Deduced a trap along path composed of 3 places in 129 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:27] [INFO ] Deduced a trap along path composed of 3 places in 125 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:27] [INFO ] Deduced a trap along path composed of 3 places in 155 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:28] [INFO ] Deduced a trap along path composed of 3 places in 143 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:28] [INFO ] Deduced a trap along path composed of 3 places in 116 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:28] [INFO ] Deduced a trap along path composed of 3 places in 140 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:28] [INFO ] Deduced a trap along path composed of 3 places in 110 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:28] [INFO ] Deduced a trap along path composed of 3 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 20/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:29] [INFO ] Deduced a trap along path composed of 3 places in 123 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:29] [INFO ] Deduced a trap along path composed of 3 places in 124 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:29] [INFO ] Deduced a trap along path composed of 3 places in 116 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:30] [INFO ] Deduced a trap along path composed of 3 places in 108 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:30] [INFO ] Deduced a trap along path composed of 3 places in 108 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:30] [INFO ] Deduced a trap along path composed of 3 places in 107 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:30] [INFO ] Deduced a trap along path composed of 3 places in 129 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:30] [INFO ] Deduced a trap along path composed of 3 places in 103 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:31] [INFO ] Deduced a trap along path composed of 3 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:31] [INFO ] Deduced a trap along path composed of 3 places in 97 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:31] [INFO ] Deduced a trap along path composed of 3 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:31] [INFO ] Deduced a trap along path composed of 3 places in 85 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:31] [INFO ] Deduced a trap along path composed of 3 places in 83 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:31] [INFO ] Deduced a trap along path composed of 3 places in 81 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:32] [INFO ] Deduced a trap along path composed of 3 places in 89 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:32] [INFO ] Deduced a trap along path composed of 3 places in 82 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:32] [INFO ] Deduced a trap along path composed of 3 places in 80 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:32] [INFO ] Deduced a trap along path composed of 3 places in 79 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:32] [INFO ] Deduced a trap along path composed of 3 places in 70 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:32] [INFO ] Deduced a trap along path composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1580 variables, 20/802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:33] [INFO ] Deduced a trap along path composed of 3 places in 67 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:33] [INFO ] Deduced a trap along path composed of 3 places in 70 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:33] [INFO ] Deduced a trap along path composed of 3 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:33] [INFO ] Deduced a trap along path composed of 3 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:34] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:34] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:34] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:34] [INFO ] Deduced a trap along path composed of 3 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:34] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:34] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:34] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:35] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:35] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:35] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:35] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:35] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:35] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:35] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:35] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:36] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1580 variables, 20/822 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:36] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:36] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1580 variables, 2/824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1580 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/1581 variables, 1/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1581 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1581 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 148/1729 variables, 141/967 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:38] [INFO ] Deduced a trap composed of 131 places in 354 ms of which 10 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1729 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:38] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:44:38] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1729 variables, 2/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1729 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1731 variables, 2/972 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1731 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1731 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1731/1731 variables, and 972 constraints, problems are : Problem set: 0 solved, 2 unsolved in 19278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 632/632 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 64/64 constraints]
After SMT, in 21074ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 120 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 632/632 places, 1644/1644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1644/1644 transitions.
Applied a total of 0 rules in 120 ms. Remains 632 /632 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2025-06-01 22:44:41] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-01 22:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:44:42] [INFO ] Implicit Places using invariants in 940 ms returned []
[2025-06-01 22:44:42] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-01 22:44:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:44:43] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-01 22:44:46] [INFO ] Implicit Places using invariants and state equation in 4165 ms returned []
Implicit Place search using SMT with State Equation took 5107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:44:46] [INFO ] Redundant transitions in 142 ms returned []
Running 1642 sub problems to find dead transitions.
[2025-06-01 22:44:46] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-01 22:44:46] [INFO ] Invariant cache hit.
[2025-06-01 22:44:46] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64339ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 64344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69727 ms. Remains : 632/632 places, 1644/1644 transitions.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA FunctionPointer-PT-c002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 2 out of 743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 728 transition count 1890
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 728 transition count 1890
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 728 transition count 1886
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 49 place count 713 transition count 1852
Iterating global reduction 1 with 15 rules applied. Total rules applied 64 place count 713 transition count 1852
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 700 transition count 1806
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 700 transition count 1806
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 103 place count 687 transition count 1762
Iterating global reduction 1 with 13 rules applied. Total rules applied 116 place count 687 transition count 1762
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 129 place count 674 transition count 1736
Iterating global reduction 1 with 13 rules applied. Total rules applied 142 place count 674 transition count 1736
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 155 place count 661 transition count 1708
Iterating global reduction 1 with 13 rules applied. Total rules applied 168 place count 661 transition count 1708
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 181 place count 648 transition count 1680
Iterating global reduction 1 with 13 rules applied. Total rules applied 194 place count 648 transition count 1680
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 206 place count 636 transition count 1656
Iterating global reduction 1 with 12 rules applied. Total rules applied 218 place count 636 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 229 place count 625 transition count 1634
Iterating global reduction 1 with 11 rules applied. Total rules applied 240 place count 625 transition count 1634
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 242 place count 623 transition count 1630
Iterating global reduction 1 with 2 rules applied. Total rules applied 244 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 246 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 248 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 250 place count 619 transition count 1618
Iterating global reduction 1 with 2 rules applied. Total rules applied 252 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 253 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 254 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 255 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 256 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 257 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 258 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 261 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 262 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 266 place count 614 transition count 1604
Applied a total of 266 rules in 1080 ms. Remains 614 /743 variables (removed 129) and now considering 1604/1922 (removed 318) transitions.
[2025-06-01 22:45:52] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2025-06-01 22:45:52] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:45:53] [INFO ] Implicit Places using invariants in 900 ms returned []
[2025-06-01 22:45:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-01 22:45:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:45:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-01 22:45:57] [INFO ] Implicit Places using invariants and state equation in 3431 ms returned []
Implicit Place search using SMT with State Equation took 4334 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:45:57] [INFO ] Redundant transitions in 140 ms returned []
Running 1602 sub problems to find dead transitions.
[2025-06-01 22:45:57] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-01 22:45:57] [INFO ] Invariant cache hit.
[2025-06-01 22:45:57] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63684ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63692ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/743 places, 1604/1922 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69256 ms. Remains : 614/743 places, 1604/1922 transitions.
Stuttering acceptance computed with spot in 266 ms :[p0, true, p0]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-01
Entered a terminal (fully accepting) state of product in 214 steps with 0 reset in 11 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-01 finished in 69649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 3 out of 743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 729 transition count 1892
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 729 transition count 1892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 729 transition count 1890
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 715 transition count 1860
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 715 transition count 1860
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 70 place count 703 transition count 1816
Iterating global reduction 1 with 12 rules applied. Total rules applied 82 place count 703 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 94 place count 691 transition count 1772
Iterating global reduction 1 with 12 rules applied. Total rules applied 106 place count 691 transition count 1772
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 118 place count 679 transition count 1748
Iterating global reduction 1 with 12 rules applied. Total rules applied 130 place count 679 transition count 1748
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 142 place count 667 transition count 1724
Iterating global reduction 1 with 12 rules applied. Total rules applied 154 place count 667 transition count 1724
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 166 place count 655 transition count 1700
Iterating global reduction 1 with 12 rules applied. Total rules applied 178 place count 655 transition count 1700
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 189 place count 644 transition count 1678
Iterating global reduction 1 with 11 rules applied. Total rules applied 200 place count 644 transition count 1678
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 211 place count 633 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 222 place count 633 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 223 place count 632 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 224 place count 632 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 225 place count 631 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 226 place count 631 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 227 place count 630 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 228 place count 630 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 229 place count 629 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 230 place count 629 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 231 place count 628 transition count 1642
Iterating global reduction 1 with 1 rules applied. Total rules applied 232 place count 628 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 233 place count 627 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 234 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 235 place count 626 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 236 place count 626 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 237 place count 625 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 238 place count 625 transition count 1636
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 244 place count 625 transition count 1630
Applied a total of 244 rules in 700 ms. Remains 625 /743 variables (removed 118) and now considering 1630/1922 (removed 292) transitions.
[2025-06-01 22:47:01] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 625 cols
[2025-06-01 22:47:01] [INFO ] Computed 2 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:47:02] [INFO ] Implicit Places using invariants in 900 ms returned []
[2025-06-01 22:47:02] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2025-06-01 22:47:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:47:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-01 22:47:07] [INFO ] Implicit Places using invariants and state equation in 4227 ms returned []
Implicit Place search using SMT with State Equation took 5129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:47:07] [INFO ] Redundant transitions in 61 ms returned []
Running 1628 sub problems to find dead transitions.
[2025-06-01 22:47:07] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2025-06-01 22:47:07] [INFO ] Invariant cache hit.
[2025-06-01 22:47:07] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 7.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1713 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/625 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1713 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/625 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63749ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 63755ms
Starting structural reductions in SI_LTL mode, iteration 1 : 625/743 places, 1630/1922 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69657 ms. Remains : 625/743 places, 1630/1922 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 1019 ms.
Stack based approach found an accepted trace after 274 steps with 1 reset with depth 175 and stack size 175 in 4 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-02 finished in 70908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 728 transition count 1892
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 728 transition count 1892
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 728 transition count 1888
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 49 place count 713 transition count 1856
Iterating global reduction 1 with 15 rules applied. Total rules applied 64 place count 713 transition count 1856
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 700 transition count 1808
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 700 transition count 1808
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 103 place count 687 transition count 1762
Iterating global reduction 1 with 13 rules applied. Total rules applied 116 place count 687 transition count 1762
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 129 place count 674 transition count 1736
Iterating global reduction 1 with 13 rules applied. Total rules applied 142 place count 674 transition count 1736
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 155 place count 661 transition count 1708
Iterating global reduction 1 with 13 rules applied. Total rules applied 168 place count 661 transition count 1708
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 181 place count 648 transition count 1680
Iterating global reduction 1 with 13 rules applied. Total rules applied 194 place count 648 transition count 1680
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 207 place count 635 transition count 1654
Iterating global reduction 1 with 13 rules applied. Total rules applied 220 place count 635 transition count 1654
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 232 place count 623 transition count 1630
Iterating global reduction 1 with 12 rules applied. Total rules applied 244 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 246 place count 621 transition count 1626
Iterating global reduction 1 with 2 rules applied. Total rules applied 248 place count 621 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 250 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 252 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 254 place count 617 transition count 1614
Iterating global reduction 1 with 2 rules applied. Total rules applied 256 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 257 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 258 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 261 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 262 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 263 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 264 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 265 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 266 place count 612 transition count 1604
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 268 place count 612 transition count 1602
Applied a total of 268 rules in 758 ms. Remains 612 /743 variables (removed 131) and now considering 1602/1922 (removed 320) transitions.
[2025-06-01 22:48:12] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2025-06-01 22:48:12] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:48:13] [INFO ] Implicit Places using invariants in 945 ms returned []
[2025-06-01 22:48:13] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-01 22:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:48:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-01 22:48:17] [INFO ] Implicit Places using invariants and state equation in 3404 ms returned []
Implicit Place search using SMT with State Equation took 4352 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:48:17] [INFO ] Redundant transitions in 51 ms returned []
Running 1600 sub problems to find dead transitions.
[2025-06-01 22:48:17] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-01 22:48:17] [INFO ] Invariant cache hit.
[2025-06-01 22:48:17] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63665ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 63670ms
Starting structural reductions in SI_LTL mode, iteration 1 : 612/743 places, 1602/1922 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68841 ms. Remains : 612/743 places, 1602/1922 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 686 ms.
Product exploration explored 100000 steps with 0 reset in 806 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40002 steps (8 resets) in 511 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290133 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290133 steps, saw 188329 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-06-01 22:49:25] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-01 22:49:25] [INFO ] Invariant cache hit.
[2025-06-01 22:49:25] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/1676 variables, 134/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1676 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1682 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1682/1682 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1682 variables, and 740 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1835 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 473/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2802ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1602/1602 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1600
Applied a total of 2 rules in 184 ms. Remains 612 /612 variables (removed 0) and now considering 1600/1602 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 612/612 places, 1600/1602 transitions.
RANDOM walk for 40000 steps (8 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 298111 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 298111 steps, saw 193504 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2025-06-01 22:49:32] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
// Phase 1: matrix 1069 rows 612 cols
[2025-06-01 22:49:32] [INFO ] Computed 2 invariants in 7 ms
[2025-06-01 22:49:32] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1476 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1476 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1476 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1538 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/1675 variables, 134/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1675 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1681 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1681/1681 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1476 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1476 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1476 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1476 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1538 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1539 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1539 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 136/1675 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:35] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:35] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:49:35] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1675 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1675 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1681 variables, 4/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1681 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1681 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1681/1681 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5693ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 1602/1602 transitions.
Applied a total of 0 rules in 123 ms. Remains 612 /612 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2025-06-01 22:49:38] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2025-06-01 22:49:38] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:49:38] [INFO ] Implicit Places using invariants in 839 ms returned []
[2025-06-01 22:49:38] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-01 22:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:49:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-01 22:49:42] [INFO ] Implicit Places using invariants and state equation in 3355 ms returned []
Implicit Place search using SMT with State Equation took 4196 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:49:42] [INFO ] Redundant transitions in 50 ms returned []
Running 1600 sub problems to find dead transitions.
[2025-06-01 22:49:42] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-01 22:49:42] [INFO ] Invariant cache hit.
[2025-06-01 22:49:42] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 5)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63685ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 63689ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68069 ms. Remains : 612/612 places, 1602/1602 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 317127 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 317127 steps, saw 205846 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2025-06-01 22:50:49] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-01 22:50:49] [INFO ] Invariant cache hit.
[2025-06-01 22:50:49] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/1676 variables, 134/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1676 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1682 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1682/1682 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/1682 variables, and 740 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 473/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2393ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1602/1602 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1600
Applied a total of 2 rules in 175 ms. Remains 612 /612 variables (removed 0) and now considering 1600/1602 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 612/612 places, 1600/1602 transitions.
RANDOM walk for 40000 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 300694 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 300694 steps, saw 195183 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2025-06-01 22:50:55] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
// Phase 1: matrix 1069 rows 612 cols
[2025-06-01 22:50:55] [INFO ] Computed 2 invariants in 6 ms
[2025-06-01 22:50:55] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1476 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1476 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1476 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1538 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/1675 variables, 134/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1675 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1681 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1681/1681 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1476 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1476 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1476 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1476 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1538 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1539 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1539 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 136/1675 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:50:57] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:50:58] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:50:58] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1675 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1675 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1681 variables, 4/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1681 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1681 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1681/1681 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5395ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 857 ms.
Product exploration explored 100000 steps with 0 reset in 778 ms.
Built C files in :
/tmp/ltsmin1491736252073284722
[2025-06-01 22:51:02] [INFO ] Too many transitions (1602) to apply POR reductions. Disabling POR matrices.
[2025-06-01 22:51:02] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1491736252073284722
Running compilation step : cd /tmp/ltsmin1491736252073284722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin1491736252073284722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin1491736252073284722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 1602/1602 transitions.
Applied a total of 0 rules in 95 ms. Remains 612 /612 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2025-06-01 22:51:05] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2025-06-01 22:51:05] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:51:06] [INFO ] Implicit Places using invariants in 842 ms returned []
[2025-06-01 22:51:06] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-01 22:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:51:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-01 22:51:10] [INFO ] Implicit Places using invariants and state equation in 3454 ms returned []
Implicit Place search using SMT with State Equation took 4298 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:51:10] [INFO ] Redundant transitions in 50 ms returned []
Running 1600 sub problems to find dead transitions.
[2025-06-01 22:51:10] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-01 22:51:10] [INFO ] Invariant cache hit.
[2025-06-01 22:51:10] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63337ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 63346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67800 ms. Remains : 612/612 places, 1602/1602 transitions.
Built C files in :
/tmp/ltsmin9205835147000522267
[2025-06-01 22:52:13] [INFO ] Too many transitions (1602) to apply POR reductions. Disabling POR matrices.
[2025-06-01 22:52:13] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9205835147000522267
Running compilation step : cd /tmp/ltsmin9205835147000522267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin9205835147000522267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin9205835147000522267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
[2025-06-01 22:52:16] [INFO ] Flatten gal took : 75 ms
[2025-06-01 22:52:16] [INFO ] Flatten gal took : 77 ms
[2025-06-01 22:52:16] [INFO ] Time to serialize gal into /tmp/LTL4989782653823067889.gal : 27 ms
[2025-06-01 22:52:17] [INFO ] Time to serialize properties into /tmp/LTL7283078002840027618.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4989782653823067889.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5402324033722154161.hoa' '-atoms' '/tmp/LTL7283078002840027618.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7283078002840027618.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5402324033722154161.hoa
Detected timeout of ITS tools.
[2025-06-01 22:52:32] [INFO ] Flatten gal took : 64 ms
[2025-06-01 22:52:32] [INFO ] Flatten gal took : 66 ms
[2025-06-01 22:52:32] [INFO ] Time to serialize gal into /tmp/LTL81028155199045172.gal : 18 ms
[2025-06-01 22:52:32] [INFO ] Time to serialize properties into /tmp/LTL13234518236393739531.ltl : 3 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL81028155199045172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13234518236393739531.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("((s0<1)||(l1501<1))"))))
Formula 0 simplified : FG!"((s0<1)||(l1501<1))"
Detected timeout of ITS tools.
[2025-06-01 22:52:47] [INFO ] Flatten gal took : 53 ms
[2025-06-01 22:52:47] [INFO ] Applying decomposition
[2025-06-01 22:52:47] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10426072583757059980.txt' '-o' '/tmp/graph10426072583757059980.bin' '-w' '/tmp/graph10426072583757059980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10426072583757059980.bin' '-l' '-1' '-v' '-w' '/tmp/graph10426072583757059980.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:52:47] [INFO ] Decomposing Gal with order
[2025-06-01 22:52:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:52:48] [INFO ] Removed a total of 2652 redundant transitions.
[2025-06-01 22:52:48] [INFO ] Flatten gal took : 359 ms
[2025-06-01 22:52:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1119 labels/synchronizations in 140 ms.
[2025-06-01 22:52:48] [INFO ] Time to serialize gal into /tmp/LTL13716212902806872368.gal : 20 ms
[2025-06-01 22:52:48] [INFO ] Time to serialize properties into /tmp/LTL8240700231535783794.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13716212902806872368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8240700231535783794.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.s0<1)||(i27.i0.u147.l1501<1))"))))
Formula 0 simplified : FG!"((i0.u0.s0<1)||(i27.i0.u147.l1501<1))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c002-LTLFireability-03 finished in 291370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 728 transition count 1890
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 728 transition count 1890
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 728 transition count 1888
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 47 place count 713 transition count 1854
Iterating global reduction 1 with 15 rules applied. Total rules applied 62 place count 713 transition count 1854
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 76 place count 699 transition count 1804
Iterating global reduction 1 with 14 rules applied. Total rules applied 90 place count 699 transition count 1804
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 104 place count 685 transition count 1756
Iterating global reduction 1 with 14 rules applied. Total rules applied 118 place count 685 transition count 1756
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 132 place count 671 transition count 1728
Iterating global reduction 1 with 14 rules applied. Total rules applied 146 place count 671 transition count 1728
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 160 place count 657 transition count 1698
Iterating global reduction 1 with 14 rules applied. Total rules applied 174 place count 657 transition count 1698
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 188 place count 643 transition count 1668
Iterating global reduction 1 with 14 rules applied. Total rules applied 202 place count 643 transition count 1668
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 215 place count 630 transition count 1642
Iterating global reduction 1 with 13 rules applied. Total rules applied 228 place count 630 transition count 1642
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 240 place count 618 transition count 1618
Iterating global reduction 1 with 12 rules applied. Total rules applied 252 place count 618 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 254 place count 616 transition count 1614
Iterating global reduction 1 with 2 rules applied. Total rules applied 256 place count 616 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 258 place count 614 transition count 1608
Iterating global reduction 1 with 2 rules applied. Total rules applied 260 place count 614 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 262 place count 612 transition count 1602
Iterating global reduction 1 with 2 rules applied. Total rules applied 264 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 265 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 266 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 267 place count 610 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 268 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 269 place count 609 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 270 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 271 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 272 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 273 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 274 place count 607 transition count 1592
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 276 place count 607 transition count 1590
Applied a total of 276 rules in 802 ms. Remains 607 /743 variables (removed 136) and now considering 1590/1922 (removed 332) transitions.
[2025-06-01 22:53:04] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2025-06-01 22:53:04] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:53:05] [INFO ] Implicit Places using invariants in 984 ms returned []
[2025-06-01 22:53:05] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2025-06-01 22:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:53:05] [INFO ] State equation strengthened by 264 read => feed constraints.
[2025-06-01 22:53:08] [INFO ] Implicit Places using invariants and state equation in 3652 ms returned []
Implicit Place search using SMT with State Equation took 4640 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:53:08] [INFO ] Redundant transitions in 49 ms returned []
Running 1588 sub problems to find dead transitions.
[2025-06-01 22:53:08] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2025-06-01 22:53:08] [INFO ] Invariant cache hit.
[2025-06-01 22:53:08] [INFO ] State equation strengthened by 264 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1669 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/1669 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 0/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63473ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 63476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 607/743 places, 1590/1922 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68978 ms. Remains : 607/743 places, 1590/1922 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 853 ms.
Product exploration explored 100000 steps with 0 reset in 731 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 30040 steps (6 resets) in 239 ms. (125 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 607/607 places, 1590/1590 transitions.
Applied a total of 0 rules in 163 ms. Remains 607 /607 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2025-06-01 22:54:14] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2025-06-01 22:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:54:15] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2025-06-01 22:54:15] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2025-06-01 22:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:54:16] [INFO ] State equation strengthened by 264 read => feed constraints.
[2025-06-01 22:54:19] [INFO ] Implicit Places using invariants and state equation in 3843 ms returned []
Implicit Place search using SMT with State Equation took 4932 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:54:19] [INFO ] Redundant transitions in 48 ms returned []
Running 1588 sub problems to find dead transitions.
[2025-06-01 22:54:19] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2025-06-01 22:54:19] [INFO ] Invariant cache hit.
[2025-06-01 22:54:19] [INFO ] State equation strengthened by 264 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1669 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/1669 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 0/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63590ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 63593ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68746 ms. Remains : 607/607 places, 1590/1590 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 402 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 289244 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 289244 steps, saw 187750 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-06-01 22:55:26] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2025-06-01 22:55:26] [INFO ] Invariant cache hit.
[2025-06-01 22:55:26] [INFO ] State equation strengthened by 264 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 268/270 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1061/1331 variables, 401/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1331 variables, 200/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1393 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1393 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1394 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1394 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1394 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 261/1655 variables, 195/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1655 variables, 64/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1655 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1663 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1663 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1669 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1669 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1669 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1669/1669 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 268/270 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1061/1331 variables, 401/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1331 variables, 200/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:28] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1331 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1393 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:29] [INFO ] Deduced a trap along path composed of 3 places in 186 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:29] [INFO ] Deduced a trap along path composed of 3 places in 174 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:29] [INFO ] Deduced a trap along path composed of 3 places in 178 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:30] [INFO ] Deduced a trap along path composed of 3 places in 175 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:30] [INFO ] Deduced a trap along path composed of 3 places in 167 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:30] [INFO ] Deduced a trap along path composed of 3 places in 138 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:30] [INFO ] Deduced a trap along path composed of 3 places in 166 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:30] [INFO ] Deduced a trap along path composed of 3 places in 132 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:31] [INFO ] Deduced a trap along path composed of 3 places in 151 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:31] [INFO ] Deduced a trap along path composed of 3 places in 149 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:31] [INFO ] Deduced a trap along path composed of 3 places in 144 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:31] [INFO ] Deduced a trap along path composed of 3 places in 122 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:32] [INFO ] Deduced a trap along path composed of 3 places in 143 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:32] [INFO ] Deduced a trap along path composed of 3 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:32] [INFO ] Deduced a trap along path composed of 3 places in 136 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:32] [INFO ] Deduced a trap along path composed of 3 places in 114 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:32] [INFO ] Deduced a trap along path composed of 3 places in 132 ms of which 2 ms to minimize.
SMT process timed out in 6118ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 214 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1590/1590 transitions.
Graph (complete) has 2655 edges and 607 vertex of which 415 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 1206
Applied a total of 385 rules in 108 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1590 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 415/607 places, 1206/1590 transitions.
RANDOM walk for 40000 steps (8 resets) in 322 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 332467 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332467 steps, saw 203873 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2025-06-01 22:55:36] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2025-06-01 22:55:36] [INFO ] Computed 3 invariants in 4 ms
[2025-06-01 22:55:36] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 342/353 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 598/951 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 72/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/951 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1013 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1013 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 68/1081 variables, 66/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1089 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1089 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1095 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1095 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 342/353 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 598/951 variables, 330/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 72/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/951 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1013 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:37] [INFO ] Deduced a trap along path composed of 3 places in 175 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:38] [INFO ] Deduced a trap along path composed of 3 places in 137 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:38] [INFO ] Deduced a trap along path composed of 3 places in 184 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:38] [INFO ] Deduced a trap along path composed of 3 places in 178 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:38] [INFO ] Deduced a trap along path composed of 3 places in 184 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:39] [INFO ] Deduced a trap along path composed of 3 places in 175 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:39] [INFO ] Deduced a trap along path composed of 3 places in 169 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:39] [INFO ] Deduced a trap along path composed of 3 places in 159 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:39] [INFO ] Deduced a trap along path composed of 3 places in 152 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:39] [INFO ] Deduced a trap along path composed of 3 places in 153 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:40] [INFO ] Deduced a trap along path composed of 3 places in 126 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:40] [INFO ] Deduced a trap along path composed of 3 places in 139 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:40] [INFO ] Deduced a trap along path composed of 3 places in 136 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:40] [INFO ] Deduced a trap along path composed of 3 places in 121 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:40] [INFO ] Deduced a trap along path composed of 3 places in 119 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:41] [INFO ] Deduced a trap along path composed of 3 places in 135 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:41] [INFO ] Deduced a trap along path composed of 3 places in 112 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:41] [INFO ] Deduced a trap along path composed of 3 places in 130 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:41] [INFO ] Deduced a trap along path composed of 3 places in 109 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:41] [INFO ] Deduced a trap along path composed of 3 places in 123 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1013 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:42] [INFO ] Deduced a trap along path composed of 3 places in 118 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:42] [INFO ] Deduced a trap along path composed of 3 places in 103 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:42] [INFO ] Deduced a trap along path composed of 3 places in 102 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:42] [INFO ] Deduced a trap along path composed of 3 places in 116 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:42] [INFO ] Deduced a trap along path composed of 3 places in 105 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:43] [INFO ] Deduced a trap along path composed of 3 places in 96 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:43] [INFO ] Deduced a trap along path composed of 3 places in 93 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:44] [INFO ] Deduced a trap along path composed of 3 places in 92 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:44] [INFO ] Deduced a trap along path composed of 3 places in 96 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:44] [INFO ] Deduced a trap along path composed of 3 places in 90 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:44] [INFO ] Deduced a trap along path composed of 3 places in 91 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:44] [INFO ] Deduced a trap along path composed of 3 places in 91 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:44] [INFO ] Deduced a trap along path composed of 3 places in 90 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:45] [INFO ] Deduced a trap along path composed of 3 places in 81 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:45] [INFO ] Deduced a trap along path composed of 3 places in 78 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:45] [INFO ] Deduced a trap along path composed of 3 places in 75 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:45] [INFO ] Deduced a trap along path composed of 3 places in 73 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:45] [INFO ] Deduced a trap along path composed of 3 places in 70 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:45] [INFO ] Deduced a trap along path composed of 3 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:45] [INFO ] Deduced a trap along path composed of 3 places in 66 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1013 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:46] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:46] [INFO ] Deduced a trap along path composed of 3 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:46] [INFO ] Deduced a trap along path composed of 3 places in 62 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:46] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:46] [INFO ] Deduced a trap along path composed of 3 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:46] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:47] [INFO ] Deduced a trap along path composed of 3 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:47] [INFO ] Deduced a trap along path composed of 3 places in 53 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:47] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:47] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:47] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:47] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:47] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:47] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:48] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:48] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:48] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:48] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:48] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:48] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1013 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:48] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:49] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:55:49] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1013 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1013 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1081 variables, 66/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1081 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1089 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1089 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1095 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1095 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1095 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13658 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 415/415 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 63/63 constraints]
After SMT, in 14137ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1271 steps, including 148 resets, run visited all 1 properties in 6 ms. (steps per millisecond=211 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 795 ms.
Product exploration explored 100000 steps with 0 reset in 632 ms.
Built C files in :
/tmp/ltsmin3024766626134946486
[2025-06-01 22:55:52] [INFO ] Too many transitions (1590) to apply POR reductions. Disabling POR matrices.
[2025-06-01 22:55:52] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3024766626134946486
Running compilation step : cd /tmp/ltsmin3024766626134946486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin3024766626134946486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin3024766626134946486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 607/607 places, 1590/1590 transitions.
Applied a total of 0 rules in 111 ms. Remains 607 /607 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2025-06-01 22:55:55] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2025-06-01 22:55:55] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:56] [INFO ] Implicit Places using invariants in 813 ms returned []
[2025-06-01 22:55:56] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2025-06-01 22:55:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:56] [INFO ] State equation strengthened by 264 read => feed constraints.
[2025-06-01 22:55:59] [INFO ] Implicit Places using invariants and state equation in 3533 ms returned []
Implicit Place search using SMT with State Equation took 4347 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:55:59] [INFO ] Redundant transitions in 51 ms returned []
Running 1588 sub problems to find dead transitions.
[2025-06-01 22:55:59] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2025-06-01 22:55:59] [INFO ] Invariant cache hit.
[2025-06-01 22:55:59] [INFO ] State equation strengthened by 264 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
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 607/1669 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
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 Int declared 607/1669 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 0/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63465ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 63468ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67986 ms. Remains : 607/607 places, 1590/1590 transitions.
Built C files in :
/tmp/ltsmin9425252362156783468
[2025-06-01 22:57:03] [INFO ] Too many transitions (1590) to apply POR reductions. Disabling POR matrices.
[2025-06-01 22:57:03] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9425252362156783468
Running compilation step : cd /tmp/ltsmin9425252362156783468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin9425252362156783468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin9425252362156783468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
[2025-06-01 22:57:06] [INFO ] Flatten gal took : 48 ms
[2025-06-01 22:57:06] [INFO ] Flatten gal took : 45 ms
[2025-06-01 22:57:06] [INFO ] Time to serialize gal into /tmp/LTL8527151870027536043.gal : 13 ms
[2025-06-01 22:57:06] [INFO ] Time to serialize properties into /tmp/LTL7782587179328382679.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8527151870027536043.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8152464095599062972.hoa' '-atoms' '/tmp/LTL7782587179328382679.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7782587179328382679.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8152464095599062972.hoa
Detected timeout of ITS tools.
[2025-06-01 22:57:21] [INFO ] Flatten gal took : 40 ms
[2025-06-01 22:57:21] [INFO ] Flatten gal took : 42 ms
[2025-06-01 22:57:21] [INFO ] Time to serialize gal into /tmp/LTL10377404736159531794.gal : 8 ms
[2025-06-01 22:57:21] [INFO ] Time to serialize properties into /tmp/LTL118188079172632132.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10377404736159531794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL118188079172632132.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l1171<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l1171<1))"
Detected timeout of ITS tools.
[2025-06-01 22:57:36] [INFO ] Flatten gal took : 39 ms
[2025-06-01 22:57:36] [INFO ] Applying decomposition
[2025-06-01 22:57:36] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph14197911476798665652.txt' '-o' '/tmp/graph14197911476798665652.bin' '-w' '/tmp/graph14197911476798665652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14197911476798665652.bin' '-l' '-1' '-v' '-w' '/tmp/graph14197911476798665652.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:57:36] [INFO ] Decomposing Gal with order
[2025-06-01 22:57:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:57:37] [INFO ] Removed a total of 2629 redundant transitions.
[2025-06-01 22:57:37] [INFO ] Flatten gal took : 155 ms
[2025-06-01 22:57:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1086 labels/synchronizations in 165 ms.
[2025-06-01 22:57:37] [INFO ] Time to serialize gal into /tmp/LTL7186061100125836754.gal : 14 ms
[2025-06-01 22:57:37] [INFO ] Time to serialize properties into /tmp/LTL12830322618082663097.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7186061100125836754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12830322618082663097.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i6.u1.s1<1)||(i0.u142.l1171<1))"))))
Formula 0 simplified : GF!"((i6.u1.s1<1)||(i0.u142.l1171<1))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c002-LTLFireability-04 finished in 288943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!p0)))'
Support contains 2 out of 743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 728 transition count 1890
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 728 transition count 1890
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 728 transition count 1886
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 49 place count 713 transition count 1852
Iterating global reduction 1 with 15 rules applied. Total rules applied 64 place count 713 transition count 1852
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 700 transition count 1806
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 700 transition count 1806
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 103 place count 687 transition count 1762
Iterating global reduction 1 with 13 rules applied. Total rules applied 116 place count 687 transition count 1762
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 129 place count 674 transition count 1736
Iterating global reduction 1 with 13 rules applied. Total rules applied 142 place count 674 transition count 1736
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 155 place count 661 transition count 1708
Iterating global reduction 1 with 13 rules applied. Total rules applied 168 place count 661 transition count 1708
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 181 place count 648 transition count 1680
Iterating global reduction 1 with 13 rules applied. Total rules applied 194 place count 648 transition count 1680
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 206 place count 636 transition count 1656
Iterating global reduction 1 with 12 rules applied. Total rules applied 218 place count 636 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 229 place count 625 transition count 1634
Iterating global reduction 1 with 11 rules applied. Total rules applied 240 place count 625 transition count 1634
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 242 place count 623 transition count 1630
Iterating global reduction 1 with 2 rules applied. Total rules applied 244 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 246 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 248 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 250 place count 619 transition count 1618
Iterating global reduction 1 with 2 rules applied. Total rules applied 252 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 253 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 254 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 255 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 256 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 257 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 258 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 261 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 262 place count 614 transition count 1608
Applied a total of 262 rules in 362 ms. Remains 614 /743 variables (removed 129) and now considering 1608/1922 (removed 314) transitions.
[2025-06-01 22:57:52] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2025-06-01 22:57:52] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:57:53] [INFO ] Implicit Places using invariants in 973 ms returned []
[2025-06-01 22:57:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-01 22:57:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:57:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-01 22:57:58] [INFO ] Implicit Places using invariants and state equation in 4262 ms returned []
Implicit Place search using SMT with State Equation took 5241 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-01 22:57:58] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-01 22:57:58] [INFO ] Invariant cache hit.
[2025-06-01 22:57:58] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 30048 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 5)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30052 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: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63905ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 63910ms
Starting structural reductions in LTL mode, iteration 1 : 614/743 places, 1608/1922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69517 ms. Remains : 614/743 places, 1608/1922 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, p0, true, p0]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 1063 ms.
Product exploration explored 100000 steps with 33333 reset in 822 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c002-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLFireability-06 finished in 71608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 729 transition count 1892
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 729 transition count 1892
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 729 transition count 1888
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 715 transition count 1856
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 715 transition count 1856
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 703 transition count 1812
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 703 transition count 1812
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 691 transition count 1770
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 691 transition count 1770
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 679 transition count 1746
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 679 transition count 1746
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 667 transition count 1720
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 667 transition count 1720
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 655 transition count 1694
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 655 transition count 1694
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 644 transition count 1672
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 644 transition count 1672
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 212 place count 634 transition count 1652
Iterating global reduction 1 with 10 rules applied. Total rules applied 222 place count 634 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 223 place count 633 transition count 1650
Iterating global reduction 1 with 1 rules applied. Total rules applied 224 place count 633 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 225 place count 632 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 226 place count 632 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 227 place count 631 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 228 place count 631 transition count 1646
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 234 place count 631 transition count 1640
Applied a total of 234 rules in 720 ms. Remains 631 /743 variables (removed 112) and now considering 1640/1922 (removed 282) transitions.
[2025-06-01 22:59:04] [INFO ] Flow matrix only has 1096 transitions (discarded 544 similar events)
// Phase 1: matrix 1096 rows 631 cols
[2025-06-01 22:59:04] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:59:05] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2025-06-01 22:59:05] [INFO ] Flow matrix only has 1096 transitions (discarded 544 similar events)
[2025-06-01 22:59:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:59:06] [INFO ] State equation strengthened by 270 read => feed constraints.
[2025-06-01 22:59:09] [INFO ] Implicit Places using invariants and state equation in 4068 ms returned []
Implicit Place search using SMT with State Equation took 5075 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:59:09] [INFO ] Redundant transitions in 53 ms returned []
Running 1638 sub problems to find dead transitions.
[2025-06-01 22:59:09] [INFO ] Flow matrix only has 1096 transitions (discarded 544 similar events)
[2025-06-01 22:59:09] [INFO ] Invariant cache hit.
[2025-06-01 22:59:09] [INFO ] State equation strengthened by 270 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
SMT process timed out in 33853ms, After SMT, problems are : Problem set: 0 solved, 1638 unsolved
Search for dead transitions found 0 dead transitions in 33856ms
Starting structural reductions in SI_LTL mode, iteration 1 : 631/743 places, 1640/1922 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39715 ms. Remains : 631/743 places, 1640/1922 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 942 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-08 finished in 40782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&X((p1 U (p2||G(p1))))))&&p0)))'
Support contains 5 out of 743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 729 transition count 1892
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 729 transition count 1892
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 729 transition count 1888
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 715 transition count 1856
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 715 transition count 1856
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 703 transition count 1814
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 703 transition count 1814
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 691 transition count 1774
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 691 transition count 1774
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 679 transition count 1750
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 679 transition count 1750
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 667 transition count 1724
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 667 transition count 1724
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 655 transition count 1698
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 655 transition count 1698
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 644 transition count 1676
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 644 transition count 1676
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 212 place count 634 transition count 1656
Iterating global reduction 1 with 10 rules applied. Total rules applied 222 place count 634 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 224 place count 632 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 226 place count 632 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 228 place count 630 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 230 place count 630 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 232 place count 628 transition count 1640
Iterating global reduction 1 with 2 rules applied. Total rules applied 234 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 235 place count 627 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 236 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 237 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 238 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 241 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 242 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 623 transition count 1630
Applied a total of 244 rules in 386 ms. Remains 623 /743 variables (removed 120) and now considering 1630/1922 (removed 292) transitions.
[2025-06-01 22:59:45] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2025-06-01 22:59:45] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:59:46] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2025-06-01 22:59:46] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2025-06-01 22:59:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:59:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-01 22:59:49] [INFO ] Implicit Places using invariants and state equation in 3354 ms returned []
Implicit Place search using SMT with State Equation took 4361 ms to find 0 implicit places.
Running 1628 sub problems to find dead transitions.
[2025-06-01 22:59:49] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2025-06-01 22:59:49] [INFO ] Invariant cache hit.
[2025-06-01 22:59:49] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63991ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 63994ms
Starting structural reductions in LTL mode, iteration 1 : 623/743 places, 1630/1922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68745 ms. Remains : 623/743 places, 1630/1922 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-13 finished in 69017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 1922/1922 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 729 transition count 1892
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 729 transition count 1892
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 729 transition count 1888
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 46 place count 715 transition count 1856
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 715 transition count 1856
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 703 transition count 1814
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 703 transition count 1814
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 691 transition count 1774
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 691 transition count 1774
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 679 transition count 1750
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 679 transition count 1750
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 667 transition count 1724
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 667 transition count 1724
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 655 transition count 1698
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 655 transition count 1698
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 644 transition count 1676
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 644 transition count 1676
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 212 place count 634 transition count 1656
Iterating global reduction 1 with 10 rules applied. Total rules applied 222 place count 634 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 224 place count 632 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 226 place count 632 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 228 place count 630 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 230 place count 630 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 232 place count 628 transition count 1640
Iterating global reduction 1 with 2 rules applied. Total rules applied 234 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 235 place count 627 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 236 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 237 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 238 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 241 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 242 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 623 transition count 1630
Applied a total of 244 rules in 611 ms. Remains 623 /743 variables (removed 120) and now considering 1630/1922 (removed 292) transitions.
[2025-06-01 23:00:54] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2025-06-01 23:00:54] [INFO ] Computed 2 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:00:55] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2025-06-01 23:00:55] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2025-06-01 23:00:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:00:56] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-01 23:00:59] [INFO ] Implicit Places using invariants and state equation in 3647 ms returned []
Implicit Place search using SMT with State Equation took 4719 ms to find 0 implicit places.
Running 1628 sub problems to find dead transitions.
[2025-06-01 23:00:59] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2025-06-01 23:00:59] [INFO ] Invariant cache hit.
[2025-06-01 23:00:59] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
SMT process timed out in 33671ms, After SMT, problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 33674ms
Starting structural reductions in LTL mode, iteration 1 : 623/743 places, 1630/1922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39009 ms. Remains : 623/743 places, 1630/1922 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 1032 ms.
Product exploration explored 100000 steps with 33333 reset in 833 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLFireability-15 finished in 41240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2025-06-01 23:01:35] [INFO ] Flatten gal took : 80 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1620390786286738299
[2025-06-01 23:01:35] [INFO ] Too many transitions (1922) to apply POR reductions. Disabling POR matrices.
[2025-06-01 23:01:35] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1620390786286738299
Running compilation step : cd /tmp/ltsmin1620390786286738299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 23:01:35] [INFO ] Applying decomposition
[2025-06-01 23:01:35] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph336650343000624986.txt' '-o' '/tmp/graph336650343000624986.bin' '-w' '/tmp/graph336650343000624986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph336650343000624986.bin' '-l' '-1' '-v' '-w' '/tmp/graph336650343000624986.weights' '-q' '0' '-e' '0.001'
[2025-06-01 23:01:36] [INFO ] Decomposing Gal with order
[2025-06-01 23:01:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:01:36] [INFO ] Removed a total of 3168 redundant transitions.
[2025-06-01 23:01:36] [INFO ] Flatten gal took : 151 ms
[2025-06-01 23:01:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1396 labels/synchronizations in 67 ms.
[2025-06-01 23:01:36] [INFO ] Time to serialize gal into /tmp/LTLFireability8896510974491043178.gal : 16 ms
[2025-06-01 23:01:36] [INFO ] Time to serialize properties into /tmp/LTLFireability10105367606029450011.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8896510974491043178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10105367606029450011.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F("((i34.u0.s0<1)||(i34.u0.l1501<1))"))))
Formula 0 simplified : FG!"((i34.u0.s0<1)||(i34.u0.l1501<1))"
Compilation finished in 6721 ms.
Running link step : cd /tmp/ltsmin1620390786286738299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin1620390786286738299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1620390786286738299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1620390786286738299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-01 23:28:09] [INFO ] Flatten gal took : 110 ms
[2025-06-01 23:28:09] [INFO ] Time to serialize gal into /tmp/LTLFireability17002352281637040290.gal : 29 ms
[2025-06-01 23:28:09] [INFO ] Time to serialize properties into /tmp/LTLFireability17512454227689450781.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17002352281637040290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17512454227689450781.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((G(F("((s0<1)||(l1501<1))"))))
Formula 0 simplified : FG!"((s0<1)||(l1501<1))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1620390786286738299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin1620390786286738299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007400116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c002.tgz
mv FunctionPointer-PT-c002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;