Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716483711191

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 17:01:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 17:01:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 17:01:52] [INFO ] Load time of PNML (sax parser for PT used): 375 ms
[2024-05-23 17:01:52] [INFO ] Transformed 2826 places.
[2024-05-23 17:01:52] [INFO ] Transformed 8960 transitions.
[2024-05-23 17:01:52] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 533 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c016-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 314 place count 1314 transition count 3672
Iterating global reduction 1 with 298 rules applied. Total rules applied 612 place count 1314 transition count 3672
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 958 place count 1314 transition count 3326
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1114 place count 1158 transition count 3014
Iterating global reduction 2 with 156 rules applied. Total rules applied 1270 place count 1158 transition count 3014
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1334 place count 1158 transition count 2950
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1348 place count 1144 transition count 2922
Iterating global reduction 3 with 14 rules applied. Total rules applied 1362 place count 1144 transition count 2922
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1376 place count 1130 transition count 2894
Iterating global reduction 3 with 14 rules applied. Total rules applied 1390 place count 1130 transition count 2894
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1404 place count 1116 transition count 2866
Iterating global reduction 3 with 14 rules applied. Total rules applied 1418 place count 1116 transition count 2866
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1432 place count 1102 transition count 2838
Iterating global reduction 3 with 14 rules applied. Total rules applied 1446 place count 1102 transition count 2838
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1459 place count 1089 transition count 2812
Iterating global reduction 3 with 13 rules applied. Total rules applied 1472 place count 1089 transition count 2812
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1485 place count 1076 transition count 2786
Iterating global reduction 3 with 13 rules applied. Total rules applied 1498 place count 1076 transition count 2786
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1510 place count 1064 transition count 2762
Iterating global reduction 3 with 12 rules applied. Total rules applied 1522 place count 1064 transition count 2762
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1580 place count 1006 transition count 2540
Iterating global reduction 3 with 58 rules applied. Total rules applied 1638 place count 1006 transition count 2540
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1696 place count 948 transition count 2308
Iterating global reduction 3 with 58 rules applied. Total rules applied 1754 place count 948 transition count 2308
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1812 place count 890 transition count 2182
Iterating global reduction 3 with 58 rules applied. Total rules applied 1870 place count 890 transition count 2182
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1927 place count 833 transition count 2068
Iterating global reduction 3 with 57 rules applied. Total rules applied 1984 place count 833 transition count 2068
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2039 place count 778 transition count 1958
Iterating global reduction 3 with 55 rules applied. Total rules applied 2094 place count 778 transition count 1958
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2149 place count 723 transition count 1848
Iterating global reduction 3 with 55 rules applied. Total rules applied 2204 place count 723 transition count 1848
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2257 place count 670 transition count 1742
Iterating global reduction 3 with 53 rules applied. Total rules applied 2310 place count 670 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2315 place count 665 transition count 1732
Iterating global reduction 3 with 5 rules applied. Total rules applied 2320 place count 665 transition count 1732
Applied a total of 2320 rules in 1162 ms. Remains 665 /1628 variables (removed 963) and now considering 1732/5962 (removed 4230) transitions.
[2024-05-23 17:01:54] [INFO ] Flow matrix only has 1164 transitions (discarded 568 similar events)
// Phase 1: matrix 1164 rows 665 cols
[2024-05-23 17:01:54] [INFO ] Computed 3 invariants in 37 ms
[2024-05-23 17:01:55] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-23 17:01:55] [INFO ] Flow matrix only has 1164 transitions (discarded 568 similar events)
[2024-05-23 17:01:55] [INFO ] Invariant cache hit.
[2024-05-23 17:01:55] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-23 17:01:57] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 3176 ms to find 0 implicit places.
Running 1730 sub problems to find dead transitions.
[2024-05-23 17:01:57] [INFO ] Flow matrix only has 1164 transitions (discarded 568 similar events)
[2024-05-23 17:01:57] [INFO ] Invariant cache hit.
[2024-05-23 17:01:57] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/1829 variables, and 1 constraints, problems are : Problem set: 0 solved, 1730 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/665 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 1730/1730 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 2 (OVERLAPS) 1/665 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
[2024-05-23 17:03:02] [INFO ] Deduced a trap composed of 135 places in 172 ms of which 29 ms to minimize.
[2024-05-23 17:03:04] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/1829 variables, and 5 constraints, problems are : Problem set: 0 solved, 1730 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/665 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 0/1730 constraints, Known Traps: 2/2 constraints]
After SMT, in 68398ms problems are : Problem set: 0 solved, 1730 unsolved
Search for dead transitions found 0 dead transitions in 68431ms
Starting structural reductions in LTL mode, iteration 1 : 665/1628 places, 1732/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72805 ms. Remains : 665/1628 places, 1732/5962 transitions.
Support contains 17 out of 665 places after structural reductions.
[2024-05-23 17:03:06] [INFO ] Flatten gal took : 141 ms
[2024-05-23 17:03:06] [INFO ] Flatten gal took : 134 ms
[2024-05-23 17:03:06] [INFO ] Input system was already deterministic with 1732 transitions.
Support contains 16 out of 665 places (down from 17) after GAL structural reductions.
RANDOM walk for 40010 steps (8 resets) in 1906 ms. (20 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 177 ms. (224 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 99 ms. (400 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 67 ms. (588 steps per ms) remains 3/4 properties
[2024-05-23 17:03:07] [INFO ] Flow matrix only has 1164 transitions (discarded 568 similar events)
[2024-05-23 17:03:07] [INFO ] Invariant cache hit.
[2024-05-23 17:03:07] [INFO ] State equation strengthened by 288 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 400/406 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/408 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 904/1312 variables, 408/411 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1312 variables, 222/633 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1312 variables, 0/633 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 401/1713 variables, 162/795 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1713 variables, 66/861 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1713 variables, 0/861 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 105/1818 variables, 88/949 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1818 variables, 0/949 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/1827 variables, 5/954 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1827 variables, 0/954 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1829 variables, 2/956 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1829 variables, 0/956 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1829 variables, 0/956 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1829/1829 variables, and 956 constraints, problems are : Problem set: 1 solved, 2 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 665/665 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 381/386 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 646/1032 variables, 386/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 267/1299 variables, 9/396 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1299 variables, 214/610 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1299 variables, 2/612 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1299 variables, 0/612 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/1317 variables, 2/614 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1317 variables, 3/617 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1317 variables, 0/617 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 408/1725 variables, 176/793 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1725 variables, 74/867 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1725 variables, 0/867 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 98/1823 variables, 87/954 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1823 variables, 0/954 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/1828 variables, 3/957 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1828 variables, 0/957 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1829 variables, 1/958 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1829 variables, 0/958 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1829 variables, 0/958 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1829/1829 variables, and 958 constraints, problems are : Problem set: 1 solved, 2 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 665/665 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1919ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 5 out of 665 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Graph (complete) has 2931 edges and 665 vertex of which 472 are kept as prefixes of interest. Removing 193 places using SCC suffix rule.5 ms
Discarding 193 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 472 transition count 1348
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 393 place count 464 transition count 1330
Iterating global reduction 1 with 8 rules applied. Total rules applied 401 place count 464 transition count 1330
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 409 place count 464 transition count 1322
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 417 place count 456 transition count 1304
Iterating global reduction 2 with 8 rules applied. Total rules applied 425 place count 456 transition count 1304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 431 place count 450 transition count 1292
Iterating global reduction 2 with 6 rules applied. Total rules applied 437 place count 450 transition count 1292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 441 place count 446 transition count 1282
Iterating global reduction 2 with 4 rules applied. Total rules applied 445 place count 446 transition count 1282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 448 place count 443 transition count 1274
Iterating global reduction 2 with 3 rules applied. Total rules applied 451 place count 443 transition count 1274
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 454 place count 440 transition count 1266
Iterating global reduction 2 with 3 rules applied. Total rules applied 457 place count 440 transition count 1266
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 460 place count 437 transition count 1258
Iterating global reduction 2 with 3 rules applied. Total rules applied 463 place count 437 transition count 1258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 465 place count 435 transition count 1254
Iterating global reduction 2 with 2 rules applied. Total rules applied 467 place count 435 transition count 1254
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 469 place count 433 transition count 1250
Iterating global reduction 2 with 2 rules applied. Total rules applied 471 place count 433 transition count 1250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 473 place count 431 transition count 1246
Iterating global reduction 2 with 2 rules applied. Total rules applied 475 place count 431 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 476 place count 430 transition count 1244
Iterating global reduction 2 with 1 rules applied. Total rules applied 477 place count 430 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 478 place count 429 transition count 1242
Iterating global reduction 2 with 1 rules applied. Total rules applied 479 place count 429 transition count 1242
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 485 place count 429 transition count 1236
Applied a total of 485 rules in 342 ms. Remains 429 /665 variables (removed 236) and now considering 1236/1732 (removed 496) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 429/665 places, 1236/1732 transitions.
RANDOM walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-23 17:03:10] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
// Phase 1: matrix 701 rows 429 cols
[2024-05-23 17:03:10] [INFO ] Computed 3 invariants in 5 ms
[2024-05-23 17:03:10] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/1064 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 72/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/1074 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1074 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1074 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/1112 variables, 24/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1112 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1112 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/1126 variables, 9/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1126 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1130 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1130 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1130 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 429/429 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/1064 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 72/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1064 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/1074 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1074 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1074 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/1112 variables, 24/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1112 variables, 6/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1112 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/1126 variables, 9/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1126 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1130 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1130 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1130 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1130/1130 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 429/429 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 822ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 428 transition count 1234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 427 transition count 1230
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 426 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 425 transition count 1226
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 424 transition count 1224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 423 transition count 1222
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 422 transition count 1220
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 421 transition count 1218
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 421 transition count 1218
Applied a total of 16 rules in 101 ms. Remains 421 /429 variables (removed 8) and now considering 1218/1236 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 421/429 places, 1218/1236 transitions.
RANDOM walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32950 steps (6 resets) in 43 ms. (748 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-c016-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3891 edges and 665 vertex of which 664 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.28 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 656 transition count 1712
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 656 transition count 1712
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 656 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 647 transition count 1682
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 647 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 640 transition count 1664
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 640 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 635 transition count 1652
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 635 transition count 1652
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 631 transition count 1642
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 631 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 627 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 627 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 623 transition count 1626
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 618 transition count 1616
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 104 place count 618 transition count 1612
Applied a total of 104 rules in 407 ms. Remains 618 /665 variables (removed 47) and now considering 1612/1732 (removed 120) transitions.
[2024-05-23 17:03:11] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 618 cols
[2024-05-23 17:03:11] [INFO ] Computed 3 invariants in 14 ms
[2024-05-23 17:03:12] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-23 17:03:12] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:03:12] [INFO ] Invariant cache hit.
[2024-05-23 17:03:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:03:14] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2390 ms to find 0 implicit places.
[2024-05-23 17:03:14] [INFO ] Redundant transitions in 84 ms returned []
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:03:14] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:03:14] [INFO ] Invariant cache hit.
[2024-05-23 17:03:14] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1693 variables, and 1 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/618 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (OVERLAPS) 1/618 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
[2024-05-23 17:04:15] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 3 ms to minimize.
[2024-05-23 17:04:16] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1693 variables, and 5 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/618 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1610 constraints, Known Traps: 2/2 constraints]
After SMT, in 67943ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 67959ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/665 places, 1612/1732 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70850 ms. Remains : 618/665 places, 1612/1732 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 608 ms.
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-00 finished in 71668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X((G(p1) U (p0&&G(p1))))))))))'
Support contains 1 out of 665 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 656 transition count 1714
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 656 transition count 1714
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 656 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 648 transition count 1686
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 648 transition count 1686
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 47 place count 642 transition count 1672
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 642 transition count 1672
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 637 transition count 1660
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 637 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 633 transition count 1650
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 633 transition count 1650
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 629 transition count 1640
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 629 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 625 transition count 1630
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 625 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 622 transition count 1624
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 622 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 620 transition count 1620
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 618 transition count 1616
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 616 transition count 1612
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 616 transition count 1612
Applied a total of 105 rules in 399 ms. Remains 616 /665 variables (removed 49) and now considering 1612/1732 (removed 120) transitions.
[2024-05-23 17:04:23] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2024-05-23 17:04:23] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 17:04:23] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-23 17:04:23] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:04:23] [INFO ] Invariant cache hit.
[2024-05-23 17:04:24] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 17:04:25] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:04:25] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:04:25] [INFO ] Invariant cache hit.
[2024-05-23 17:04:25] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/616 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1694 variables, 616/618 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 267/885 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2495 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68942ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68960ms
Starting structural reductions in LTL mode, iteration 1 : 616/665 places, 1612/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71513 ms. Remains : 616/665 places, 1612/1732 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 523 ms.
Product exploration explored 100000 steps with 25000 reset in 486 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 33491 steps (7 resets) in 156 ms. (213 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 616 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Applied a total of 0 rules in 14 ms. Remains 616 /616 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 17:05:36] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:05:36] [INFO ] Invariant cache hit.
[2024-05-23 17:05:36] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-23 17:05:36] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:05:36] [INFO ] Invariant cache hit.
[2024-05-23 17:05:37] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 17:05:38] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:05:38] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:05:38] [INFO ] Invariant cache hit.
[2024-05-23 17:05:38] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/616 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1694 variables, 616/618 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 267/885 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2495 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68386ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68401ms
Finished structural reductions in LTL mode , in 1 iterations and 70603 ms. Remains : 616/616 places, 1612/1612 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40012 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527809 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527809 steps, saw 342582 distinct states, run finished after 3004 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-23 17:06:50] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:06:50] [INFO ] Invariant cache hit.
[2024-05-23 17:06:50] [INFO ] State equation strengthened by 267 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/546 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/551 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 929/1480 variables, 467/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 266/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1542 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1542 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 138/1680 variables, 133/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1680 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/1690 variables, 5/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1694 variables, 3/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1694 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1694 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 885 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/546 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/551 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 929/1480 variables, 467/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 266/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1542 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 138/1680 variables, 133/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1680 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/1690 variables, 5/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1694 variables, 3/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1694 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1694 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 899ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Graph (complete) has 2690 edges and 616 vertex of which 424 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 424 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 423 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 423 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 422 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 422 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 398 place count 417 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 399 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 400 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 401 place count 416 transition count 1208
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 403 place count 416 transition count 1206
Applied a total of 403 rules in 189 ms. Remains 416 /616 variables (removed 200) and now considering 1206/1612 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 416/616 places, 1206/1612 transitions.
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33245 steps (6 resets) in 53 ms. (615 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 465 ms.
Product exploration explored 100000 steps with 25000 reset in 472 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 614 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 614 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 613 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 612 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 611 transition count 1598
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 610 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 609 transition count 1594
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 608 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 608 transition count 1592
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 18 place count 608 transition count 1590
Applied a total of 18 rules in 413 ms. Remains 608 /616 variables (removed 8) and now considering 1590/1612 (removed 22) transitions.
[2024-05-23 17:06:53] [INFO ] Redundant transitions in 84 ms returned []
Running 1588 sub problems to find dead transitions.
[2024-05-23 17:06:53] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2024-05-23 17:06:53] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 17:06:53] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1671 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1671 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1671 variables, 264/874 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1671/1671 variables, and 2462 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 31227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 608/608 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints]
After SMT, in 68089ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 68104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 608/616 places, 1590/1612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68616 ms. Remains : 608/616 places, 1590/1612 transitions.
Built C files in :
/tmp/ltsmin9035968392244527223
[2024-05-23 17:08:01] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9035968392244527223
Running compilation step : cd /tmp/ltsmin9035968392244527223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9035968392244527223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9035968392244527223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 614 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 614 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 613 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 612 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 611 transition count 1598
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 610 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 609 transition count 1594
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 608 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 608 transition count 1592
Applied a total of 16 rules in 114 ms. Remains 608 /616 variables (removed 8) and now considering 1592/1612 (removed 20) transitions.
[2024-05-23 17:08:05] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2024-05-23 17:08:05] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 17:08:05] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-23 17:08:05] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2024-05-23 17:08:05] [INFO ] Invariant cache hit.
[2024-05-23 17:08:05] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 17:08:07] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-23 17:08:07] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2024-05-23 17:08:07] [INFO ] Invariant cache hit.
[2024-05-23 17:08:07] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 3.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 1.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 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 timeout
1.0)
(s488 1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1672 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1064/1672 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1672 variables, 264/874 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 2464 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 31314 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 608/608 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 67704ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 67718ms
Starting structural reductions in LTL mode, iteration 1 : 608/616 places, 1592/1612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70157 ms. Remains : 608/616 places, 1592/1612 transitions.
Built C files in :
/tmp/ltsmin12971880003771549739
[2024-05-23 17:09:15] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12971880003771549739
Running compilation step : cd /tmp/ltsmin12971880003771549739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12971880003771549739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12971880003771549739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 17:09:18] [INFO ] Flatten gal took : 59 ms
[2024-05-23 17:09:18] [INFO ] Flatten gal took : 65 ms
[2024-05-23 17:09:18] [INFO ] Time to serialize gal into /tmp/LTL714997091978585190.gal : 32 ms
[2024-05-23 17:09:18] [INFO ] Time to serialize properties into /tmp/LTL13057725075629270865.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL714997091978585190.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1790235475559285649.hoa' '-atoms' '/tmp/LTL13057725075629270865.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(l1234<=0)")||(X((G("(l1999>l982)"))U(("(l1234<=0)")&&(G("(l1999>l982)")))))))))))
Formula 0 simplified : XXXG(!"(l1234<=0)" & X(!"(l1234<=0)" W F!"(l1999>l982)"))
Detected timeout of ITS tools.
[2024-05-23 17:09:48] [INFO ] Flatten gal took : 41 ms
[2024-05-23 17:09:48] [INFO ] Applying decomposition
[2024-05-23 17:09:48] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8165217147911532752.txt' '-o' '/tmp/graph8165217147911532752.bin' '-w' '/tmp/graph8165217147911532752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8165217147911532752.bin' '-l' '-1' '-v' '-w' '/tmp/graph8165217147911532752.weights' '-q' '0' '-e' '0.001'
[2024-05-23 17:09:49] [INFO ] Decomposing Gal with order
[2024-05-23 17:09:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 17:09:49] [INFO ] Removed a total of 470 redundant transitions.
[2024-05-23 17:09:49] [INFO ] Flatten gal took : 159 ms
[2024-05-23 17:09:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 24 ms.
[2024-05-23 17:09:49] [INFO ] Time to serialize gal into /tmp/LTL271883620082428367.gal : 9 ms
[2024-05-23 17:09:49] [INFO ] Time to serialize properties into /tmp/LTL11113280861194782515.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL271883620082428367.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11113280861194782515.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(gi0.gu0.l1234<=0)")||(X((G("(gu53.l1999>gu53.l982)"))U(("(gi0.gu0.l1234<=0)")&&(G("(gu53.l1999>gu53.l982)")))))))))))
Formula 0 simplified : XXXG(!"(gi0.gu0.l1234<=0)" & X(!"(gi0.gu0.l1234<=0)" W F!"(gu53.l1999>gu53.l982)"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-03 finished in 341552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G(p1))))'
Support contains 2 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 655 transition count 1712
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 655 transition count 1712
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 655 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 34 place count 646 transition count 1682
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 646 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 638 transition count 1662
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 638 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 632 transition count 1648
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 627 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 627 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 622 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 617 transition count 1612
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 617 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 613 transition count 1604
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 613 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 611 transition count 1600
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 611 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 609 transition count 1596
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 608 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 607 transition count 1592
Applied a total of 121 rules in 177 ms. Remains 607 /665 variables (removed 58) and now considering 1592/1732 (removed 140) transitions.
[2024-05-23 17:10:04] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-23 17:10:04] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 17:10:05] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-23 17:10:05] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 17:10:05] [INFO ] Invariant cache hit.
[2024-05-23 17:10:05] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 17:10:07] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-23 17:10:07] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 17:10:07] [INFO ] Invariant cache hit.
[2024-05-23 17:10:07] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1670 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1670 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1670 variables, 264/873 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1670/1670 variables, and 2463 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 31264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 68140ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 68161ms
Starting structural reductions in LTL mode, iteration 1 : 607/665 places, 1592/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70585 ms. Remains : 607/665 places, 1592/1732 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-06
Product exploration explored 100000 steps with 33502 reset in 506 ms.
Product exploration explored 100000 steps with 33395 reset in 510 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/607 stabilizing places and 512/1592 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 149 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 36079 steps (11 resets) in 52 ms. (680 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 13 factoid took 482 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-06 finished in 72750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 655 transition count 1712
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 655 transition count 1712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 27 place count 655 transition count 1704
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 36 place count 646 transition count 1682
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 646 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 52 place count 639 transition count 1666
Iterating global reduction 2 with 7 rules applied. Total rules applied 59 place count 639 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 634 transition count 1654
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 634 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 630 transition count 1644
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 630 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 626 transition count 1634
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 626 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 622 transition count 1624
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 622 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 619 transition count 1618
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 617 transition count 1614
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 613 transition count 1606
Applied a total of 111 rules in 164 ms. Remains 613 /665 variables (removed 52) and now considering 1606/1732 (removed 126) transitions.
[2024-05-23 17:11:17] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 17:11:17] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 17:11:17] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-23 17:11:17] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:11:17] [INFO ] Invariant cache hit.
[2024-05-23 17:11:18] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:11:19] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 17:11:19] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:11:19] [INFO ] Invariant cache hit.
[2024-05-23 17:11:19] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31440 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 68485ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68500ms
Starting structural reductions in LTL mode, iteration 1 : 613/665 places, 1606/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70991 ms. Remains : 613/665 places, 1606/1732 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07
Product exploration explored 100000 steps with 2 reset in 447 ms.
Product exploration explored 100000 steps with 0 reset in 605 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 : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40022 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (13 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 553539 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 553539 steps, saw 359280 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
[2024-05-23 17:12:32] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:12:32] [INFO ] Invariant cache hit.
[2024-05-23 17:12:32] [INFO ] State equation strengthened by 265 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 644/1029 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1029 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 221/1250 variables, 7/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 196/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 358/1608 variables, 148/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1608 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1608 variables, 69/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1608 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/1682 variables, 71/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 644/1029 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1029 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 221/1250 variables, 7/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 196/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1250 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 358/1608 variables, 148/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1608 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1608 variables, 69/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1608 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/1682 variables, 71/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) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 936ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
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 389 place count 421 transition count 1218
Applied a total of 389 rules in 90 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 421/613 places, 1218/1606 transitions.
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 657377 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Probabilistic random walk after 657377 steps, saw 403090 distinct states, run finished after 3002 ms. (steps per millisecond=218 ) properties seen :0
[2024-05-23 17:12:36] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-23 17:12:36] [INFO ] Computed 3 invariants in 8 ms
[2024-05-23 17:12:36] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/1058 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1058 variables, 70/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1058 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/1066 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1066 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1096 variables, 19/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1096 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1096 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/1106 variables, 7/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1106 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/1109 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/1058 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1058 variables, 70/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1058 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1058 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1066 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1066 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1096 variables, 19/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1096 variables, 5/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1096 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/1106 variables, 7/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1106 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1109 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 17:12:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 17:12:37] [INFO ] Invariant cache hit.
[2024-05-23 17:12:38] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 17:12:38] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 17:12:38] [INFO ] Invariant cache hit.
[2024-05-23 17:12:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 17:12:39] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
[2024-05-23 17:12:39] [INFO ] Redundant transitions in 23 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 17:12:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 17:12:39] [INFO ] Invariant cache hit.
[2024-05-23 17:12:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 17:12:53] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 3 ms to minimize.
[2024-05-23 17:12:53] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/426 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33358ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34974 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 25 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 86 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2024-05-23 17:13:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 17:13:12] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:13:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 17:13:12] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:13:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:13:12] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 17:13:12] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:13:12] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 203 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 16 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-23 17:13:13] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 17:13:13] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 17:13:13] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-23 17:13:13] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:13:13] [INFO ] Invariant cache hit.
[2024-05-23 17:13:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:13:15] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 17:13:15] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:13:15] [INFO ] Invariant cache hit.
[2024-05-23 17:13:15] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
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 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31262 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 67996ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68012ms
Finished structural reductions in LTL mode , in 1 iterations and 70320 ms. Remains : 613/613 places, 1606/1606 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40028 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35703 steps (12 resets) in 27 ms. (1275 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 467 ms.
Product exploration explored 100000 steps with 0 reset in 499 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 160 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2024-05-23 17:14:25] [INFO ] Redundant transitions in 27 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-23 17:14:25] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-23 17:14:25] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 17:14:25] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1683 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2480 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 31167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
After SMT, in 68064ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68077ms
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68277 ms. Remains : 613/613 places, 1602/1606 transitions.
Built C files in :
/tmp/ltsmin14450862180560998697
[2024-05-23 17:15:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14450862180560998697
Running compilation step : cd /tmp/ltsmin14450862180560998697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14450862180560998697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14450862180560998697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 21 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-23 17:15:36] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 17:15:36] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 17:15:37] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-23 17:15:37] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:15:37] [INFO ] Invariant cache hit.
[2024-05-23 17:15:37] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:15:38] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2294 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 17:15:39] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:15:39] [INFO ] Invariant cache hit.
[2024-05-23 17:15:39] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 68393ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68407ms
Finished structural reductions in LTL mode , in 1 iterations and 70730 ms. Remains : 613/613 places, 1606/1606 transitions.
Built C files in :
/tmp/ltsmin16835469882821547331
[2024-05-23 17:16:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16835469882821547331
Running compilation step : cd /tmp/ltsmin16835469882821547331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16835469882821547331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16835469882821547331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 17:16:50] [INFO ] Flatten gal took : 53 ms
[2024-05-23 17:16:50] [INFO ] Flatten gal took : 42 ms
[2024-05-23 17:16:50] [INFO ] Time to serialize gal into /tmp/LTL14062086111724593736.gal : 6 ms
[2024-05-23 17:16:50] [INFO ] Time to serialize properties into /tmp/LTL3952508693972380868.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14062086111724593736.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13003085979349738501.hoa' '-atoms' '/tmp/LTL3952508693972380868.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((l1572<=l980)||(l448<=0))")))))
Formula 0 simplified : XXF!"((l1572<=l980)||(l448<=0))"
Detected timeout of ITS tools.
[2024-05-23 17:17:20] [INFO ] Flatten gal took : 40 ms
[2024-05-23 17:17:20] [INFO ] Applying decomposition
[2024-05-23 17:17:20] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2773575012761985353.txt' '-o' '/tmp/graph2773575012761985353.bin' '-w' '/tmp/graph2773575012761985353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2773575012761985353.bin' '-l' '-1' '-v' '-w' '/tmp/graph2773575012761985353.weights' '-q' '0' '-e' '0.001'
[2024-05-23 17:17:20] [INFO ] Decomposing Gal with order
[2024-05-23 17:17:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 17:17:21] [INFO ] Removed a total of 454 redundant transitions.
[2024-05-23 17:17:21] [INFO ] Flatten gal took : 92 ms
[2024-05-23 17:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 10 ms.
[2024-05-23 17:17:21] [INFO ] Time to serialize gal into /tmp/LTL6601513249553427408.gal : 7 ms
[2024-05-23 17:17:21] [INFO ] Time to serialize properties into /tmp/LTL3163482332917940479.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6601513249553427408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3163482332917940479.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((gu51.l1572<=gu51.l980)||(gi0.gu0.l448<=0))")))))
Formula 0 simplified : XXF!"((gu51.l1572<=gu51.l980)||(gi0.gu0.l448<=0))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 378879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 654 transition count 1710
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 654 transition count 1710
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 29 place count 654 transition count 1702
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 39 place count 644 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 644 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 57 place count 636 transition count 1656
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 636 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 630 transition count 1642
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 630 transition count 1642
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 625 transition count 1630
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 625 transition count 1630
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 620 transition count 1618
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 620 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 615 transition count 1606
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 615 transition count 1606
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 611 transition count 1598
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 611 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 609 transition count 1594
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 609 transition count 1594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 607 transition count 1590
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 605 transition count 1586
Applied a total of 127 rules in 180 ms. Remains 605 /665 variables (removed 60) and now considering 1586/1732 (removed 146) transitions.
[2024-05-23 17:17:36] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-23 17:17:36] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 17:17:36] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-23 17:17:36] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 17:17:36] [INFO ] Invariant cache hit.
[2024-05-23 17:17:37] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 17:17:38] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2268 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 17:17:38] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 17:17:38] [INFO ] Invariant cache hit.
[2024-05-23 17:17:38] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1663 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1663 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 2453 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 31169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
After SMT, in 67903ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 67916ms
Starting structural reductions in LTL mode, iteration 1 : 605/665 places, 1586/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70369 ms. Remains : 605/665 places, 1586/1732 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-11 finished in 70467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 655 transition count 1712
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 655 transition count 1712
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 655 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 34 place count 646 transition count 1682
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 646 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 638 transition count 1662
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 638 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 632 transition count 1648
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 627 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 627 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 622 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 617 transition count 1612
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 617 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 613 transition count 1604
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 613 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 611 transition count 1600
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 611 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 609 transition count 1596
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 608 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 607 transition count 1592
Applied a total of 121 rules in 177 ms. Remains 607 /665 variables (removed 58) and now considering 1592/1732 (removed 140) transitions.
[2024-05-23 17:18:46] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-23 17:18:46] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 17:18:47] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-23 17:18:47] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 17:18:47] [INFO ] Invariant cache hit.
[2024-05-23 17:18:47] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 17:18:49] [INFO ] Implicit Places using invariants and state equation in 1904 ms returned []
Implicit Place search using SMT with State Equation took 2329 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-23 17:18:49] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-23 17:18:49] [INFO ] Invariant cache hit.
[2024-05-23 17:18:49] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 3.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 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1670 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1670 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1670 variables, 264/873 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1670/1670 variables, and 2463 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 31145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 67616ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 67631ms
Starting structural reductions in LTL mode, iteration 1 : 607/665 places, 1592/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70143 ms. Remains : 607/665 places, 1592/1732 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-13 finished in 70274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X((G(p1) U (p0&&G(p1))))))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c016-LTLCardinality-03
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 665 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Graph (complete) has 3891 edges and 665 vertex of which 664 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 656 transition count 1714
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 656 transition count 1714
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 25 place count 656 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 648 transition count 1686
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 648 transition count 1686
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 642 transition count 1672
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 642 transition count 1672
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 637 transition count 1660
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 637 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 633 transition count 1650
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 633 transition count 1650
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 629 transition count 1640
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 629 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 625 transition count 1630
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 625 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 622 transition count 1624
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 622 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 620 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 616 transition count 1612
Applied a total of 105 rules in 225 ms. Remains 616 /665 variables (removed 49) and now considering 1612/1732 (removed 120) transitions.
[2024-05-23 17:19:57] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2024-05-23 17:19:57] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 17:19:58] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-23 17:19:58] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:19:58] [INFO ] Invariant cache hit.
[2024-05-23 17:19:58] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 17:19:59] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:19:59] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:19:59] [INFO ] Invariant cache hit.
[2024-05-23 17:19:59] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/616 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1694 variables, 616/618 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 267/885 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2495 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68478ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68492ms
Starting structural reductions in LI_LTL mode, iteration 1 : 616/665 places, 1612/1732 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 70950 ms. Remains : 616/665 places, 1612/1732 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 461 ms.
Product exploration explored 100000 steps with 25000 reset in 481 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30396 steps (7 resets) in 90 ms. (334 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 616 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Applied a total of 0 rules in 14 ms. Remains 616 /616 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 17:21:09] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:21:09] [INFO ] Invariant cache hit.
[2024-05-23 17:21:10] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-23 17:21:10] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:21:10] [INFO ] Invariant cache hit.
[2024-05-23 17:21:10] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 17:21:11] [INFO ] Implicit Places using invariants and state equation in 1671 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:21:11] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:21:11] [INFO ] Invariant cache hit.
[2024-05-23 17:21:11] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/616 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1694 variables, 616/618 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 267/885 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2495 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69059ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69075ms
Finished structural reductions in LTL mode , in 1 iterations and 71185 ms. Remains : 616/616 places, 1612/1612 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40009 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (14 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 557152 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 1
Probabilistic random walk after 557152 steps, saw 361625 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
[2024-05-23 17:22:24] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:22:24] [INFO ] Invariant cache hit.
[2024-05-23 17:22:24] [INFO ] State equation strengthened by 267 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/546 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/551 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 929/1480 variables, 467/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 266/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1542 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1542 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 138/1680 variables, 133/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1680 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/1690 variables, 5/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1694 variables, 3/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1694 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1694 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 885 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/546 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/551 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 929/1480 variables, 467/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 266/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1542 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 138/1680 variables, 133/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1680 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/1690 variables, 5/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1694 variables, 3/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1694 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1694 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 922ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Graph (complete) has 2690 edges and 616 vertex of which 424 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 424 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 423 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 423 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 422 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 422 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 398 place count 417 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 399 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 400 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 401 place count 416 transition count 1208
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 403 place count 416 transition count 1206
Applied a total of 403 rules in 163 ms. Remains 416 /616 variables (removed 200) and now considering 1206/1612 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 416/616 places, 1206/1612 transitions.
RANDOM walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 28732 steps (5 resets) in 24 ms. (1149 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 490 ms.
Product exploration explored 100000 steps with 25000 reset in 474 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 614 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 614 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 613 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 612 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 611 transition count 1598
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 610 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 609 transition count 1594
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 608 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 608 transition count 1592
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 18 place count 608 transition count 1590
Applied a total of 18 rules in 285 ms. Remains 608 /616 variables (removed 8) and now considering 1590/1612 (removed 22) transitions.
[2024-05-23 17:22:27] [INFO ] Redundant transitions in 24 ms returned []
Running 1588 sub problems to find dead transitions.
[2024-05-23 17:22:27] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2024-05-23 17:22:27] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 17:22:27] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 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 608/1671 variables, and 2 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1671 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1671 variables, 264/874 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1671/1671 variables, and 2462 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 31412 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 608/608 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints]
After SMT, in 68618ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 68631ms
Starting structural reductions in SI_LTL mode, iteration 1 : 608/616 places, 1590/1612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68962 ms. Remains : 608/616 places, 1590/1612 transitions.
Built C files in :
/tmp/ltsmin9018673041996959138
[2024-05-23 17:23:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9018673041996959138
Running compilation step : cd /tmp/ltsmin9018673041996959138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9018673041996959138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9018673041996959138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 614 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 614 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 613 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 612 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 611 transition count 1598
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 610 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 609 transition count 1594
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 608 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 608 transition count 1592
Applied a total of 16 rules in 119 ms. Remains 608 /616 variables (removed 8) and now considering 1592/1612 (removed 20) transitions.
[2024-05-23 17:23:39] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2024-05-23 17:23:39] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 17:23:39] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-23 17:23:39] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2024-05-23 17:23:39] [INFO ] Invariant cache hit.
[2024-05-23 17:23:39] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 17:23:41] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-23 17:23:41] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2024-05-23 17:23:41] [INFO ] Invariant cache hit.
[2024-05-23 17:23:41] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 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 608/1672 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1064/1672 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1672 variables, 264/874 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 2464 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 31248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 608/608 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 68681ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 68693ms
Starting structural reductions in LTL mode, iteration 1 : 608/616 places, 1592/1612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71095 ms. Remains : 608/616 places, 1592/1612 transitions.
Built C files in :
/tmp/ltsmin3315053406641485147
[2024-05-23 17:24:50] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3315053406641485147
Running compilation step : cd /tmp/ltsmin3315053406641485147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3315053406641485147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3315053406641485147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 17:24:53] [INFO ] Flatten gal took : 40 ms
[2024-05-23 17:24:53] [INFO ] Flatten gal took : 39 ms
[2024-05-23 17:24:53] [INFO ] Time to serialize gal into /tmp/LTL10983422589795992234.gal : 5 ms
[2024-05-23 17:24:53] [INFO ] Time to serialize properties into /tmp/LTL6461434426021502448.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10983422589795992234.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1432053164678745109.hoa' '-atoms' '/tmp/LTL6461434426021502448.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(l1234<=0)")||(X((G("(l1999>l982)"))U(("(l1234<=0)")&&(G("(l1999>l982)")))))))))))
Formula 0 simplified : XXXG(!"(l1234<=0)" & X(!"(l1234<=0)" W F!"(l1999>l982)"))
Detected timeout of ITS tools.
[2024-05-23 17:25:23] [INFO ] Flatten gal took : 34 ms
[2024-05-23 17:25:23] [INFO ] Applying decomposition
[2024-05-23 17:25:23] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9066362567760590189.txt' '-o' '/tmp/graph9066362567760590189.bin' '-w' '/tmp/graph9066362567760590189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9066362567760590189.bin' '-l' '-1' '-v' '-w' '/tmp/graph9066362567760590189.weights' '-q' '0' '-e' '0.001'
[2024-05-23 17:25:23] [INFO ] Decomposing Gal with order
[2024-05-23 17:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 17:25:23] [INFO ] Removed a total of 569 redundant transitions.
[2024-05-23 17:25:23] [INFO ] Flatten gal took : 127 ms
[2024-05-23 17:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 28 ms.
[2024-05-23 17:25:24] [INFO ] Time to serialize gal into /tmp/LTL4543210020224394313.gal : 20 ms
[2024-05-23 17:25:24] [INFO ] Time to serialize properties into /tmp/LTL3216729467847383763.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4543210020224394313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3216729467847383763.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(gi0.gu0.l1234<=0)")||(X((G("(gu64.l1999>gu64.l982)"))U(("(gi0.gu0.l1234<=0)")&&(G("(gu64.l1999>gu64.l982)")))))))))))
Formula 0 simplified : XXXG(!"(gi0.gu0.l1234<=0)" & X(!"(gi0.gu0.l1234<=0)" W F!"(gu64.l1999>gu64.l982)"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-03 finished in 342079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLCardinality-07
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 665 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Graph (complete) has 3891 edges and 665 vertex of which 664 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 655 transition count 1712
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 655 transition count 1712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 27 place count 655 transition count 1704
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 646 transition count 1682
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 646 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 639 transition count 1666
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 639 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 634 transition count 1654
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 634 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 630 transition count 1644
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 630 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 626 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 626 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 622 transition count 1624
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 622 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 617 transition count 1614
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 615 transition count 1610
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 613 transition count 1606
Applied a total of 111 rules in 218 ms. Remains 613 /665 variables (removed 52) and now considering 1606/1732 (removed 126) transitions.
[2024-05-23 17:25:39] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 17:25:39] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 17:25:39] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-23 17:25:39] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:25:39] [INFO ] Invariant cache hit.
[2024-05-23 17:25:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:25:41] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 17:25:41] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 17:25:41] [INFO ] Invariant cache hit.
[2024-05-23 17:25:41] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 68547ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68564ms
Starting structural reductions in LI_LTL mode, iteration 1 : 613/665 places, 1606/1732 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71123 ms. Remains : 613/665 places, 1606/1732 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 261 steps with 2 reset in 1 ms.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 71341 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-23 17:26:50] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10151226071211222145
[2024-05-23 17:26:50] [INFO ] Too many transitions (1732) to apply POR reductions. Disabling POR matrices.
[2024-05-23 17:26:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10151226071211222145
Running compilation step : cd /tmp/ltsmin10151226071211222145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 17:26:50] [INFO ] Applying decomposition
[2024-05-23 17:26:50] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13084185065696335089.txt' '-o' '/tmp/graph13084185065696335089.bin' '-w' '/tmp/graph13084185065696335089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13084185065696335089.bin' '-l' '-1' '-v' '-w' '/tmp/graph13084185065696335089.weights' '-q' '0' '-e' '0.001'
[2024-05-23 17:26:50] [INFO ] Decomposing Gal with order
[2024-05-23 17:26:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 17:26:50] [INFO ] Removed a total of 578 redundant transitions.
[2024-05-23 17:26:50] [INFO ] Flatten gal took : 80 ms
[2024-05-23 17:26:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 10 ms.
[2024-05-23 17:26:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality5648761007709591821.gal : 6 ms
[2024-05-23 17:26:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality13543340998312034560.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5648761007709591821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13543340998312034560.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(gi0.gu0.l1234<=0)")||(X((G("(gu65.l1999>gu65.l982)"))U(("(gi0.gu0.l1234<=0)")&&(G("(gu65.l1999>gu65.l982)")))))))))))
Formula 0 simplified : XXXG(!"(gi0.gu0.l1234<=0)" & X(!"(gi0.gu0.l1234<=0)" W F!"(gu65.l1999>gu65.l982)"))
Compilation finished in 3854 ms.
Running link step : cd /tmp/ltsmin10151226071211222145;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10151226071211222145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>(((LTLAPp0==true)||X(([]((LTLAPp1==true)) U ((LTLAPp0==true)&&[]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
LTSmin run took 2424 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1504459 ms.

BK_STOP 1716485216886

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c016, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603100299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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