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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K 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 4.1K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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:26 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-c002-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716433289149

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 03:01:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 03:01:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:01:30] [INFO ] Load time of PNML (sax parser for PT used): 407 ms
[2024-05-23 03:01:30] [INFO ] Transformed 2826 places.
[2024-05-23 03:01:30] [INFO ] Transformed 8960 transitions.
[2024-05-23 03:01:30] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 601 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1198 places in 58 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c002-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 310 place count 1318 transition count 3720
Iterating global reduction 1 with 294 rules applied. Total rules applied 604 place count 1318 transition count 3720
Ensure Unique test removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 1 with 372 rules applied. Total rules applied 976 place count 1318 transition count 3348
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1129 place count 1165 transition count 3042
Iterating global reduction 2 with 153 rules applied. Total rules applied 1282 place count 1165 transition count 3042
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1358 place count 1165 transition count 2966
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1371 place count 1152 transition count 2940
Iterating global reduction 3 with 13 rules applied. Total rules applied 1384 place count 1152 transition count 2940
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1397 place count 1139 transition count 2914
Iterating global reduction 3 with 13 rules applied. Total rules applied 1410 place count 1139 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1423 place count 1126 transition count 2888
Iterating global reduction 3 with 13 rules applied. Total rules applied 1436 place count 1126 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1449 place count 1113 transition count 2862
Iterating global reduction 3 with 13 rules applied. Total rules applied 1462 place count 1113 transition count 2862
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1474 place count 1101 transition count 2838
Iterating global reduction 3 with 12 rules applied. Total rules applied 1486 place count 1101 transition count 2838
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1497 place count 1090 transition count 2816
Iterating global reduction 3 with 11 rules applied. Total rules applied 1508 place count 1090 transition count 2816
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1519 place count 1079 transition count 2794
Iterating global reduction 3 with 11 rules applied. Total rules applied 1530 place count 1079 transition count 2794
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1572 place count 1037 transition count 2638
Iterating global reduction 3 with 42 rules applied. Total rules applied 1614 place count 1037 transition count 2638
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1667 place count 984 transition count 2426
Iterating global reduction 3 with 53 rules applied. Total rules applied 1720 place count 984 transition count 2426
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1773 place count 931 transition count 2286
Iterating global reduction 3 with 53 rules applied. Total rules applied 1826 place count 931 transition count 2286
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1878 place count 879 transition count 2182
Iterating global reduction 3 with 52 rules applied. Total rules applied 1930 place count 879 transition count 2182
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 1981 place count 828 transition count 2080
Iterating global reduction 3 with 51 rules applied. Total rules applied 2032 place count 828 transition count 2080
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2083 place count 777 transition count 1978
Iterating global reduction 3 with 51 rules applied. Total rules applied 2134 place count 777 transition count 1978
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2185 place count 726 transition count 1876
Iterating global reduction 3 with 51 rules applied. Total rules applied 2236 place count 726 transition count 1876
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2252 place count 710 transition count 1844
Iterating global reduction 3 with 16 rules applied. Total rules applied 2268 place count 710 transition count 1844
Applied a total of 2268 rules in 1302 ms. Remains 710 /1628 variables (removed 918) and now considering 1844/5962 (removed 4118) transitions.
[2024-05-23 03:01:32] [INFO ] Flow matrix only has 1237 transitions (discarded 607 similar events)
// Phase 1: matrix 1237 rows 710 cols
[2024-05-23 03:01:32] [INFO ] Computed 2 invariants in 35 ms
[2024-05-23 03:01:33] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-23 03:01:33] [INFO ] Flow matrix only has 1237 transitions (discarded 607 similar events)
[2024-05-23 03:01:33] [INFO ] Invariant cache hit.
[2024-05-23 03:01:33] [INFO ] State equation strengthened by 299 read => feed constraints.
[2024-05-23 03:01:35] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 2970 ms to find 0 implicit places.
Running 1842 sub problems to find dead transitions.
[2024-05-23 03:01:35] [INFO ] Flow matrix only has 1237 transitions (discarded 607 similar events)
[2024-05-23 03:01:35] [INFO ] Invariant cache hit.
[2024-05-23 03:01:35] [INFO ] State equation strengthened by 299 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/709 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/709 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 709/1947 variables, and 2 constraints, problems are : Problem set: 0 solved, 1842 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/710 constraints, ReadFeed: 0/299 constraints, PredecessorRefiner: 1842/1842 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1842 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/709 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/709 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/709 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1842 unsolved
At refinement iteration 3 (OVERLAPS) 1237/1946 variables, 709/711 constraints. Problems are: Problem set: 0 solved, 1842 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1946 variables, 299/1010 constraints. Problems are: Problem set: 0 solved, 1842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1946/1947 variables, and 1266 constraints, problems are : Problem set: 0 solved, 1842 unsolved in 30330 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 709/710 constraints, ReadFeed: 299/299 constraints, PredecessorRefiner: 256/1842 constraints, Known Traps: 0/0 constraints]
After SMT, in 68335ms problems are : Problem set: 0 solved, 1842 unsolved
Search for dead transitions found 0 dead transitions in 68368ms
Starting structural reductions in LTL mode, iteration 1 : 710/1628 places, 1844/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72683 ms. Remains : 710/1628 places, 1844/5962 transitions.
Support contains 21 out of 710 places after structural reductions.
[2024-05-23 03:02:44] [INFO ] Flatten gal took : 136 ms
[2024-05-23 03:02:44] [INFO ] Flatten gal took : 89 ms
[2024-05-23 03:02:44] [INFO ] Input system was already deterministic with 1844 transitions.
RANDOM walk for 40000 steps (8 resets) in 3242 ms. (12 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 299 ms. (133 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
[2024-05-23 03:02:45] [INFO ] Flow matrix only has 1237 transitions (discarded 607 similar events)
[2024-05-23 03:02:45] [INFO ] Invariant cache hit.
[2024-05-23 03:02:45] [INFO ] State equation strengthened by 299 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 382/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/415 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 715/1130 variables, 415/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1130 variables, 14/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1130 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (OVERLAPS) 297/1427 variables, 33/464 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1427 variables, 220/684 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1427 variables, 0/684 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 415/1842 variables, 177/861 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1842 variables, 65/926 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1842 variables, 0/926 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 88/1930 variables, 76/1002 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1930 variables, 0/1002 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 15/1945 variables, 7/1009 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1945 variables, 0/1009 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1947 variables, 2/1011 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1947 variables, 0/1011 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1947 variables, 0/1011 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 1011 constraints, problems are : Problem set: 1 solved, 3 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 710/710 constraints, ReadFeed: 299/299 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 382/387 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/415 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 715/1130 variables, 415/417 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1130 variables, 14/431 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1130 variables, 0/431 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 297/1427 variables, 33/464 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1427 variables, 220/684 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1427 variables, 3/687 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-23 03:02:47] [INFO ] Deduced a trap composed of 135 places in 196 ms of which 29 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1427 variables, 1/688 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1427 variables, 0/688 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 415/1842 variables, 177/865 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1842 variables, 65/930 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1842 variables, 0/930 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 88/1930 variables, 76/1006 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1930 variables, 0/1006 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 15/1945 variables, 7/1013 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1945 variables, 0/1013 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/1947 variables, 2/1015 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1947 variables, 0/1015 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1947 variables, 0/1015 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 1015 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1572 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 710/710 constraints, ReadFeed: 299/299 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2538ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 2 properties in 204 ms.
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Graph (complete) has 3039 edges and 710 vertex of which 517 are kept as prefixes of interest. Removing 193 places using SCC suffix rule.6 ms
Discarding 193 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 517 transition count 1460
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 396 place count 506 transition count 1434
Iterating global reduction 1 with 11 rules applied. Total rules applied 407 place count 506 transition count 1434
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 413 place count 506 transition count 1428
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 422 place count 497 transition count 1406
Iterating global reduction 2 with 9 rules applied. Total rules applied 431 place count 497 transition count 1406
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 439 place count 489 transition count 1382
Iterating global reduction 2 with 8 rules applied. Total rules applied 447 place count 489 transition count 1382
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 454 place count 482 transition count 1362
Iterating global reduction 2 with 7 rules applied. Total rules applied 461 place count 482 transition count 1362
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 468 place count 475 transition count 1348
Iterating global reduction 2 with 7 rules applied. Total rules applied 475 place count 475 transition count 1348
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 483 place count 467 transition count 1326
Iterating global reduction 2 with 8 rules applied. Total rules applied 491 place count 467 transition count 1326
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 499 place count 459 transition count 1304
Iterating global reduction 2 with 8 rules applied. Total rules applied 507 place count 459 transition count 1304
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 515 place count 451 transition count 1288
Iterating global reduction 2 with 8 rules applied. Total rules applied 523 place count 451 transition count 1288
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 530 place count 444 transition count 1274
Iterating global reduction 2 with 7 rules applied. Total rules applied 537 place count 444 transition count 1274
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 541 place count 440 transition count 1264
Iterating global reduction 2 with 4 rules applied. Total rules applied 545 place count 440 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 549 place count 436 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 553 place count 436 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 557 place count 432 transition count 1246
Iterating global reduction 2 with 4 rules applied. Total rules applied 561 place count 432 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 562 place count 431 transition count 1244
Iterating global reduction 2 with 1 rules applied. Total rules applied 563 place count 431 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 564 place count 430 transition count 1242
Iterating global reduction 2 with 1 rules applied. Total rules applied 565 place count 430 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 566 place count 429 transition count 1240
Iterating global reduction 2 with 1 rules applied. Total rules applied 567 place count 429 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 568 place count 428 transition count 1238
Iterating global reduction 2 with 1 rules applied. Total rules applied 569 place count 428 transition count 1238
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 573 place count 428 transition count 1234
Applied a total of 573 rules in 402 ms. Remains 428 /710 variables (removed 282) and now considering 1234/1844 (removed 610) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 428/710 places, 1234/1844 transitions.
RANDOM walk for 40001 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 528523 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 528523 steps, saw 324082 distinct states, run finished after 3004 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-23 03:02:51] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
// Phase 1: matrix 700 rows 428 cols
[2024-05-23 03:02:51] [INFO ] Computed 3 invariants in 8 ms
[2024-05-23 03:02:51] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/369 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 612/981 variables, 336/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1043 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1043 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/1118 variables, 71/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1118 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/1125 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1125 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1128 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1128 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1128 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1128/1128 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/369 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 612/981 variables, 336/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 74/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1043 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1043 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/1118 variables, 71/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1118 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1125 variables, 4/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1125 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1128 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1128 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1128 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1128/1128 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 648ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1234/1234 transitions.
Applied a total of 0 rules in 51 ms. Remains 428 /428 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 428/428 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1234/1234 transitions.
Applied a total of 0 rules in 48 ms. Remains 428 /428 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-23 03:02:52] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-23 03:02:52] [INFO ] Invariant cache hit.
[2024-05-23 03:02:53] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-23 03:02:53] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-23 03:02:53] [INFO ] Invariant cache hit.
[2024-05-23 03:02:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 03:02:54] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2024-05-23 03:02:54] [INFO ] Redundant transitions in 75 ms returned []
Running 1232 sub problems to find dead transitions.
[2024-05-23 03:02:54] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
[2024-05-23 03:02:54] [INFO ] Invariant cache hit.
[2024-05-23 03:02:54] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
[2024-05-23 03:03:08] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
At refinement iteration 3 (OVERLAPS) 700/1128 variables, 428/432 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
SMT process timed out in 34489ms, After SMT, problems are : Problem set: 0 solved, 1232 unsolved
Search for dead transitions found 0 dead transitions in 34502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36126 ms. Remains : 428/428 places, 1234/1234 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 428 transition count 689
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 556 place count 417 transition count 689
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 556 place count 417 transition count 615
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 704 place count 343 transition count 615
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 2 with 256 rules applied. Total rules applied 960 place count 215 transition count 487
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1024 place count 151 transition count 359
Iterating global reduction 2 with 64 rules applied. Total rules applied 1088 place count 151 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1089 place count 151 transition count 358
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1152 place count 88 transition count 232
Iterating global reduction 3 with 63 rules applied. Total rules applied 1215 place count 88 transition count 232
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1278 place count 25 transition count 106
Iterating global reduction 3 with 63 rules applied. Total rules applied 1341 place count 25 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1404 place count 25 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1404 place count 25 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1406 place count 24 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 23 transition count 41
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 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1413 place count 22 transition count 38
Applied a total of 1413 rules in 87 ms. Remains 22 /428 variables (removed 406) and now considering 38/1234 (removed 1196) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 22 cols
[2024-05-23 03:03:28] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 03:03:28] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 03:03:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:03:28] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 03:03:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 03:03:28] [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 03:03:28] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 03:03:28] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA FunctionPointer-PT-c002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 4063 edges and 710 vertex of which 709 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 710 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Graph (complete) has 4063 edges and 710 vertex of which 709 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 699 transition count 1822
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 699 transition count 1822
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 29 place count 699 transition count 1814
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 691 transition count 1796
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 691 transition count 1796
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 683 transition count 1772
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 683 transition count 1772
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 675 transition count 1746
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 675 transition count 1746
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 667 transition count 1726
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 667 transition count 1726
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 102 place count 658 transition count 1704
Iterating global reduction 1 with 9 rules applied. Total rules applied 111 place count 658 transition count 1704
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 120 place count 649 transition count 1682
Iterating global reduction 1 with 9 rules applied. Total rules applied 129 place count 649 transition count 1682
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 138 place count 640 transition count 1664
Iterating global reduction 1 with 9 rules applied. Total rules applied 147 place count 640 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 155 place count 632 transition count 1648
Iterating global reduction 1 with 8 rules applied. Total rules applied 163 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 168 place count 627 transition count 1636
Iterating global reduction 1 with 5 rules applied. Total rules applied 173 place count 627 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 176 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 179 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 182 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 185 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 186 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 187 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 188 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 189 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 190 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 191 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 192 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 193 place count 617 transition count 1614
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 195 place count 617 transition count 1612
Applied a total of 195 rules in 793 ms. Remains 617 /710 variables (removed 93) and now considering 1612/1844 (removed 232) transitions.
[2024-05-23 03:03:30] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2024-05-23 03:03:30] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 03:03:30] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-23 03:03:30] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-23 03:03:30] [INFO ] Invariant cache hit.
[2024-05-23 03:03:30] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 03:03:32] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
[2024-05-23 03:03:32] [INFO ] Redundant transitions in 36 ms returned []
Running 1610 sub problems to find dead transitions.
[2024-05-23 03:03:32] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-23 03:03:32] [INFO ] Invariant cache hit.
[2024-05-23 03:03:32] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 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/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1696 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 268/887 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 2497 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 268/268 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 68896ms
Starting structural reductions in SI_LTL mode, iteration 1 : 617/710 places, 1612/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72131 ms. Remains : 617/710 places, 1612/1844 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 474 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-02 finished in 72898 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 1 out of 710 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 709 transition count 1844
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 698 transition count 1818
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 698 transition count 1818
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 31 place count 698 transition count 1810
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 40 place count 689 transition count 1788
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 689 transition count 1788
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 680 transition count 1762
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 680 transition count 1762
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 670 transition count 1732
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 670 transition count 1732
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 97 place count 660 transition count 1708
Iterating global reduction 2 with 10 rules applied. Total rules applied 107 place count 660 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 117 place count 650 transition count 1684
Iterating global reduction 2 with 10 rules applied. Total rules applied 127 place count 650 transition count 1684
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 137 place count 640 transition count 1660
Iterating global reduction 2 with 10 rules applied. Total rules applied 147 place count 640 transition count 1660
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 631 transition count 1642
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 173 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 181 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 618 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 618 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 194 place count 615 transition count 1606
Iterating global reduction 2 with 3 rules applied. Total rules applied 197 place count 615 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 612 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 203 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 204 place count 611 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 206 place count 610 transition count 1596
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 609 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 608 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 608 transition count 1592
Applied a total of 211 rules in 204 ms. Remains 608 /710 variables (removed 102) and now considering 1592/1844 (removed 252) transitions.
[2024-05-23 03:04:42] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
// Phase 1: matrix 1064 rows 608 cols
[2024-05-23 03:04:42] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 03:04:42] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-23 03:04:42] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2024-05-23 03:04:42] [INFO ] Invariant cache hit.
[2024-05-23 03:04:43] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 03:04:44] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 2352 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-23 03:04:44] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2024-05-23 03:04:44] [INFO ] Invariant cache hit.
[2024-05-23 03:04:44] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1672 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1064/1672 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1672 variables, 264/874 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 2464 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 608/608 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 68332ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 68350ms
Starting structural reductions in LTL mode, iteration 1 : 608/710 places, 1592/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70912 ms. Remains : 608/710 places, 1592/1844 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 379 ms.
Stack based approach found an accepted trace after 1144 steps with 0 reset with depth 1145 and stack size 1145 in 5 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-04 finished in 71475 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((G(F(p0))||(p1&&F(p0)))))'
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 709 transition count 1844
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 699 transition count 1822
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 699 transition count 1822
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 31 place count 699 transition count 1812
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 39 place count 691 transition count 1794
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 691 transition count 1794
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 683 transition count 1774
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 683 transition count 1774
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 675 transition count 1750
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 675 transition count 1750
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 87 place count 667 transition count 1730
Iterating global reduction 2 with 8 rules applied. Total rules applied 95 place count 667 transition count 1730
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 103 place count 659 transition count 1710
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 659 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 119 place count 651 transition count 1690
Iterating global reduction 2 with 8 rules applied. Total rules applied 127 place count 651 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 134 place count 644 transition count 1676
Iterating global reduction 2 with 7 rules applied. Total rules applied 141 place count 644 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 637 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 637 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 632 transition count 1650
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 629 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 174 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 177 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 625 transition count 1634
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 180 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 622 transition count 1628
Applied a total of 185 rules in 264 ms. Remains 622 /710 variables (removed 88) and now considering 1628/1844 (removed 216) transitions.
[2024-05-23 03:05:53] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-23 03:05:53] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 03:05:54] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-23 03:05:54] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 03:05:54] [INFO ] Invariant cache hit.
[2024-05-23 03:05:54] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 03:05:56] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-23 03:05:56] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 03:05:56] [INFO ] Invariant cache hit.
[2024-05-23 03:05:56] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31315 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 68959ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 68978ms
Starting structural reductions in LTL mode, iteration 1 : 622/710 places, 1628/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71630 ms. Remains : 622/710 places, 1628/1844 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 384 ms.
Product exploration explored 100000 steps with 0 reset in 361 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31921 steps (7 resets) in 75 ms. (420 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 622 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 622 transition count 1622
Applied a total of 6 rules in 180 ms. Remains 622 /622 variables (removed 0) and now considering 1622/1628 (removed 6) transitions.
[2024-05-23 03:07:06] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 622 cols
[2024-05-23 03:07:06] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 03:07:07] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-23 03:07:07] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 03:07:07] [INFO ] Invariant cache hit.
[2024-05-23 03:07:07] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 03:07:09] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2024-05-23 03:07:09] [INFO ] Redundant transitions in 26 ms returned []
Running 1620 sub problems to find dead transitions.
[2024-05-23 03:07:09] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 03:07:09] [INFO ] Invariant cache hit.
[2024-05-23 03:07:09] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1706 variables, and 2 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 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/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1706 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1706 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1706/1706 variables, and 2512 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 31441 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
After SMT, in 69680ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 69694ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/622 places, 1622/1628 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72229 ms. Remains : 622/622 places, 1622/1628 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 84 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36780 steps (8 resets) in 207 ms. (176 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 123 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 329 ms.
Product exploration explored 100000 steps with 0 reset in 387 ms.
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1622/1622 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 621 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 620 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 620 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 619 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 619 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 618 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 618 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 617 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 617 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 616 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 616 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 615 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 615 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 614 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 614 transition count 1604
Applied a total of 16 rules in 210 ms. Remains 614 /622 variables (removed 8) and now considering 1604/1622 (removed 18) transitions.
[2024-05-23 03:08:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 03:08:20] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 03:08:21] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-23 03:08:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 03:08:21] [INFO ] Invariant cache hit.
[2024-05-23 03:08:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 03:08:22] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
[2024-05-23 03:08:22] [INFO ] Redundant transitions in 25 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 03:08:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 03:08:22] [INFO ] Invariant cache hit.
[2024-05-23 03:08:22] [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 30029 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 31579 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 69627ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69640ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/622 places, 1604/1622 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72156 ms. Remains : 614/622 places, 1604/1622 transitions.
Treatment of property FunctionPointer-PT-c002-LTLCardinality-05 finished in 219130 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||X(F(p1)))))'
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Graph (complete) has 4063 edges and 710 vertex of which 709 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 698 transition count 1818
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 698 transition count 1818
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 29 place count 698 transition count 1812
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 689 transition count 1790
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 689 transition count 1790
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 681 transition count 1766
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 681 transition count 1766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 674 transition count 1746
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 674 transition count 1746
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 84 place count 667 transition count 1732
Iterating global reduction 1 with 7 rules applied. Total rules applied 91 place count 667 transition count 1732
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 99 place count 659 transition count 1710
Iterating global reduction 1 with 8 rules applied. Total rules applied 107 place count 659 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 115 place count 651 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 123 place count 651 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 131 place count 643 transition count 1672
Iterating global reduction 1 with 8 rules applied. Total rules applied 139 place count 643 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 636 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 636 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 157 place count 632 transition count 1648
Iterating global reduction 1 with 4 rules applied. Total rules applied 161 place count 632 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 165 place count 628 transition count 1638
Iterating global reduction 1 with 4 rules applied. Total rules applied 169 place count 628 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 173 place count 624 transition count 1630
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 624 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 178 place count 623 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 179 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 622 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 182 place count 621 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 621 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 184 place count 620 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 185 place count 620 transition count 1622
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 189 place count 620 transition count 1618
Applied a total of 189 rules in 455 ms. Remains 620 /710 variables (removed 90) and now considering 1618/1844 (removed 226) transitions.
[2024-05-23 03:09:33] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
// Phase 1: matrix 1082 rows 620 cols
[2024-05-23 03:09:33] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 03:09:33] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-23 03:09:33] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:09:33] [INFO ] Invariant cache hit.
[2024-05-23 03:09:33] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 03:09:35] [INFO ] Implicit Places using invariants and state equation in 1972 ms returned []
Implicit Place search using SMT with State Equation took 2438 ms to find 0 implicit places.
[2024-05-23 03:09:35] [INFO ] Redundant transitions in 30 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-05-23 03:09:35] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:09:35] [INFO ] Invariant cache hit.
[2024-05-23 03:09:35] [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, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1702 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30036 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: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1082/1702 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1702 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1702/1702 variables, and 2506 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31434 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: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 70058ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 70073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/710 places, 1618/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73013 ms. Remains : 620/710 places, 1618/1844 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-06
Product exploration explored 100000 steps with 33344 reset in 530 ms.
Product exploration explored 100000 steps with 33270 reset in 465 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 (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 34816 steps (7 resets) in 194 ms. (178 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Applied a total of 0 rules in 83 ms. Remains 620 /620 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2024-05-23 03:10:47] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:10:47] [INFO ] Invariant cache hit.
[2024-05-23 03:10:48] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-23 03:10:48] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:10:48] [INFO ] Invariant cache hit.
[2024-05-23 03:10:48] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 03:10:49] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned []
Implicit Place search using SMT with State Equation took 2410 ms to find 0 implicit places.
[2024-05-23 03:10:49] [INFO ] Redundant transitions in 30 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-05-23 03:10:50] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:10:50] [INFO ] Invariant cache hit.
[2024-05-23 03:10:50] [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, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1702 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30034 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: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1082/1702 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1702 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1702/1702 variables, and 2506 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31330 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: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 69119ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71677 ms. Remains : 620/620 places, 1618/1618 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40002 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2024-05-23 03:11:59] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:11:59] [INFO ] Invariant cache hit.
[2024-05-23 03:11:59] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/33 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 543/576 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 928/1504 variables, 466/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1504 variables, 263/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1504 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1566 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1566 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 131/1697 variables, 130/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1697 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1701 variables, 2/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1701 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1702 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1702 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1702 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1702/1702 variables, and 890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 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: 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) 9/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/33 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 543/576 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 928/1504 variables, 466/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1504 variables, 263/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1504 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1566 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1566 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 131/1697 variables, 130/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1697 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1701 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1701 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1702 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1702 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1702 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1702/1702 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 521 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1000ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Graph (complete) has 2703 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1234
Applied a total of 385 rules in 51 ms. Remains 428 /620 variables (removed 192) and now considering 1234/1618 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 428/620 places, 1234/1618 transitions.
RANDOM walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33933 steps (7 resets) in 30 ms. (1094 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33427 reset in 422 ms.
Product exploration explored 100000 steps with 33427 reset in 456 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1618/1618 transitions.
Applied a total of 0 rules in 88 ms. Remains 620 /620 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2024-05-23 03:12:01] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:12:01] [INFO ] Invariant cache hit.
[2024-05-23 03:12:02] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-23 03:12:02] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:12:02] [INFO ] Invariant cache hit.
[2024-05-23 03:12:02] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 03:12:04] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
[2024-05-23 03:12:04] [INFO ] Redundant transitions in 26 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-05-23 03:12:04] [INFO ] Flow matrix only has 1082 transitions (discarded 536 similar events)
[2024-05-23 03:12:04] [INFO ] Invariant cache hit.
[2024-05-23 03:12:04] [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, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1702 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30037 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: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1082/1702 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1702 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1702/1702 variables, and 2506 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31351 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: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 69192ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69216ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71771 ms. Remains : 620/620 places, 1618/1618 transitions.
Treatment of property FunctionPointer-PT-c002-LTLCardinality-06 finished in 220961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(p1 U p2))))'
Support contains 3 out of 710 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 703 transition count 1828
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 703 transition count 1828
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 703 transition count 1824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 697 transition count 1810
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 697 transition count 1810
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 691 transition count 1792
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 691 transition count 1792
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 685 transition count 1772
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 685 transition count 1772
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 679 transition count 1756
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 679 transition count 1756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 674 transition count 1746
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 674 transition count 1746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 669 transition count 1736
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 669 transition count 1736
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 664 transition count 1726
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 664 transition count 1726
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 661 transition count 1720
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 661 transition count 1720
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 659 transition count 1716
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 659 transition count 1716
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 659 transition count 1706
Applied a total of 116 rules in 388 ms. Remains 659 /710 variables (removed 51) and now considering 1706/1844 (removed 138) transitions.
[2024-05-23 03:13:14] [INFO ] Flow matrix only has 1143 transitions (discarded 563 similar events)
// Phase 1: matrix 1143 rows 659 cols
[2024-05-23 03:13:14] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 03:13:14] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-23 03:13:14] [INFO ] Flow matrix only has 1143 transitions (discarded 563 similar events)
[2024-05-23 03:13:14] [INFO ] Invariant cache hit.
[2024-05-23 03:13:14] [INFO ] State equation strengthened by 281 read => feed constraints.
[2024-05-23 03:13:16] [INFO ] Implicit Places using invariants and state equation in 1993 ms returned []
Implicit Place search using SMT with State Equation took 2496 ms to find 0 implicit places.
[2024-05-23 03:13:16] [INFO ] Redundant transitions in 27 ms returned []
Running 1704 sub problems to find dead transitions.
[2024-05-23 03:13:16] [INFO ] Flow matrix only has 1143 transitions (discarded 563 similar events)
[2024-05-23 03:13:16] [INFO ] Invariant cache hit.
[2024-05-23 03:13:16] [INFO ] State equation strengthened by 281 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/1802 variables, and 2 constraints, problems are : Problem set: 0 solved, 1704 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/659 constraints, ReadFeed: 0/281 constraints, PredecessorRefiner: 1704/1704 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1704 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
At refinement iteration 3 (OVERLAPS) 1143/1801 variables, 658/660 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1801 variables, 281/941 constraints. Problems are: Problem set: 0 solved, 1704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1801/1802 variables, and 1197 constraints, problems are : Problem set: 0 solved, 1704 unsolved in 30228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 658/659 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 256/1704 constraints, Known Traps: 0/0 constraints]
After SMT, in 68731ms problems are : Problem set: 0 solved, 1704 unsolved
Search for dead transitions found 0 dead transitions in 68747ms
Starting structural reductions in SI_LTL mode, iteration 1 : 659/710 places, 1706/1844 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71672 ms. Remains : 659/710 places, 1706/1844 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 388 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 0 ms.
FORMULA FunctionPointer-PT-c002-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLCardinality-07 finished in 72231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 709 transition count 1844
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 697 transition count 1816
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 697 transition count 1816
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 33 place count 697 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 43 place count 687 transition count 1784
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 687 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 677 transition count 1756
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 667 transition count 1726
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 667 transition count 1726
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 103 place count 657 transition count 1702
Iterating global reduction 2 with 10 rules applied. Total rules applied 113 place count 657 transition count 1702
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 123 place count 647 transition count 1678
Iterating global reduction 2 with 10 rules applied. Total rules applied 133 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 143 place count 637 transition count 1654
Iterating global reduction 2 with 10 rules applied. Total rules applied 153 place count 637 transition count 1654
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 162 place count 628 transition count 1636
Iterating global reduction 2 with 9 rules applied. Total rules applied 171 place count 628 transition count 1636
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 179 place count 620 transition count 1620
Iterating global reduction 2 with 8 rules applied. Total rules applied 187 place count 620 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 615 transition count 1608
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 612 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 203 place count 612 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 608 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 212 place count 607 transition count 1590
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 605 transition count 1586
Applied a total of 217 rules in 285 ms. Remains 605 /710 variables (removed 105) and now considering 1586/1844 (removed 258) transitions.
[2024-05-23 03:14:26] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-23 03:14:26] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 03:14:26] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-23 03:14:26] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 03:14:26] [INFO ] Invariant cache hit.
[2024-05-23 03:14:26] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 03:14:28] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2300 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 03:14:28] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 03:14:28] [INFO ] Invariant cache hit.
[2024-05-23 03:14:28] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 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 31110 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 69442ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 69458ms
Starting structural reductions in LTL mode, iteration 1 : 605/710 places, 1586/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72049 ms. Remains : 605/710 places, 1586/1844 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 490 ms.
Product exploration explored 100000 steps with 50000 reset in 495 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c002-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLCardinality-13 finished in 73187 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))) U G(p1))))'
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 710/710 places, 1844/1844 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 709 transition count 1844
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 697 transition count 1816
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 697 transition count 1816
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 33 place count 697 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 43 place count 687 transition count 1784
Iterating global reduction 2 with 10 rules applied. Total rules applied 53 place count 687 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 677 transition count 1756
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 667 transition count 1726
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 667 transition count 1726
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 103 place count 657 transition count 1702
Iterating global reduction 2 with 10 rules applied. Total rules applied 113 place count 657 transition count 1702
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 123 place count 647 transition count 1678
Iterating global reduction 2 with 10 rules applied. Total rules applied 133 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 143 place count 637 transition count 1654
Iterating global reduction 2 with 10 rules applied. Total rules applied 153 place count 637 transition count 1654
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 162 place count 628 transition count 1636
Iterating global reduction 2 with 9 rules applied. Total rules applied 171 place count 628 transition count 1636
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 179 place count 620 transition count 1620
Iterating global reduction 2 with 8 rules applied. Total rules applied 187 place count 620 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 615 transition count 1608
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 612 transition count 1600
Iterating global reduction 2 with 3 rules applied. Total rules applied 203 place count 612 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 2 with 3 rules applied. Total rules applied 209 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 608 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 212 place count 607 transition count 1590
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 605 transition count 1586
Applied a total of 217 rules in 245 ms. Remains 605 /710 variables (removed 105) and now considering 1586/1844 (removed 258) transitions.
[2024-05-23 03:15:39] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 03:15:39] [INFO ] Invariant cache hit.
[2024-05-23 03:15:39] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-23 03:15:39] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 03:15:39] [INFO ] Invariant cache hit.
[2024-05-23 03:15:40] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 03:15:41] [INFO ] Implicit Places using invariants and state equation in 1884 ms returned []
Implicit Place search using SMT with State Equation took 2330 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 03:15:41] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 03:15:41] [INFO ] Invariant cache hit.
[2024-05-23 03:15:41] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 3.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 timeout
0.0)
(s513 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30031 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 31082 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 69119ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 69138ms
Starting structural reductions in LTL mode, iteration 1 : 605/710 places, 1586/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71719 ms. Remains : 605/710 places, 1586/1844 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLCardinality-14
Product exploration explored 100000 steps with 16678 reset in 328 ms.
Product exploration explored 100000 steps with 16614 reset in 336 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
RANDOM walk for 40001 steps (8 resets) in 359 ms. (111 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
[2024-05-23 03:16:52] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 03:16:52] [INFO ] Invariant cache hit.
[2024-05-23 03:16:52] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 382/384 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 0/583 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 344/1577 variables, 141/724 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1577 variables, 1/725 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1577 variables, 68/793 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1577 variables, 0/793 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 74/1651 variables, 69/862 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1651 variables, 0/862 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1659 variables, 4/866 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1659 variables, 0/866 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/1663 variables, 3/869 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1663 variables, 0/869 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1663 variables, 0/869 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1663/1663 variables, and 869 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1400 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: 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) 382/384 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 2/585 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 344/1577 variables, 141/726 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1577 variables, 1/727 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1577 variables, 68/795 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1577 variables, 0/795 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 74/1651 variables, 69/864 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1651 variables, 0/864 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1659 variables, 4/868 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1659 variables, 0/868 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/1663 variables, 3/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1663 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1663 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 871 constraints, problems are : Problem set: 1 solved, 2 unsolved in 862 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: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2295ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1583 steps, including 111 resets, run visited all 2 properties in 23 ms. (steps per millisecond=68 )
Parikh walk visited 2 properties in 28 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c002-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c002-LTLCardinality-14 finished in 75943 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((G(F(p0))||(p1&&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((p0||X(F(p1)))))'
[2024-05-23 03:16:55] [INFO ] Flatten gal took : 128 ms
[2024-05-23 03:16:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 03:16:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 710 places, 1844 transitions and 7502 arcs took 24 ms.
Total runtime 925247 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c002

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 710
TRANSITIONS: 1844
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.038s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 1229
MODEL NAME: /home/mcc/execution/412/model
710 places, 1844 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.
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-c002"
export BK_EXAMINATION="LTLCardinality"
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-c002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601200275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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