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.r179-tall-171640601200300.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 greatspnxred
Input is FunctionPointer-PT-c016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200300
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1716441498226

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 05:18:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 05:18:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 05:18:19] [INFO ] Load time of PNML (sax parser for PT used): 387 ms
[2024-05-23 05:18:19] [INFO ] Transformed 2826 places.
[2024-05-23 05:18:19] [INFO ] Transformed 8960 transitions.
[2024-05-23 05:18:19] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3768
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3768
Ensure Unique test removed 410 transitions
Reduce isomorphic transitions removed 410 transitions.
Iterating post reduction 1 with 410 rules applied. Total rules applied 1013 place count 1318 transition count 3358
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1165 place count 1166 transition count 3054
Iterating global reduction 2 with 152 rules applied. Total rules applied 1317 place count 1166 transition count 3054
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1405 place count 1166 transition count 2966
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1418 place count 1153 transition count 2940
Iterating global reduction 3 with 13 rules applied. Total rules applied 1431 place count 1153 transition count 2940
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1444 place count 1140 transition count 2914
Iterating global reduction 3 with 13 rules applied. Total rules applied 1457 place count 1140 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1470 place count 1127 transition count 2888
Iterating global reduction 3 with 13 rules applied. Total rules applied 1483 place count 1127 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1496 place count 1114 transition count 2862
Iterating global reduction 3 with 13 rules applied. Total rules applied 1509 place count 1114 transition count 2862
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1522 place count 1101 transition count 2836
Iterating global reduction 3 with 13 rules applied. Total rules applied 1535 place count 1101 transition count 2836
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1547 place count 1089 transition count 2812
Iterating global reduction 3 with 12 rules applied. Total rules applied 1559 place count 1089 transition count 2812
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1571 place count 1077 transition count 2788
Iterating global reduction 3 with 12 rules applied. Total rules applied 1583 place count 1077 transition count 2788
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1632 place count 1028 transition count 2604
Iterating global reduction 3 with 49 rules applied. Total rules applied 1681 place count 1028 transition count 2604
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1734 place count 975 transition count 2392
Iterating global reduction 3 with 53 rules applied. Total rules applied 1787 place count 975 transition count 2392
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1840 place count 922 transition count 2264
Iterating global reduction 3 with 53 rules applied. Total rules applied 1893 place count 922 transition count 2264
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1945 place count 870 transition count 2160
Iterating global reduction 3 with 52 rules applied. Total rules applied 1997 place count 870 transition count 2160
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2048 place count 819 transition count 2058
Iterating global reduction 3 with 51 rules applied. Total rules applied 2099 place count 819 transition count 2058
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2150 place count 768 transition count 1956
Iterating global reduction 3 with 51 rules applied. Total rules applied 2201 place count 768 transition count 1956
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2250 place count 719 transition count 1858
Iterating global reduction 3 with 49 rules applied. Total rules applied 2299 place count 719 transition count 1858
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2309 place count 709 transition count 1838
Iterating global reduction 3 with 10 rules applied. Total rules applied 2319 place count 709 transition count 1838
Applied a total of 2319 rules in 1194 ms. Remains 709 /1628 variables (removed 919) and now considering 1838/5962 (removed 4124) transitions.
[2024-05-23 05:18:21] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
// Phase 1: matrix 1236 rows 709 cols
[2024-05-23 05:18:21] [INFO ] Computed 2 invariants in 35 ms
[2024-05-23 05:18:22] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-23 05:18:22] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-23 05:18:22] [INFO ] Invariant cache hit.
[2024-05-23 05:18:22] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-23 05:18:24] [INFO ] Implicit Places using invariants and state equation in 2057 ms returned []
Implicit Place search using SMT with State Equation took 2744 ms to find 0 implicit places.
Running 1836 sub problems to find dead transitions.
[2024-05-23 05:18:24] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-23 05:18:24] [INFO ] Invariant cache hit.
[2024-05-23 05:18:24] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/709 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/709 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1836 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 709/1945 variables, and 2 constraints, problems are : Problem set: 0 solved, 1836 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/709 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1836/1836 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1836 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/709 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/709 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/709 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 3 (OVERLAPS) 1236/1945 variables, 709/711 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1945 variables, 303/1014 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 2850 constraints, problems are : Problem set: 0 solved, 1836 unsolved in 31882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 709/709 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 1836/1836 constraints, Known Traps: 0/0 constraints]
After SMT, in 70909ms problems are : Problem set: 0 solved, 1836 unsolved
Search for dead transitions found 0 dead transitions in 70943ms
Starting structural reductions in LTL mode, iteration 1 : 709/1628 places, 1838/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74922 ms. Remains : 709/1628 places, 1838/5962 transitions.
Support contains 23 out of 709 places after structural reductions.
[2024-05-23 05:19:35] [INFO ] Flatten gal took : 236 ms
[2024-05-23 05:19:36] [INFO ] Flatten gal took : 205 ms
[2024-05-23 05:19:36] [INFO ] Input system was already deterministic with 1838 transitions.
Support contains 22 out of 709 places (down from 23) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40018 steps (8 resets) in 1758 ms. (22 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
[2024-05-23 05:19:37] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-23 05:19:37] [INFO ] Invariant cache hit.
[2024-05-23 05:19:37] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 382/399 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 25/424 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 953/1377 variables, 424/426 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1377 variables, 237/663 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1377 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 443/1820 variables, 185/848 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1820 variables, 66/914 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1820 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 116/1936 variables, 95/1009 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1936 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 7/1943 variables, 3/1012 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1943 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 2/1945 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1945 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/1945 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 1014 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 709/709 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 382/399 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 25/424 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 953/1377 variables, 424/426 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1377 variables, 237/663 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1377 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 443/1820 variables, 185/848 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1820 variables, 66/914 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1820 variables, 14/928 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1820 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 116/1936 variables, 95/1023 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1936 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 7/1943 variables, 3/1026 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1943 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 2/1945 variables, 2/1028 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 05:19:45] [INFO ] Deduced a trap composed of 135 places in 242 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 1029 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 709/709 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 8784ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 705 transition count 1828
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 705 transition count 1828
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 705 transition count 1826
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 702 transition count 1820
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 702 transition count 1820
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 699 transition count 1812
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 699 transition count 1812
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 696 transition count 1804
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 696 transition count 1804
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 693 transition count 1798
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 693 transition count 1798
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 690 transition count 1792
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 690 transition count 1792
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 688 transition count 1788
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 688 transition count 1788
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 686 transition count 1784
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 686 transition count 1784
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 683 transition count 1774
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 683 transition count 1774
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 681 transition count 1766
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 681 transition count 1766
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 679 transition count 1762
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 679 transition count 1762
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 677 transition count 1758
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 677 transition count 1758
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 675 transition count 1754
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 675 transition count 1754
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 673 transition count 1750
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 673 transition count 1750
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 671 transition count 1746
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 671 transition count 1746
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 92 place count 671 transition count 1732
Applied a total of 92 rules in 922 ms. Remains 671 /709 variables (removed 38) and now considering 1732/1838 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 936 ms. Remains : 671/709 places, 1732/1838 transitions.
RANDOM walk for 40012 steps (8 resets) in 449 ms. (88 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 72 ms. (548 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
[2024-05-23 05:19:47] [INFO ] Flow matrix only has 1165 transitions (discarded 567 similar events)
// Phase 1: matrix 1165 rows 671 cols
[2024-05-23 05:19:47] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 05:19:47] [INFO ] State equation strengthened by 290 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 905/1297 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1297 variables, 215/608 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1297 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 435/1732 variables, 189/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1732 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1732 variables, 75/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1732 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 101/1833 variables, 87/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1833 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 3/1836 variables, 3/963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1836 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1836 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1836/1836 variables, and 963 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2564 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 671/671 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 905/1297 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1297 variables, 215/608 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1297 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 435/1732 variables, 189/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1732 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1732 variables, 75/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1732 variables, 7/880 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 05:19:51] [INFO ] Deduced a trap composed of 135 places in 178 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1732 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1732 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 101/1833 variables, 87/968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1833 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 3/1836 variables, 3/971 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1836 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/1836 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1836/1836 variables, and 971 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3868 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 671/671 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 6556ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 6 properties in 1324 ms.
Support contains 2 out of 671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 671/671 places, 1732/1732 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 662 transition count 1714
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 662 transition count 1714
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 662 transition count 1712
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 654 transition count 1696
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 654 transition count 1696
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 647 transition count 1672
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 647 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 640 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 640 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 635 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 635 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 630 transition count 1638
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 630 transition count 1638
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 625 transition count 1628
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 625 transition count 1628
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 620 transition count 1618
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 620 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 615 transition count 1608
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 615 transition count 1608
Applied a total of 114 rules in 348 ms. Remains 615 /671 variables (removed 56) and now considering 1608/1732 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 615/671 places, 1608/1732 transitions.
RANDOM walk for 40014 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 400354 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 400354 steps, saw 259863 distinct states, run finished after 3004 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-23 05:19:59] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 05:19:59] [INFO ] Computed 2 invariants in 31 ms
[2024-05-23 05:19:59] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1476 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1476 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1476 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1538 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1538 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1678 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1476 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1476 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1476 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1476 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1538 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1539 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1539 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1678 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 05:20:00] [INFO ] Deduced a trap composed of 135 places in 146 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2144ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 74 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 73 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:20:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:20:01] [INFO ] Invariant cache hit.
[2024-05-23 05:20:02] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-23 05:20:02] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:20:02] [INFO ] Invariant cache hit.
[2024-05-23 05:20:02] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:20:04] [INFO ] Implicit Places using invariants and state equation in 1767 ms returned []
Implicit Place search using SMT with State Equation took 2609 ms to find 0 implicit places.
[2024-05-23 05:20:04] [INFO ] Redundant transitions in 82 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:20:04] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:20:04] [INFO ] Invariant cache hit.
[2024-05-23 05:20:04] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31595 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69696ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69711ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72489 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 948 edges and 615 vertex of which 192 / 615 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 727 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 487 transition count 871
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 477 transition count 871
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 477 transition count 798
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 404 transition count 798
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 341 transition count 735
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 341 transition count 735
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 341 transition count 609
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 675 place count 213 transition count 481
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 739 place count 149 transition count 353
Iterating global reduction 3 with 64 rules applied. Total rules applied 803 place count 149 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 804 place count 149 transition count 352
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 867 place count 86 transition count 226
Iterating global reduction 4 with 63 rules applied. Total rules applied 930 place count 86 transition count 226
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 993 place count 23 transition count 100
Iterating global reduction 4 with 63 rules applied. Total rules applied 1056 place count 23 transition count 100
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1119 place count 23 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1119 place count 23 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 22 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1125 place count 20 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1128 place count 20 transition count 32
Applied a total of 1128 rules in 177 ms. Remains 20 /615 variables (removed 595) and now considering 32/1608 (removed 1576) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 20 cols
[2024-05-23 05:21:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:21:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 05:21:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 05:21:14] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:21:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:21:14] [INFO ] After 53ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:21:14] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:21:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:21:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:21:14] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:21:14] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 05:21:14] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:21:14] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 388 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1716
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1676
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1626
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 614 transition count 1608
Applied a total of 196 rules in 546 ms. Remains 614 /709 variables (removed 95) and now considering 1608/1838 (removed 230) transitions.
[2024-05-23 05:21:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 05:21:15] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 05:21:16] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-05-23 05:21:16] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:21:16] [INFO ] Invariant cache hit.
[2024-05-23 05:21:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:21:17] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:21:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:21:17] [INFO ] Invariant cache hit.
[2024-05-23 05:21:17] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31409 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69069ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69085ms
Starting structural reductions in LTL mode, iteration 1 : 614/709 places, 1608/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72198 ms. Remains : 614/709 places, 1608/1838 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 544 ms.
Product exploration explored 100000 steps with 1 reset in 573 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40022 steps (8 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 175597 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 175597 steps, saw 113993 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-23 05:22:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:22:31] [INFO ] Invariant cache hit.
[2024-05-23 05:22:31] [INFO ] State equation strengthened by 265 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 1 solved, 2 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 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/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 2/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/742 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/743 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/743 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 141/1681 variables, 136/879 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-23 05:22:34] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 1/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/1686 variables, 3/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1687 variables, 1/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1687 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1687 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 884 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1969 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3007ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 347 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 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 614 transition count 1604
Applied a total of 4 rules in 267 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 162933 steps, run timeout after 3006 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 162933 steps, saw 105774 distinct states, run finished after 3007 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-23 05:22:38] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 05:22:38] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 05:22:38] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 05:22:40] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2487ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 222 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 05:22:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:22:41] [INFO ] Invariant cache hit.
[2024-05-23 05:22:41] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-23 05:22:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:22:41] [INFO ] Invariant cache hit.
[2024-05-23 05:22:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:22:43] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-23 05:22:43] [INFO ] Redundant transitions in 71 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 05:22:43] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:22:43] [INFO ] Invariant cache hit.
[2024-05-23 05:22:43] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68843ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68867ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71211 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 44 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 05:23:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:23:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:23:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 41 ms returned sat
[2024-05-23 05:23:52] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 05:23:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:23:52] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 05:23:52] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 05:23:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 05:23:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:23:52] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 05:23:52] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 05:23:52] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 05:23:52] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 260 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 15 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:23:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 05:23:53] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 05:23:53] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-23 05:23:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:23:53] [INFO ] Invariant cache hit.
[2024-05-23 05:23:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:23:55] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:23:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:23:55] [INFO ] Invariant cache hit.
[2024-05-23 05:23:55] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31495 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69019ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69033ms
Finished structural reductions in LTL mode , in 1 iterations and 71301 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40007 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 548043 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 548043 steps, saw 355714 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-23 05:25:07] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:25:07] [INFO ] Invariant cache hit.
[2024-05-23 05:25:07] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 141/1681 variables, 136/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 05:25:09] [INFO ] Deduced a trap composed of 135 places in 173 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1686 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1687 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 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 614 transition count 1604
Applied a total of 4 rules in 144 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40032 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 548155 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 548155 steps, saw 355785 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-23 05:25:12] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 05:25:12] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 05:25:12] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/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 Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 05:25:14] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1707ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 05:25:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:25:14] [INFO ] Invariant cache hit.
[2024-05-23 05:25:15] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-23 05:25:15] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:25:15] [INFO ] Invariant cache hit.
[2024-05-23 05:25:15] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:25:16] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2024-05-23 05:25:16] [INFO ] Redundant transitions in 27 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 05:25:16] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:25:16] [INFO ] Invariant cache hit.
[2024-05-23 05:25:16] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31590 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68714ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68727ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70904 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 34 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 05:26:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 05:26:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:26:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:26:25] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:26:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:26:25] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:26:25] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:26:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 05:26:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 05:26:25] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:26:25] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 05:26:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:26:25] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 123 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 431 ms.
Product exploration explored 100000 steps with 3 reset in 522 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 13 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:26:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 05:26:27] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 05:26:27] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-23 05:26:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:26:27] [INFO ] Invariant cache hit.
[2024-05-23 05:26:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:26:29] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:26:29] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:26:29] [INFO ] Invariant cache hit.
[2024-05-23 05:26:29] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
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 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68037ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68053ms
Finished structural reductions in LTL mode , in 1 iterations and 70172 ms. Remains : 614/614 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 383350 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)||F(p1)))'
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 697 transition count 1812
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 697 transition count 1812
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 697 transition count 1806
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 687 transition count 1786
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 687 transition count 1786
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 678 transition count 1758
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 678 transition count 1758
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 668 transition count 1724
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 668 transition count 1724
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 659 transition count 1702
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 659 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 115 place count 650 transition count 1684
Iterating global reduction 1 with 9 rules applied. Total rules applied 124 place count 650 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 132 place count 642 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 140 place count 642 transition count 1668
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 148 place count 634 transition count 1652
Iterating global reduction 1 with 8 rules applied. Total rules applied 156 place count 634 transition count 1652
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 164 place count 626 transition count 1634
Iterating global reduction 1 with 8 rules applied. Total rules applied 172 place count 626 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 175 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 178 place count 623 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 622 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 621 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 183 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 184 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 185 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 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 192 place count 618 transition count 1612
Applied a total of 192 rules in 479 ms. Remains 618 /709 variables (removed 91) and now considering 1612/1838 (removed 226) transitions.
[2024-05-23 05:27:38] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-23 05:27:38] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 05:27:38] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-23 05:27:38] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 05:27:38] [INFO ] Invariant cache hit.
[2024-05-23 05:27:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 05:27:40] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-23 05:27:40] [INFO ] Redundant transitions in 25 ms returned []
Running 1610 sub problems to find dead transitions.
[2024-05-23 05:27:40] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 05:27:40] [INFO ] Invariant cache hit.
[2024-05-23 05:27:40] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 6.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/268 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/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 268/888 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2498 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31388 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68358ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/709 places, 1612/1838 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71058 ms. Remains : 618/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-04
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-04 finished in 71176 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(G(p0)))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1750
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1750
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1712
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1712
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 106 place count 654 transition count 1688
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 654 transition count 1688
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 126 place count 644 transition count 1668
Iterating global reduction 1 with 10 rules applied. Total rules applied 136 place count 644 transition count 1668
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 145 place count 635 transition count 1650
Iterating global reduction 1 with 9 rules applied. Total rules applied 154 place count 635 transition count 1650
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 163 place count 626 transition count 1632
Iterating global reduction 1 with 9 rules applied. Total rules applied 172 place count 626 transition count 1632
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 617 transition count 1612
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 617 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 614 transition count 1604
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 614 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 613 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 612 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 611 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Applied a total of 206 rules in 249 ms. Remains 609 /709 variables (removed 100) and now considering 1594/1838 (removed 244) transitions.
[2024-05-23 05:28:49] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
// Phase 1: matrix 1065 rows 609 cols
[2024-05-23 05:28:49] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 05:28:49] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-23 05:28:49] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
[2024-05-23 05:28:49] [INFO ] Invariant cache hit.
[2024-05-23 05:28:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:28:51] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2024-05-23 05:28:51] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
[2024-05-23 05:28:51] [INFO ] Invariant cache hit.
[2024-05-23 05:28:51] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 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 609/1674 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 3 (OVERLAPS) 1065/1674 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1674 variables, 265/876 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/1674 variables, and 2468 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 31320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints]
After SMT, in 68564ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 68581ms
Starting structural reductions in LTL mode, iteration 1 : 609/709 places, 1594/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71191 ms. Remains : 609/709 places, 1594/1838 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-07 finished in 71406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&(p1||F(G(p2))))))))'
Support contains 5 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 697 transition count 1814
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 697 transition count 1814
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 697 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 687 transition count 1788
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 678 transition count 1760
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 678 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 668 transition count 1726
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 668 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 660 transition count 1706
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 660 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 652 transition count 1690
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 652 transition count 1690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 644 transition count 1674
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 644 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 144 place count 636 transition count 1658
Iterating global reduction 1 with 8 rules applied. Total rules applied 152 place count 636 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 628 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 625 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 625 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 624 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 624 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 623 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 622 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 621 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 621 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 183 place count 620 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 184 place count 620 transition count 1622
Applied a total of 184 rules in 249 ms. Remains 620 /709 variables (removed 89) and now considering 1622/1838 (removed 216) transitions.
[2024-05-23 05:30:00] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 620 cols
[2024-05-23 05:30:00] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 05:30:01] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-23 05:30:01] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 05:30:01] [INFO ] Invariant cache hit.
[2024-05-23 05:30:01] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 05:30:02] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
Running 1620 sub problems to find dead transitions.
[2024-05-23 05:30:02] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 05:30:02] [INFO ] Invariant cache hit.
[2024-05-23 05:30:02] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1704 variables, and 2 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1704 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1704 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 2510 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 31549 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
After SMT, in 68622ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 68637ms
Starting structural reductions in LTL mode, iteration 1 : 620/709 places, 1622/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70967 ms. Remains : 620/709 places, 1622/1838 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-08
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-08 finished in 71285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 695 transition count 1808
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 695 transition count 1808
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 695 transition count 1802
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 683 transition count 1778
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 683 transition count 1778
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 672 transition count 1744
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 672 transition count 1744
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 92 place count 660 transition count 1704
Iterating global reduction 1 with 12 rules applied. Total rules applied 104 place count 660 transition count 1704
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 650 transition count 1680
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 650 transition count 1680
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 134 place count 640 transition count 1660
Iterating global reduction 1 with 10 rules applied. Total rules applied 144 place count 640 transition count 1660
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 153 place count 631 transition count 1642
Iterating global reduction 1 with 9 rules applied. Total rules applied 162 place count 631 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 622 transition count 1624
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 189 place count 613 transition count 1604
Iterating global reduction 1 with 9 rules applied. Total rules applied 198 place count 613 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 201 place count 610 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 605 transition count 1586
Applied a total of 214 rules in 238 ms. Remains 605 /709 variables (removed 104) and now considering 1586/1838 (removed 252) transitions.
[2024-05-23 05:31:11] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-23 05:31:11] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 05:31:12] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-23 05:31:12] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 05:31:12] [INFO ] Invariant cache hit.
[2024-05-23 05:31:12] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 05:31:14] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 05:31:14] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 05:31:14] [INFO ] Invariant cache hit.
[2024-05-23 05:31:14] [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
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 30027 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 31479 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 69247ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 69264ms
Starting structural reductions in LTL mode, iteration 1 : 605/709 places, 1586/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71585 ms. Remains : 605/709 places, 1586/1838 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-09
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-09 finished in 71678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p0)&&G(p1))||X(G(p0)))))'
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 684 transition count 1780
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 684 transition count 1780
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 673 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 673 transition count 1746
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 661 transition count 1706
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 661 transition count 1706
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 112 place count 651 transition count 1682
Iterating global reduction 1 with 10 rules applied. Total rules applied 122 place count 651 transition count 1682
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 132 place count 641 transition count 1662
Iterating global reduction 1 with 10 rules applied. Total rules applied 142 place count 641 transition count 1662
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 151 place count 632 transition count 1644
Iterating global reduction 1 with 9 rules applied. Total rules applied 160 place count 632 transition count 1644
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 169 place count 623 transition count 1626
Iterating global reduction 1 with 9 rules applied. Total rules applied 178 place count 623 transition count 1626
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 187 place count 614 transition count 1606
Iterating global reduction 1 with 9 rules applied. Total rules applied 196 place count 614 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 199 place count 611 transition count 1598
Iterating global reduction 1 with 3 rules applied. Total rules applied 202 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 606 transition count 1588
Applied a total of 212 rules in 223 ms. Remains 606 /709 variables (removed 103) and now considering 1588/1838 (removed 250) transitions.
[2024-05-23 05:32:23] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2024-05-23 05:32:23] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 05:32:23] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-23 05:32:23] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-23 05:32:23] [INFO ] Invariant cache hit.
[2024-05-23 05:32:24] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 05:32:25] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
Running 1586 sub problems to find dead transitions.
[2024-05-23 05:32:25] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-23 05:32:25] [INFO ] Invariant cache hit.
[2024-05-23 05:32:25] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1667 variables, and 2 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 3 (OVERLAPS) 1061/1667 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1667 variables, 264/872 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1667/1667 variables, and 2458 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 31637 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints]
After SMT, in 70308ms problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 70322ms
Starting structural reductions in LTL mode, iteration 1 : 606/709 places, 1588/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72353 ms. Remains : 606/709 places, 1588/1838 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-10 finished in 72585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1750
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1750
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1712
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1672
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1640
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 620 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 620 transition count 1620
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 188 place count 620 transition count 1616
Applied a total of 188 rules in 361 ms. Remains 620 /709 variables (removed 89) and now considering 1616/1838 (removed 222) transitions.
[2024-05-23 05:33:36] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
// Phase 1: matrix 1079 rows 620 cols
[2024-05-23 05:33:36] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 05:33:36] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-23 05:33:36] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 05:33:36] [INFO ] Invariant cache hit.
[2024-05-23 05:33:37] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 05:33:38] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
[2024-05-23 05:33:38] [INFO ] Redundant transitions in 27 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 05:33:38] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 05:33:38] [INFO ] Invariant cache hit.
[2024-05-23 05:33:38] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1699 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 266/888 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1699/1699 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31697 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 69282ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 69297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/709 places, 1616/1838 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71785 ms. Remains : 620/709 places, 1616/1838 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-11
Product exploration explored 100000 steps with 11 reset in 479 ms.
Product exploration explored 100000 steps with 65 reset in 591 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36960 steps (8 resets) in 99 ms. (369 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 81 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-23 05:34:49] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 05:34:49] [INFO ] Invariant cache hit.
[2024-05-23 05:34:49] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-23 05:34:49] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 05:34:49] [INFO ] Invariant cache hit.
[2024-05-23 05:34:50] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 05:34:51] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2024-05-23 05:34:51] [INFO ] Redundant transitions in 22 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 05:34:51] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 05:34:51] [INFO ] Invariant cache hit.
[2024-05-23 05:34:51] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1699 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 266/888 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1699/1699 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31686 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 69324ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 69338ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71599 ms. Remains : 620/620 places, 1616/1616 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30561 steps (6 resets) in 91 ms. (332 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 98 reset in 459 ms.
Product exploration explored 100000 steps with 37 reset in 596 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 89 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-23 05:36:02] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 05:36:02] [INFO ] Invariant cache hit.
[2024-05-23 05:36:03] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-23 05:36:03] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 05:36:03] [INFO ] Invariant cache hit.
[2024-05-23 05:36:03] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 05:36:05] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2024-05-23 05:36:05] [INFO ] Redundant transitions in 30 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 05:36:05] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 05:36:05] [INFO ] Invariant cache hit.
[2024-05-23 05:36:05] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1699 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 266/888 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1699/1699 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31523 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 69376ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 69391ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71643 ms. Remains : 620/620 places, 1616/1616 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-11 finished in 218513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||p1))))))'
Support contains 3 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 685 transition count 1784
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 685 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 675 transition count 1752
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 665 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 665 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 642 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 642 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 145 place count 635 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 152 place count 635 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 627 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 170 place count 625 transition count 1632
Iterating global reduction 1 with 2 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 174 place count 623 transition count 1628
Iterating global reduction 1 with 2 rules applied. Total rules applied 176 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 178 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 186 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 226 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-23 05:37:14] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 05:37:14] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 05:37:15] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-23 05:37:15] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:37:15] [INFO ] Invariant cache hit.
[2024-05-23 05:37:15] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:37:16] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 05:37:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:37:16] [INFO ] Invariant cache hit.
[2024-05-23 05:37:16] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31614 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 70444ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 70458ms
Starting structural reductions in LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72677 ms. Remains : 615/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12
Product exploration explored 100000 steps with 33232 reset in 485 ms.
Product exploration explored 100000 steps with 33388 reset in 483 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 165672 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 4
Probabilistic random walk after 165672 steps, saw 107551 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-23 05:38:31] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:38:31] [INFO ] Invariant cache hit.
[2024-05-23 05:38:31] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1541 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1541 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1542 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 140/1682 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1689 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1690 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1541 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 140/1682 variables, 135/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 05:38:34] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1689 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1689 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1690 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2962 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3998ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1263 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 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 615 transition count 1608
Applied a total of 4 rules in 143 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 615/615 places, 1608/1612 transitions.
RANDOM walk for 40007 steps (8 resets) in 575 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 178544 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 3
Probabilistic random walk after 178544 steps, saw 115907 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-23 05:38:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 05:38:40] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 05:38:40] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 3 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 05:38:42] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 886 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2384 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3236ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1620 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 82 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 78 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:38:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:38:45] [INFO ] Invariant cache hit.
[2024-05-23 05:38:45] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-23 05:38:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:38:45] [INFO ] Invariant cache hit.
[2024-05-23 05:38:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:38:47] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 2172 ms to find 0 implicit places.
[2024-05-23 05:38:47] [INFO ] Redundant transitions in 28 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:38:47] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:38:47] [INFO ] Invariant cache hit.
[2024-05-23 05:38:47] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69215ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71521 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 38 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-23 05:39:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:39:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:39:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:39:57] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-23 05:39:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:39:57] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 05:39:57] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 05:39:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:39:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:39:57] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 05:39:57] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 05:39:57] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 05:39:57] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 155 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 19 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 05:39:57] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 05:39:57] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 05:39:57] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-23 05:39:57] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:39:57] [INFO ] Invariant cache hit.
[2024-05-23 05:39:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:39:59] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 05:39:59] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:39:59] [INFO ] Invariant cache hit.
[2024-05-23 05:39:59] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69552ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69569ms
Finished structural reductions in LTL mode , in 1 iterations and 71573 ms. Remains : 615/615 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 : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40018 steps (8 resets) in 752 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 153214 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 153214 steps, saw 99467 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-23 05:41:12] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:41:12] [INFO ] Invariant cache hit.
[2024-05-23 05:41:12] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1541 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1541 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1542 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 140/1682 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1689 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1690 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1541 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 140/1682 variables, 135/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 05:41:15] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1689 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1689 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1690 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3920ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1369 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 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 615 transition count 1608
Applied a total of 4 rules in 170 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 615/615 places, 1608/1612 transitions.
RANDOM walk for 40020 steps (8 resets) in 487 ms. (82 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 174593 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 174593 steps, saw 113340 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-23 05:41:21] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 05:41:21] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 05:41:21] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 3 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 05:41:23] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 886 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3220ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1574 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 76 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 70 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:41:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:41:26] [INFO ] Invariant cache hit.
[2024-05-23 05:41:26] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-23 05:41:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:41:26] [INFO ] Invariant cache hit.
[2024-05-23 05:41:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:41:28] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
[2024-05-23 05:41:28] [INFO ] Redundant transitions in 30 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:41:28] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:41:28] [INFO ] Invariant cache hit.
[2024-05-23 05:41:28] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31657 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69581ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69596ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71852 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 50 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-23 05:42:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:42:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 05:42:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:42:38] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-23 05:42:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:42:38] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 05:42:38] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 05:42:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 05:42:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:42:38] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 05:42:38] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 05:42:38] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 05:42:38] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 152 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33413 reset in 507 ms.
Product exploration explored 100000 steps with 33496 reset in 499 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 19 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 05:42:39] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 05:42:40] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 05:42:40] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-23 05:42:40] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:42:40] [INFO ] Invariant cache hit.
[2024-05-23 05:42:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:42:41] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 05:42:41] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:42:41] [INFO ] Invariant cache hit.
[2024-05-23 05:42:42] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31700 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69596ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69612ms
Finished structural reductions in LTL mode , in 1 iterations and 71619 ms. Remains : 615/615 places, 1612/1612 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 397137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 684 transition count 1782
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 684 transition count 1782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 673 transition count 1748
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 673 transition count 1748
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 88 place count 661 transition count 1708
Iterating global reduction 1 with 12 rules applied. Total rules applied 100 place count 661 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 110 place count 651 transition count 1684
Iterating global reduction 1 with 10 rules applied. Total rules applied 120 place count 651 transition count 1684
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 130 place count 641 transition count 1664
Iterating global reduction 1 with 10 rules applied. Total rules applied 140 place count 641 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 148 place count 633 transition count 1648
Iterating global reduction 1 with 8 rules applied. Total rules applied 156 place count 633 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 164 place count 625 transition count 1632
Iterating global reduction 1 with 8 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 180 place count 617 transition count 1616
Iterating global reduction 1 with 8 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 160 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-23 05:43:51] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 05:43:51] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 05:43:52] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-23 05:43:52] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:43:52] [INFO ] Invariant cache hit.
[2024-05-23 05:43:52] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:43:53] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 05:43:53] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:43:53] [INFO ] Invariant cache hit.
[2024-05-23 05:43:53] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69457ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69472ms
Starting structural reductions in LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71618 ms. Remains : 615/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 545 ms.
Product exploration explored 100000 steps with 33333 reset in 480 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLFireability-13 finished in 72815 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&&G(p1)&&X((p2&&X(p3))))))'
Support contains 6 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 698 transition count 1814
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 698 transition count 1814
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 698 transition count 1810
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 689 transition count 1792
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 689 transition count 1792
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 680 transition count 1766
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 680 transition count 1766
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 670 transition count 1734
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 670 transition count 1734
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 90 place count 662 transition count 1714
Iterating global reduction 1 with 8 rules applied. Total rules applied 98 place count 662 transition count 1714
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 654 transition count 1698
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 654 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 647 transition count 1684
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 647 transition count 1684
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 640 transition count 1670
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 640 transition count 1670
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 149 place count 633 transition count 1654
Iterating global reduction 1 with 7 rules applied. Total rules applied 156 place count 633 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 159 place count 630 transition count 1646
Iterating global reduction 1 with 3 rules applied. Total rules applied 162 place count 630 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 629 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 629 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 628 transition count 1642
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 628 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 627 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 626 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 626 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 625 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 625 transition count 1636
Applied a total of 172 rules in 268 ms. Remains 625 /709 variables (removed 84) and now considering 1636/1838 (removed 202) transitions.
[2024-05-23 05:45:04] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 625 cols
[2024-05-23 05:45:04] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 05:45:05] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-23 05:45:05] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 05:45:05] [INFO ] Invariant cache hit.
[2024-05-23 05:45:05] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-23 05:45:06] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
Running 1634 sub problems to find dead transitions.
[2024-05-23 05:45:06] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 05:45:06] [INFO ] Invariant cache hit.
[2024-05-23 05:45:06] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1718 variables, and 2 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/625 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 3 (OVERLAPS) 1093/1718 variables, 625/627 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 270/897 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 31727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 625/625 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
After SMT, in 69716ms problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 69733ms
Starting structural reductions in LTL mode, iteration 1 : 625/709 places, 1636/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71884 ms. Remains : 625/709 places, 1636/1838 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-15
Entered a terminal (fully accepting) state of product in 236 steps with 1 reset in 2 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-15 finished in 72138 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((X(p1)||p0)))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLFireability-02
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1716
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1676
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1626
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 614 transition count 1608
Applied a total of 196 rules in 276 ms. Remains 614 /709 variables (removed 95) and now considering 1608/1838 (removed 230) transitions.
[2024-05-23 05:46:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 05:46:17] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 05:46:17] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-23 05:46:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:46:17] [INFO ] Invariant cache hit.
[2024-05-23 05:46:17] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:46:19] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:46:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:46:19] [INFO ] Invariant cache hit.
[2024-05-23 05:46:19] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68819ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68836ms
Starting structural reductions in LI_LTL mode, iteration 1 : 614/709 places, 1608/1838 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71198 ms. Remains : 614/709 places, 1608/1838 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 431 ms.
Product exploration explored 100000 steps with 0 reset in 468 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40029 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 91076 steps, run timeout after 3009 ms. (steps per millisecond=30 ) properties seen :0 out of 3
Probabilistic random walk after 91076 steps, saw 59138 distinct states, run finished after 3011 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-23 05:47:32] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:47:32] [INFO ] Invariant cache hit.
[2024-05-23 05:47:32] [INFO ] State equation strengthened by 265 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 1 solved, 2 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 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/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 2/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/742 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/743 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/743 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 141/1681 variables, 136/879 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-23 05:47:34] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 1/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/1686 variables, 3/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1687 variables, 1/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1687 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1687 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 884 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2598ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 299 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 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 614 transition count 1604
Applied a total of 4 rules in 143 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40001 steps (8 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 264718 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 264718 steps, saw 171833 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-23 05:47:38] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 05:47:38] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 05:47:38] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 05:47:40] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2582ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 393 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 93 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 79 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 05:47:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:47:41] [INFO ] Invariant cache hit.
[2024-05-23 05:47:42] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-23 05:47:42] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:47:42] [INFO ] Invariant cache hit.
[2024-05-23 05:47:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:47:43] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
[2024-05-23 05:47:43] [INFO ] Redundant transitions in 23 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 05:47:43] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:47:43] [INFO ] Invariant cache hit.
[2024-05-23 05:47:43] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 70484ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 70499ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72662 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 30 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 05:48:54] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 05:48:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:48:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:48:54] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 05:48:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:48:54] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 05:48:54] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 05:48:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:48:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 05:48:54] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 05:48:54] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 05:48:54] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 05:48:54] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 155 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 14 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:48:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 05:48:55] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 05:48:55] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-23 05:48:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:48:55] [INFO ] Invariant cache hit.
[2024-05-23 05:48:55] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:48:57] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:48:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:48:57] [INFO ] Invariant cache hit.
[2024-05-23 05:48:57] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31709 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69855ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69870ms
Finished structural reductions in LTL mode , in 1 iterations and 72057 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40045 steps (8 resets) in 103 ms. (385 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 487350 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 487350 steps, saw 316324 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-23 05:50:10] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:50:10] [INFO ] Invariant cache hit.
[2024-05-23 05:50:10] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 141/1681 variables, 136/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 05:50:11] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1686 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1687 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1853ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 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 614 transition count 1604
Applied a total of 4 rules in 165 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40004 steps (9 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 465444 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 465444 steps, saw 302107 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-23 05:50:15] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 05:50:15] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 05:50:15] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/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 Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 05:50:17] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1859ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 79 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 78 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 05:50:17] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:50:17] [INFO ] Invariant cache hit.
[2024-05-23 05:50:18] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-23 05:50:18] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:50:18] [INFO ] Invariant cache hit.
[2024-05-23 05:50:18] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:50:19] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2024-05-23 05:50:19] [INFO ] Redundant transitions in 27 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 05:50:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 05:50:19] [INFO ] Invariant cache hit.
[2024-05-23 05:50:19] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69655ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71845 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 3 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 43 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 05:51:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:51:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:51:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:51:29] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 05:51:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:51:29] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:51:29] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 05:51:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:51:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:51:29] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 05:51:29] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 05:51:29] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 05:51:29] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 123 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 450 ms.
Product exploration explored 100000 steps with 4 reset in 549 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 19 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:51:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 05:51:31] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 05:51:31] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-23 05:51:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:51:31] [INFO ] Invariant cache hit.
[2024-05-23 05:51:32] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:51:33] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:51:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:51:33] [INFO ] Invariant cache hit.
[2024-05-23 05:51:33] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 timeout
1.0)
(s359 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31559 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69413ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69431ms
Finished structural reductions in LTL mode , in 1 iterations and 71549 ms. Remains : 614/614 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 386302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||p1))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c016-LTLFireability-12
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 709 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 685 transition count 1784
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 685 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 675 transition count 1752
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 665 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 665 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 642 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 642 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 145 place count 635 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 152 place count 635 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 627 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 170 place count 625 transition count 1632
Iterating global reduction 1 with 2 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 174 place count 623 transition count 1628
Iterating global reduction 1 with 2 rules applied. Total rules applied 176 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 178 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 186 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 283 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-23 05:52:43] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 05:52:43] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 05:52:43] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-23 05:52:43] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:52:43] [INFO ] Invariant cache hit.
[2024-05-23 05:52:44] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:52:45] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 05:52:45] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:52:45] [INFO ] Invariant cache hit.
[2024-05-23 05:52:45] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31612 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68878ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68895ms
Starting structural reductions in LI_LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71293 ms. Remains : 615/709 places, 1612/1838 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12
Product exploration explored 100000 steps with 33289 reset in 551 ms.
Product exploration explored 100000 steps with 33298 reset in 540 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 186 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40001 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 155232 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 155232 steps, saw 100776 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-23 05:53:59] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:53:59] [INFO ] Invariant cache hit.
[2024-05-23 05:53:59] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1541 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1541 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1542 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 140/1682 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1689 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1690 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1541 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 140/1682 variables, 135/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 05:54:01] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1689 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1689 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1690 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4102ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1381 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 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 615 transition count 1608
Applied a total of 4 rules in 172 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 615/615 places, 1608/1612 transitions.
RANDOM walk for 40019 steps (8 resets) in 560 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 198653 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 3
Probabilistic random walk after 198653 steps, saw 128957 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-23 05:54:08] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 05:54:08] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 05:54:08] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 3 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 05:54:10] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 886 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3430ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1324 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 89 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 82 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:54:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:54:12] [INFO ] Invariant cache hit.
[2024-05-23 05:54:13] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-23 05:54:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:54:13] [INFO ] Invariant cache hit.
[2024-05-23 05:54:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:54:15] [INFO ] Implicit Places using invariants and state equation in 1820 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2024-05-23 05:54:15] [INFO ] Redundant transitions in 25 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:54:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:54:15] [INFO ] Invariant cache hit.
[2024-05-23 05:54:15] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69560ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69574ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71868 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 26 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-23 05:55:24] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 05:55:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:55:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:55:24] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-23 05:55:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:55:24] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 05:55:24] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 05:55:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:55:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 05:55:24] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 05:55:24] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 05:55:24] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 05:55:24] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 142 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 18 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 05:55:25] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 05:55:25] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 05:55:25] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-23 05:55:25] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:55:25] [INFO ] Invariant cache hit.
[2024-05-23 05:55:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:55:27] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 05:55:27] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:55:27] [INFO ] Invariant cache hit.
[2024-05-23 05:55:27] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69481ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69499ms
Finished structural reductions in LTL mode , in 1 iterations and 71500 ms. Remains : 615/615 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 : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40023 steps (8 resets) in 610 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 152632 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 152632 steps, saw 99089 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-23 05:56:40] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:56:40] [INFO ] Invariant cache hit.
[2024-05-23 05:56:40] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1541 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1541 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1542 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 140/1682 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1689 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1690 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1541 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 140/1682 variables, 135/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 05:56:43] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1689 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1689 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1690 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4101ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1454 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 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 615 transition count 1608
Applied a total of 4 rules in 150 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 615/615 places, 1608/1612 transitions.
RANDOM walk for 40018 steps (8 resets) in 565 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 150582 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 150582 steps, saw 97757 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-23 05:56:49] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 05:56:49] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 05:56:49] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 05:56:51] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2965 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3974ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 2298 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 77 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 615/615 places, 1608/1608 transitions.
RANDOM walk for 40003 steps (8 resets) in 371 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 216993 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 3
Probabilistic random walk after 216993 steps, saw 140859 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-23 05:56:59] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:56:59] [INFO ] Invariant cache hit.
[2024-05-23 05:56:59] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 3 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 05:57:01] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 886 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2458 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3304ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1278 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 74 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 05:57:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:57:03] [INFO ] Invariant cache hit.
[2024-05-23 05:57:04] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-23 05:57:04] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:57:04] [INFO ] Invariant cache hit.
[2024-05-23 05:57:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:57:05] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2142 ms to find 0 implicit places.
[2024-05-23 05:57:05] [INFO ] Redundant transitions in 26 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 05:57:05] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 05:57:05] [INFO ] Invariant cache hit.
[2024-05-23 05:57:05] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68977ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71242 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 27 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-23 05:58:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 05:58:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:58:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:58:14] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-23 05:58:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 05:58:14] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 05:58:15] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 05:58:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 05:58:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 05:58:15] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 05:58:15] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 05:58:15] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 05:58:15] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 171 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 142 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33446 reset in 506 ms.
Product exploration explored 100000 steps with 33331 reset in 498 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 17 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 05:58:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 05:58:16] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 05:58:17] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-23 05:58:17] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:58:17] [INFO ] Invariant cache hit.
[2024-05-23 05:58:17] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 05:58:18] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 05:58:18] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 05:58:18] [INFO ] Invariant cache hit.
[2024-05-23 05:58:18] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69261ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69276ms
Finished structural reductions in LTL mode , in 1 iterations and 71333 ms. Remains : 615/615 places, 1612/1612 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 405128 ms.
[2024-05-23 05:59:28] [INFO ] Flatten gal took : 127 ms
[2024-05-23 05:59:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 05:59:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 709 places, 1838 transitions and 7478 arcs took 12 ms.
Total runtime 2468914 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c016

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 709
TRANSITIONS: 1838
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.032s, Sys 0.007s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2242
MODEL NAME: /home/mcc/execution/411/model
709 places, 1838 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

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