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.r553-tall-171734901000139.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 ltsminxred
Input is CO4-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901000139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 239K Jun 2 16:33 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 CO4-PT-18-LTLCardinality-00
FORMULA_NAME CO4-PT-18-LTLCardinality-01
FORMULA_NAME CO4-PT-18-LTLCardinality-02
FORMULA_NAME CO4-PT-18-LTLCardinality-03
FORMULA_NAME CO4-PT-18-LTLCardinality-04
FORMULA_NAME CO4-PT-18-LTLCardinality-05
FORMULA_NAME CO4-PT-18-LTLCardinality-06
FORMULA_NAME CO4-PT-18-LTLCardinality-07
FORMULA_NAME CO4-PT-18-LTLCardinality-08
FORMULA_NAME CO4-PT-18-LTLCardinality-09
FORMULA_NAME CO4-PT-18-LTLCardinality-10
FORMULA_NAME CO4-PT-18-LTLCardinality-11
FORMULA_NAME CO4-PT-18-LTLCardinality-12
FORMULA_NAME CO4-PT-18-LTLCardinality-13
FORMULA_NAME CO4-PT-18-LTLCardinality-14
FORMULA_NAME CO4-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717352262172

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:17:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:17:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:17:43] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-02 18:17:43] [INFO ] Transformed 979 places.
[2024-06-02 18:17:43] [INFO ] Transformed 1111 transitions.
[2024-06-02 18:17:43] [INFO ] Found NUPN structural information;
[2024-06-02 18:17:43] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 128 places :
Symmetric choice reduction at 1 with 128 rule applications. Total rules 145 place count 680 transition count 801
Iterating global reduction 1 with 128 rules applied. Total rules applied 273 place count 680 transition count 801
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 376 place count 577 transition count 698
Iterating global reduction 1 with 103 rules applied. Total rules applied 479 place count 577 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 482 place count 577 transition count 695
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 528 place count 531 transition count 649
Iterating global reduction 2 with 46 rules applied. Total rules applied 574 place count 531 transition count 649
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 608 place count 497 transition count 615
Iterating global reduction 2 with 34 rules applied. Total rules applied 642 place count 497 transition count 615
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 644 place count 497 transition count 613
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 660 place count 481 transition count 597
Iterating global reduction 3 with 16 rules applied. Total rules applied 676 place count 481 transition count 597
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 481 transition count 595
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 682 place count 477 transition count 591
Iterating global reduction 4 with 4 rules applied. Total rules applied 686 place count 477 transition count 591
Applied a total of 686 rules in 281 ms. Remains 477 /822 variables (removed 345) and now considering 591/934 (removed 343) transitions.
// Phase 1: matrix 591 rows 477 cols
[2024-06-02 18:17:44] [INFO ] Computed 5 invariants in 26 ms
[2024-06-02 18:17:44] [INFO ] Implicit Places using invariants in 364 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/822 places, 591/934 transitions.
Applied a total of 0 rules in 7 ms. Remains 476 /476 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 700 ms. Remains : 476/822 places, 591/934 transitions.
Support contains 39 out of 476 places after structural reductions.
[2024-06-02 18:17:44] [INFO ] Flatten gal took : 64 ms
[2024-06-02 18:17:44] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:17:44] [INFO ] Input system was already deterministic with 591 transitions.
RANDOM walk for 40000 steps (48 resets) in 1376 ms. (29 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4002 steps (20 resets) in 72 ms. (54 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (11 resets) in 107 ms. (37 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (17 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (22 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (17 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (19 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (16 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (25 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (21 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (18 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (22 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (19 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (21 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
// Phase 1: matrix 591 rows 476 cols
[2024-06-02 18:17:45] [INFO ] Computed 4 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 10/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 107/170 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 242/412 variables, 73/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 371/783 variables, 166/306 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 213/996 variables, 129/435 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/996 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 51/1047 variables, 33/468 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1047 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 16/1063 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1063 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 4/1067 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1067 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 0/1067 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1067/1067 variables, and 480 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 10/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 107/170 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 242/412 variables, 73/141 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 18/159 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 371/783 variables, 166/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/783 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 213/996 variables, 129/454 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/996 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 51/1047 variables, 33/487 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1047 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 16/1063 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1063 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 19 (OVERLAPS) 4/1067 variables, 4/499 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1067 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 0/1067 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1067/1067 variables, and 499 constraints, problems are : Problem set: 1 solved, 18 unsolved in 3070 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 5122ms problems are : Problem set: 1 solved, 18 unsolved
Parikh walk visited 15 properties in 5985 ms.
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 500 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 737 edges and 474 vertex of which 459 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 459 transition count 342
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 457 place count 241 transition count 340
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 459 place count 240 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 460 place count 239 transition count 339
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 460 place count 239 transition count 294
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 550 place count 194 transition count 294
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 554 place count 190 transition count 290
Iterating global reduction 4 with 4 rules applied. Total rules applied 558 place count 190 transition count 290
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 558 place count 190 transition count 288
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 562 place count 188 transition count 288
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 565 place count 185 transition count 285
Iterating global reduction 4 with 3 rules applied. Total rules applied 568 place count 185 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 569 place count 185 transition count 284
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 570 place count 184 transition count 283
Iterating global reduction 5 with 1 rules applied. Total rules applied 571 place count 184 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 572 place count 184 transition count 282
Performed 69 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 710 place count 115 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 717 place count 115 transition count 191
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 723 place count 109 transition count 185
Iterating global reduction 7 with 6 rules applied. Total rules applied 729 place count 109 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 730 place count 109 transition count 184
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 8 with 2 rules applied. Total rules applied 732 place count 108 transition count 183
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 790 place count 79 transition count 185
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 808 place count 79 transition count 167
Discarding 25 places :
Symmetric choice reduction at 9 with 25 rule applications. Total rules 833 place count 54 transition count 117
Iterating global reduction 9 with 25 rules applied. Total rules applied 858 place count 54 transition count 117
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 874 place count 54 transition count 101
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 880 place count 48 transition count 84
Iterating global reduction 10 with 6 rules applied. Total rules applied 886 place count 48 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 890 place count 48 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 894 place count 46 transition count 108
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 901 place count 46 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 12 with 18 rules applied. Total rules applied 919 place count 46 transition count 83
Free-agglomeration rule applied 6 times.
Iterating global reduction 12 with 6 rules applied. Total rules applied 925 place count 46 transition count 77
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 933 place count 40 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 934 place count 40 transition count 75
Graph (complete) has 119 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 935 place count 39 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 936 place count 39 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 937 place count 39 transition count 74
Graph (complete) has 116 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 938 place count 38 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 939 place count 38 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 940 place count 38 transition count 73
Graph (complete) has 113 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 941 place count 37 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 942 place count 37 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 943 place count 36 transition count 71
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 22 edges and 32 vertex of which 3 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 19 with 3 rules applied. Total rules applied 946 place count 30 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 951 place count 30 transition count 64
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 952 place count 29 transition count 62
Iterating global reduction 21 with 1 rules applied. Total rules applied 953 place count 29 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 954 place count 29 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 22 with 17 rules applied. Total rules applied 971 place count 29 transition count 44
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 973 place count 28 transition count 43
Discarding 3 places :
Symmetric choice reduction at 23 with 3 rule applications. Total rules 976 place count 25 transition count 40
Iterating global reduction 23 with 3 rules applied. Total rules applied 979 place count 25 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 982 place count 25 transition count 37
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 984 place count 23 transition count 35
Iterating global reduction 24 with 2 rules applied. Total rules applied 986 place count 23 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 987 place count 23 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 989 place count 22 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 991 place count 22 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 992 place count 22 transition count 36
Free-agglomeration rule applied 2 times.
Iterating global reduction 26 with 2 rules applied. Total rules applied 994 place count 22 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 996 place count 20 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 997 place count 20 transition count 34
Applied a total of 997 rules in 129 ms. Remains 20 /476 variables (removed 456) and now considering 34/591 (removed 557) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 20/476 places, 34/591 transitions.
RANDOM walk for 302 steps (18 resets) in 6 ms. (43 steps per ms) remains 0/3 properties
FORMULA CO4-PT-18-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 740 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 454 transition count 569
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 454 transition count 569
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 444 transition count 559
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 444 transition count 559
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 444 transition count 557
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 440 transition count 553
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 440 transition count 553
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 437 transition count 550
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 35 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 18:17:57] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:17:57] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-02 18:17:57] [INFO ] Invariant cache hit.
[2024-06-02 18:17:57] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:17:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:18:14] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 21 ms to minimize.
[2024-06-02 18:18:15] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 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 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60642 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-04
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 3 ms.
FORMULA CO4-PT-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-04 finished in 60915 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(p0)))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 457 transition count 572
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 457 transition count 572
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 449 transition count 564
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 449 transition count 564
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 449 transition count 562
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 446 transition count 559
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 444 transition count 557
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 444 transition count 557
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 443 transition count 556
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 443 transition count 556
Applied a total of 68 rules in 30 ms. Remains 443 /476 variables (removed 33) and now considering 556/591 (removed 35) transitions.
// Phase 1: matrix 556 rows 443 cols
[2024-06-02 18:18:58] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 18:18:58] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 18:18:58] [INFO ] Invariant cache hit.
[2024-06-02 18:18:58] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2024-06-02 18:18:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/999 variables, 443/447 constraints. Problems are: Problem set: 0 solved, 555 unsolved
[2024-06-02 18:19:15] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 9 ms to minimize.
[2024-06-02 18:19:16] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/999 variables, and 449 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 556/999 variables, 443/449 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 555/1004 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/999 variables, and 1004 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 443/476 places, 556/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 443/476 places, 556/591 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-06
Product exploration explored 100000 steps with 54 reset in 166 ms.
Product exploration explored 100000 steps with 6 reset in 122 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 700 edges and 443 vertex of which 438 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (100 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (32 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1441134 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 1
Probabilistic random walk after 1441134 steps, saw 275800 distinct states, run finished after 3003 ms. (steps per millisecond=479 ) properties seen :0
[2024-06-02 18:20:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/82 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 229/311 variables, 82/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 357/668 variables, 161/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/684 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 229/913 variables, 128/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/913 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/981 variables, 41/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/981 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/997 variables, 10/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/997 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/999 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/999 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 999/999 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/82 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 229/311 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 357/668 variables, 161/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/684 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 229/913 variables, 128/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/913 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/981 variables, 41/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/981 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/997 variables, 10/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/997 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/999 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/999 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 999/999 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-06 finished in 64800 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((G(p2)||p1))))'
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 460 transition count 575
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 460 transition count 575
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 453 transition count 568
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 453 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 453 transition count 567
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 449 transition count 563
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 449 transition count 563
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 446 transition count 560
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 446 transition count 560
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 445 transition count 559
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 445 transition count 559
Applied a total of 63 rules in 45 ms. Remains 445 /476 variables (removed 31) and now considering 559/591 (removed 32) transitions.
// Phase 1: matrix 559 rows 445 cols
[2024-06-02 18:20:02] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:20:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:20:02] [INFO ] Invariant cache hit.
[2024-06-02 18:20:03] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 558 sub problems to find dead transitions.
[2024-06-02 18:20:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (OVERLAPS) 559/1004 variables, 445/449 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-06-02 18:20:21] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:20:21] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1004 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1004/1004 variables, and 451 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (OVERLAPS) 1/445 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 559/1004 variables, 445/451 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1004 variables, 558/1009 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1004 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1004 variables, and 1009 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 445/445 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 445/476 places, 559/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60479 ms. Remains : 445/476 places, 559/591 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 706 edges and 445 vertex of which 439 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 16 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-07 finished in 61104 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||X(p1)))))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 446 transition count 561
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 29 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 18:21:03] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:21:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:21:04] [INFO ] Invariant cache hit.
[2024-06-02 18:21:04] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:21:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:21:21] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:21:21] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60513 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-09
Product exploration explored 100000 steps with 74 reset in 109 ms.
Product exploration explored 100000 steps with 15 reset in 140 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 111 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (103 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (68 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (54 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (122 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (74 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (91 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (102 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 566478 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :3 out of 6
Probabilistic random walk after 566478 steps, saw 111324 distinct states, run finished after 3003 ms. (steps per millisecond=188 ) properties seen :3
[2024-06-02 18:22:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 56/62 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 201/263 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 340/603 variables, 150/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/621 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 240/861 variables, 129/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 94/955 variables, 54/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/955 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 16 (OVERLAPS) 23/978 variables, 15/435 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/978 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/984 variables, 4/439 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/984 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/985 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 1 solved, 2 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/62 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 201/263 variables, 72/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 340/603 variables, 150/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/621 variables, 4/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 3/239 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/861 variables, 129/368 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/861 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 94/955 variables, 54/422 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/955 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 23/978 variables, 15/437 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/984 variables, 4/441 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/985 variables, 1/442 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/985 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 442 constraints, problems are : Problem set: 1 solved, 2 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 974ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 549/549 transitions.
Graph (trivial) has 470 edges and 436 vertex of which 3 / 436 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 690 edges and 434 vertex of which 419 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 419 transition count 323
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 196 rules applied. Total rules applied 410 place count 225 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 224 transition count 321
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 411 place count 224 transition count 274
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 505 place count 177 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 506 place count 176 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 507 place count 176 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 176 transition count 272
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 640 place count 110 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 645 place count 110 transition count 185
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 651 place count 104 transition count 179
Iterating global reduction 5 with 6 rules applied. Total rules applied 657 place count 104 transition count 179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 663 place count 101 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 667 place count 101 transition count 172
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 671 place count 97 transition count 168
Iterating global reduction 6 with 4 rules applied. Total rules applied 675 place count 97 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 676 place count 97 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 682 place count 94 transition count 164
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 685 place count 94 transition count 161
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 688 place count 91 transition count 158
Iterating global reduction 8 with 3 rules applied. Total rules applied 691 place count 91 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 693 place count 91 transition count 156
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 56 rules applied. Total rules applied 749 place count 63 transition count 158
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 9 with 36 rules applied. Total rules applied 785 place count 63 transition count 122
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 810 place count 38 transition count 86
Iterating global reduction 10 with 25 rules applied. Total rules applied 835 place count 38 transition count 86
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 855 place count 38 transition count 66
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 859 place count 34 transition count 55
Iterating global reduction 11 with 4 rules applied. Total rules applied 863 place count 34 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 866 place count 34 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 868 place count 33 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 871 place count 33 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 884 place count 33 transition count 51
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 885 place count 32 transition count 50
Iterating global reduction 13 with 1 rules applied. Total rules applied 886 place count 32 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 887 place count 32 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 892 place count 32 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 899 place count 27 transition count 42
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 901 place count 27 transition count 42
Graph (complete) has 77 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 902 place count 26 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 903 place count 26 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 904 place count 26 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 905 place count 26 transition count 40
Graph (complete) has 73 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 906 place count 25 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 907 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 908 place count 25 transition count 39
Graph (complete) has 70 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 909 place count 24 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 910 place count 24 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 911 place count 23 transition count 37
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 914 place count 17 transition count 35
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t65.t508.t44.t45.t46.t47.t48.t49.t50.t51.t63.t30.t561.t168.t169.t170.t574.t13.t173 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 22 with 9 rules applied. Total rules applied 923 place count 13 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 928 place count 12 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 930 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 931 place count 11 transition count 19
Iterating global reduction 24 with 1 rules applied. Total rules applied 932 place count 11 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 933 place count 11 transition count 18
Free-agglomeration rule applied 3 times.
Iterating global reduction 25 with 3 rules applied. Total rules applied 936 place count 11 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 939 place count 8 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 941 place count 8 transition count 13
Applied a total of 941 rules in 48 ms. Remains 8 /436 variables (removed 428) and now considering 13/549 (removed 536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 8/436 places, 13/549 transitions.
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 327 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 12 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 18:22:10] [INFO ] Invariant cache hit.
[2024-06-02 18:22:10] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:22:10] [INFO ] Invariant cache hit.
[2024-06-02 18:22:10] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:22:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:22:27] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:22:27] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in LTL mode , in 1 iterations and 60473 ms. Remains : 436/436 places, 549/549 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (100 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (80 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (108 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (63 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (95 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 864907 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :2 out of 4
Probabilistic random walk after 864907 steps, saw 171152 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :2
[2024-06-02 18:23:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/62 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 201/263 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 340/603 variables, 150/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/621 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 240/861 variables, 129/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 94/955 variables, 54/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/955 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 23/978 variables, 15/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/978 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/984 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/984 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/985 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/62 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 201/263 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 340/603 variables, 150/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/621 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/861 variables, 129/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/861 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 94/955 variables, 54/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/955 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 23/978 variables, 15/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/984 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/985 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 875ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 549/549 transitions.
Graph (trivial) has 470 edges and 436 vertex of which 3 / 436 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 690 edges and 434 vertex of which 419 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 419 transition count 323
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 196 rules applied. Total rules applied 410 place count 225 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 224 transition count 321
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 411 place count 224 transition count 274
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 505 place count 177 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 506 place count 176 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 507 place count 176 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 176 transition count 272
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 640 place count 110 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 645 place count 110 transition count 185
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 651 place count 104 transition count 179
Iterating global reduction 5 with 6 rules applied. Total rules applied 657 place count 104 transition count 179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 663 place count 101 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 667 place count 101 transition count 172
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 671 place count 97 transition count 168
Iterating global reduction 6 with 4 rules applied. Total rules applied 675 place count 97 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 676 place count 97 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 682 place count 94 transition count 164
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 685 place count 94 transition count 161
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 688 place count 91 transition count 158
Iterating global reduction 8 with 3 rules applied. Total rules applied 691 place count 91 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 693 place count 91 transition count 156
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 56 rules applied. Total rules applied 749 place count 63 transition count 158
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 9 with 36 rules applied. Total rules applied 785 place count 63 transition count 122
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 810 place count 38 transition count 86
Iterating global reduction 10 with 25 rules applied. Total rules applied 835 place count 38 transition count 86
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 855 place count 38 transition count 66
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 859 place count 34 transition count 55
Iterating global reduction 11 with 4 rules applied. Total rules applied 863 place count 34 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 866 place count 34 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 868 place count 33 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 871 place count 33 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 884 place count 33 transition count 51
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 885 place count 32 transition count 50
Iterating global reduction 13 with 1 rules applied. Total rules applied 886 place count 32 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 887 place count 32 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 892 place count 32 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 899 place count 27 transition count 42
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 901 place count 27 transition count 42
Graph (complete) has 77 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 902 place count 26 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 903 place count 26 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 904 place count 26 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 905 place count 26 transition count 40
Graph (complete) has 73 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 906 place count 25 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 907 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 908 place count 25 transition count 39
Graph (complete) has 70 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 909 place count 24 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 910 place count 24 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 911 place count 23 transition count 37
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t522.t561 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 914 place count 17 transition count 35
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t65.t508.t44.t45.t46.t47.t48.t49.t50.t51.t63.t30.t561.t168.t169.t170.t574.t13.t173 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 22 with 9 rules applied. Total rules applied 923 place count 13 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 928 place count 12 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 930 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 931 place count 11 transition count 19
Iterating global reduction 24 with 1 rules applied. Total rules applied 932 place count 11 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 933 place count 11 transition count 18
Free-agglomeration rule applied 3 times.
Iterating global reduction 25 with 3 rules applied. Total rules applied 936 place count 11 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 939 place count 8 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 941 place count 8 transition count 13
Applied a total of 941 rules in 40 ms. Remains 8 /436 variables (removed 428) and now considering 13/549 (removed 536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 8/436 places, 13/549 transitions.
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 172 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 8 reset in 79 ms.
Product exploration explored 100000 steps with 19 reset in 97 ms.
Support contains 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 9 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 18:23:15] [INFO ] Invariant cache hit.
[2024-06-02 18:23:15] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:23:15] [INFO ] Invariant cache hit.
[2024-06-02 18:23:16] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:23:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 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 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in LTL mode , in 1 iterations and 60467 ms. Remains : 436/436 places, 549/549 transitions.
Treatment of property CO4-PT-18-LTLCardinality-09 finished in 192395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 508 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 738 edges and 474 vertex of which 468 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 467 transition count 366
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 252 transition count 364
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 251 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 250 transition count 363
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 437 place count 250 transition count 317
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 529 place count 204 transition count 317
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 534 place count 199 transition count 312
Iterating global reduction 4 with 5 rules applied. Total rules applied 539 place count 199 transition count 312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 539 place count 199 transition count 310
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 543 place count 197 transition count 310
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 546 place count 194 transition count 307
Iterating global reduction 4 with 3 rules applied. Total rules applied 549 place count 194 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 550 place count 194 transition count 306
Performed 73 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 696 place count 121 transition count 213
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 703 place count 121 transition count 206
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 709 place count 115 transition count 200
Iterating global reduction 6 with 6 rules applied. Total rules applied 715 place count 115 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 716 place count 115 transition count 199
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 7 with 2 rules applied. Total rules applied 718 place count 114 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 784 place count 81 transition count 200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 804 place count 81 transition count 180
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 831 place count 54 transition count 126
Iterating global reduction 8 with 27 rules applied. Total rules applied 858 place count 54 transition count 126
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 875 place count 54 transition count 109
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 882 place count 47 transition count 89
Iterating global reduction 9 with 7 rules applied. Total rules applied 889 place count 47 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 894 place count 47 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 898 place count 45 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 919 place count 45 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 921 place count 43 transition count 87
Applied a total of 921 rules in 83 ms. Remains 43 /476 variables (removed 433) and now considering 87/591 (removed 504) transitions.
[2024-06-02 18:24:16] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
// Phase 1: matrix 77 rows 43 cols
[2024-06-02 18:24:16] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:24:16] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 18:24:16] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 18:24:16] [INFO ] Invariant cache hit.
[2024-06-02 18:24:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:24:16] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-02 18:24:16] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-02 18:24:16] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 18:24:16] [INFO ] Invariant cache hit.
[2024-06-02 18:24:16] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 50 constraints, problems are : Problem set: 0 solved, 74 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 74/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 124 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2089ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/476 places, 87/591 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2357 ms. Remains : 43/476 places, 87/591 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-10
Product exploration explored 100000 steps with 10 reset in 137 ms.
Product exploration explored 100000 steps with 9 reset in 165 ms.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 9241 steps (978 resets) in 72 ms. (126 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 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-02 18:24:19] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 18:24:19] [INFO ] Invariant cache hit.
[2024-06-02 18:24:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 18:24:19] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 18:24:19] [INFO ] Invariant cache hit.
[2024-06-02 18:24:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:24:19] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-02 18:24:19] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-02 18:24:19] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 18:24:19] [INFO ] Invariant cache hit.
[2024-06-02 18:24:19] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 50 constraints, problems are : Problem set: 0 solved, 74 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 74/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 124 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2113ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2211 ms. Remains : 43/43 places, 87/87 transitions.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 22147 steps (2352 resets) in 45 ms. (481 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 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 16 reset in 38 ms.
Product exploration explored 100000 steps with 1 reset in 77 ms.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-06-02 18:24:22] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 18:24:22] [INFO ] Invariant cache hit.
[2024-06-02 18:24:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:24:22] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 18:24:22] [INFO ] Invariant cache hit.
[2024-06-02 18:24:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:24:22] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-02 18:24:22] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-02 18:24:22] [INFO ] Flow matrix only has 77 transitions (discarded 10 similar events)
[2024-06-02 18:24:22] [INFO ] Invariant cache hit.
[2024-06-02 18:24:22] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 50 constraints, problems are : Problem set: 0 solved, 74 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 76/119 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 74/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 124 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2130ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2219 ms. Remains : 43/43 places, 87/87 transitions.
Treatment of property CO4-PT-18-LTLCardinality-10 finished in 7962 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(X(X(F(p1))))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 455 transition count 570
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 455 transition count 570
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 446 transition count 561
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 34 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 18:24:24] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 18:24:24] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:24:24] [INFO ] Invariant cache hit.
[2024-06-02 18:24:24] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:24:41] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:24:42] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60498 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 695 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (63 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (70 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (93 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (70 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (67 resets) in 587 ms. (68 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 890603 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :2 out of 4
Probabilistic random walk after 890603 steps, saw 175824 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :2
[2024-06-02 18:25:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/81 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/237 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 346/583 variables, 147/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 287/870 variables, 151/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/870 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/954 variables, 54/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/954 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/976 variables, 11/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/976 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/985 variables, 7/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/81 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/237 variables, 32/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 346/583 variables, 147/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 287/870 variables, 151/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/870 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/954 variables, 54/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/954 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 22/976 variables, 11/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/976 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 18 (OVERLAPS) 9/985 variables, 7/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/985 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 442 constraints, problems are : Problem set: 1 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-11 finished in 65558 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((((p0&&X(p1)) U p2)&&(p1 U p3)))))'
Support contains 7 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 458 transition count 573
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 458 transition count 573
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 450 transition count 565
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 450 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 450 transition count 564
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 446 transition count 560
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 446 transition count 560
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 443 transition count 557
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 443 transition count 557
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 442 transition count 556
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 442 transition count 556
Applied a total of 69 rules in 35 ms. Remains 442 /476 variables (removed 34) and now considering 556/591 (removed 35) transitions.
// Phase 1: matrix 556 rows 442 cols
[2024-06-02 18:25:29] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 18:25:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:25:30] [INFO ] Invariant cache hit.
[2024-06-02 18:25:30] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2024-06-02 18:25:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/998 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 555 unsolved
[2024-06-02 18:25:47] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 4 ms to minimize.
[2024-06-02 18:25:48] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/998 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 555 unsolved
(s376 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.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 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0timeout
)
(s377 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 998/998 variables, and 448 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 556/998 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/998 variables, 555/1003 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/998 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 998/998 variables, and 1003 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 442/476 places, 556/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60485 ms. Remains : 442/476 places, 556/591 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-12
Product exploration explored 100000 steps with 4 reset in 122 ms.
Product exploration explored 100000 steps with 31 reset in 118 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 700 edges and 442 vertex of which 437 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X p3), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X p0), (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1)))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p0)), (X (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 128 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p1)), (NOT p3)]
RANDOM walk for 40000 steps (105 resets) in 441 ms. (90 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40000 steps (90 resets) in 530 ms. (75 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (77 resets) in 307 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (54 resets) in 600 ms. (66 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (92 resets) in 313 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (119 resets) in 357 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (78 resets) in 324 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (117 resets) in 289 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (152 resets) in 372 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (75 resets) in 432 ms. (92 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (68 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
[2024-06-02 18:26:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 16/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 55/78 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 197/275 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 17/292 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 10/302 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 390/692 variables, 190/261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 225/917 variables, 131/392 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/917 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 69/986 variables, 46/438 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/986 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 10/996 variables, 6/444 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/996 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 2/998 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/998 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/998 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 998/998 variables, and 446 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 16/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 55/78 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 197/275 variables, 42/75 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 17/292 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 10/302 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 390/692 variables, 190/271 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/692 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 225/917 variables, 131/402 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/917 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 69/986 variables, 46/448 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/986 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem apf9 is UNSAT
At refinement iteration 19 (OVERLAPS) 10/996 variables, 6/454 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/996 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/998 variables, 2/456 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/998 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/998 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 998/998 variables, and 456 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2575ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Finished Parikh walk after 78 steps, including 0 resets, run visited all 9 properties in 6 ms. (steps per millisecond=13 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X p3), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X p0), (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1)))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p0)), (X (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1)))), (X (X p1)), (G (OR p3 p1))]
False Knowledge obtained : [(F (NOT (AND (OR p2 (NOT p3) (NOT p0)) (OR p2 (NOT p1) (NOT p0))))), (F (NOT (OR (AND p2 p3) (AND p2 p1) (AND p3 p0) (AND p1 p0)))), (F (NOT (OR p3 (NOT p1)))), (F (NOT (AND (OR p2 p0) p1))), (F (NOT (AND (OR (NOT p2) p3 (NOT p1)) (OR p3 (NOT p1) (NOT p0))))), (F (NOT (AND (OR p2 p0) (OR p3 p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT p3)), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (AND p2 p3) (AND p2 p1) (AND p3 p0) (AND p1 p0))))
Knowledge based reduction with 22 factoid took 178 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-12 finished in 65899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 446 transition count 561
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 446 transition count 559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 441 transition count 554
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 441 transition count 554
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 437 transition count 550
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 436 transition count 549
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 436 transition count 549
Applied a total of 82 rules in 30 ms. Remains 436 /476 variables (removed 40) and now considering 549/591 (removed 42) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 18:26:35] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:26:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:26:35] [INFO ] Invariant cache hit.
[2024-06-02 18:26:36] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:26:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:26:53] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-06-02 18:26:53] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60473 ms. Remains : 436/476 places, 549/591 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-18-LTLCardinality-13
Product exploration explored 100000 steps with 33345 reset in 128 ms.
Product exploration explored 100000 steps with 33484 reset in 128 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (123 resets) in 328 ms. (121 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (100 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (61 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
[2024-06-02 18:27:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/77 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/315 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/333 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/666 variables, 170/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 207/873 variables, 105/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 83/956 variables, 47/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/956 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 17 (OVERLAPS) 22/978 variables, 14/435 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/984 variables, 4/439 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/985 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 1 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/49 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 169/218 variables, 67/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 251/469 variables, 102/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/488 variables, 4/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 3/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 244/732 variables, 124/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/732 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 166/898 variables, 81/387 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/898 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/966 variables, 42/429 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/966 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 13/979 variables, 8/437 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/979 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/984 variables, 3/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/984 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/985 variables, 1/441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/985 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/985 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 441 constraints, problems are : Problem set: 1 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 569ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 10 factoid took 196 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 549/549 transitions.
Applied a total of 0 rules in 10 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 18:27:38] [INFO ] Invariant cache hit.
[2024-06-02 18:27:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:27:38] [INFO ] Invariant cache hit.
[2024-06-02 18:27:38] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:27:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:27:55] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-06-02 18:27:55] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in LTL mode , in 1 iterations and 60472 ms. Remains : 436/436 places, 549/549 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 693 edges and 436 vertex of which 431 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (70 resets) in 305 ms. (130 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (73 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (75 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
[2024-06-02 18:28:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/77 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 227/304 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/315 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/333 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/666 variables, 170/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 207/873 variables, 105/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 83/956 variables, 47/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/956 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/978 variables, 14/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/978 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/984 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/984 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/985 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/985 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/77 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 227/304 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11/315 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/333 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 333/666 variables, 170/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 207/873 variables, 105/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/873 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 83/956 variables, 47/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/956 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 22/978 variables, 14/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/978 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/984 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/984 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/985 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 789ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 330 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 101 reset in 80 ms.
Entered a terminal (fully accepting) state of product in 212 steps with 5 reset in 0 ms.
FORMULA CO4-PT-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-13 finished in 125086 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' '!(((p0 U X(p1))||X((p1 U p2))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 456 transition count 571
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 448 transition count 563
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 448 transition count 563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 448 transition count 561
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 445 transition count 558
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 445 transition count 558
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 442 transition count 555
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 442 transition count 555
Applied a total of 70 rules in 28 ms. Remains 442 /476 variables (removed 34) and now considering 555/591 (removed 36) transitions.
// Phase 1: matrix 555 rows 442 cols
[2024-06-02 18:28:40] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 18:28:40] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:28:40] [INFO ] Invariant cache hit.
[2024-06-02 18:28:41] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 554 sub problems to find dead transitions.
[2024-06-02 18:28:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (OVERLAPS) 555/997 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 554 unsolved
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/997 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.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 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/997 variables, and 448 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 555/997 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 554/1002 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 1002 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 442/476 places, 555/591 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 442/476 places, 555/591 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 699 edges and 442 vertex of which 437 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-14 finished in 61018 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||X(p1)))))'
Found a Lengthening insensitive property : CO4-PT-18-LTLCardinality-09
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 476/476 places, 591/591 transitions.
Graph (trivial) has 509 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 738 edges and 474 vertex of which 468 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 467 transition count 363
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 249 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 441 place count 248 transition count 361
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 441 place count 248 transition count 315
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 533 place count 202 transition count 315
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 537 place count 198 transition count 311
Iterating global reduction 3 with 4 rules applied. Total rules applied 541 place count 198 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 541 place count 198 transition count 309
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 545 place count 196 transition count 309
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 548 place count 193 transition count 306
Iterating global reduction 3 with 3 rules applied. Total rules applied 551 place count 193 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 552 place count 193 transition count 305
Performed 73 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 698 place count 120 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 704 place count 120 transition count 206
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 709 place count 115 transition count 201
Iterating global reduction 5 with 5 rules applied. Total rules applied 714 place count 115 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 716 place count 114 transition count 200
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 782 place count 81 transition count 202
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 803 place count 81 transition count 181
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 831 place count 53 transition count 125
Iterating global reduction 6 with 28 rules applied. Total rules applied 859 place count 53 transition count 125
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 878 place count 53 transition count 106
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 885 place count 46 transition count 86
Iterating global reduction 7 with 7 rules applied. Total rules applied 892 place count 46 transition count 86
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 897 place count 46 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 899 place count 45 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 902 place count 45 transition count 87
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 903 place count 45 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 904 place count 45 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 906 place count 43 transition count 84
Applied a total of 906 rules in 39 ms. Remains 43 /476 variables (removed 433) and now considering 84/591 (removed 507) transitions.
[2024-06-02 18:29:42] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
// Phase 1: matrix 79 rows 43 cols
[2024-06-02 18:29:42] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:29:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 18:29:42] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:42] [INFO ] Invariant cache hit.
[2024-06-02 18:29:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:29:42] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-02 18:29:42] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:42] [INFO ] Invariant cache hit.
[2024-06-02 18:29:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 70 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 70/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 119 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1903ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1904ms
Starting structural reductions in LI_LTL mode, iteration 1 : 43/476 places, 84/591 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2047 ms. Remains : 43/476 places, 84/591 transitions.
Running random walk in product with property : CO4-PT-18-LTLCardinality-09
Product exploration explored 100000 steps with 7 reset in 60 ms.
Product exploration explored 100000 steps with 8 reset in 59 ms.
Computed a total of 7 stabilizing places and 23 stable transitions
Computed a total of 7 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 107 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4265 resets) in 271 ms. (147 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (527 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-06-02 18:29:44] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:44] [INFO ] Invariant cache hit.
[2024-06-02 18:29:44] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/51 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 102/122 variables, and 31 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, State Equation: 31/43 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 324 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-06-02 18:29:45] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:45] [INFO ] Invariant cache hit.
[2024-06-02 18:29:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 18:29:45] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:45] [INFO ] Invariant cache hit.
[2024-06-02 18:29:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:29:45] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-02 18:29:45] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:45] [INFO ] Invariant cache hit.
[2024-06-02 18:29:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 70 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 70/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 119 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1944ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1944ms
Finished structural reductions in LTL mode , in 1 iterations and 2019 ms. Remains : 43/43 places, 84/84 transitions.
Computed a total of 7 stabilizing places and 23 stable transitions
Computed a total of 7 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 30731 steps (3255 resets) in 44 ms. (682 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 20 reset in 46 ms.
Product exploration explored 100000 steps with 27 reset in 45 ms.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-06-02 18:29:47] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:47] [INFO ] Invariant cache hit.
[2024-06-02 18:29:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:29:47] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:47] [INFO ] Invariant cache hit.
[2024-06-02 18:29:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:29:47] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-02 18:29:47] [INFO ] Flow matrix only has 79 transitions (discarded 5 similar events)
[2024-06-02 18:29:47] [INFO ] Invariant cache hit.
[2024-06-02 18:29:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 70 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 78/121 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 70/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 119 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1931ms
Finished structural reductions in LTL mode , in 1 iterations and 2011 ms. Remains : 43/43 places, 84/84 transitions.
Treatment of property CO4-PT-18-LTLCardinality-09 finished in 8048 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)))'
[2024-06-02 18:29:50] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:29:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 18:29:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 476 places, 591 transitions and 1324 arcs took 6 ms.
Total runtime 726748 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CO4-PT-18-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA CO4-PT-18-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717353113840

--------------------
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
mcc2024
ltl formula name CO4-PT-18-LTLCardinality-09
ltl formula formula --ltl=/tmp/1602/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 476 places, 591 transitions and 1324 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1602/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1602/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1602/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1602/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 477 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 477, there are 602 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~63 levels ~10000 states ~24300 transitions
pnml2lts-mc( 0/ 4): ~63 levels ~20000 states ~56492 transitions
pnml2lts-mc( 0/ 4): ~63 levels ~40000 states ~131728 transitions
pnml2lts-mc( 0/ 4): ~63 levels ~80000 states ~295080 transitions
pnml2lts-mc( 0/ 4): ~83 levels ~160000 states ~610984 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~243!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 97268
pnml2lts-mc( 0/ 4): unique states count: 227207
pnml2lts-mc( 0/ 4): unique transitions count: 806003
pnml2lts-mc( 0/ 4): - self-loop count: 1214
pnml2lts-mc( 0/ 4): - claim dead count: 415327
pnml2lts-mc( 0/ 4): - claim found count: 159961
pnml2lts-mc( 0/ 4): - claim success count: 227218
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1850
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 227218 states 806036 transitions, fanout: 3.547
pnml2lts-mc( 0/ 4): Total exploration time 2.930 sec (2.930 sec minimum, 2.930 sec on average)
pnml2lts-mc( 0/ 4): States per second: 77549, Transitions per second: 275098
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.3MB, 10.7 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 603 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.3MB (~256.0MB paged-in)
ltl formula name CO4-PT-18-LTLCardinality-10
ltl formula formula --ltl=/tmp/1602/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 476 places, 591 transitions and 1324 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1602/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1602/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1602/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1602/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 477 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 477, there are 603 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~81 levels ~10000 states ~23884 transitions
pnml2lts-mc( 3/ 4): ~81 levels ~20000 states ~59128 transitions
pnml2lts-mc( 2/ 4): ~118 levels ~40000 states ~122092 transitions
pnml2lts-mc( 2/ 4): ~118 levels ~80000 states ~270420 transitions
pnml2lts-mc( 2/ 4): ~118 levels ~160000 states ~540032 transitions
pnml2lts-mc( 2/ 4): ~408 levels ~320000 states ~1137408 transitions
pnml2lts-mc( 2/ 4): ~2904 levels ~640000 states ~2276876 transitions
pnml2lts-mc( 2/ 4): ~5513 levels ~1280000 states ~4432972 transitions
pnml2lts-mc( 2/ 4): ~14356 levels ~2560000 states ~9518020 transitions
pnml2lts-mc( 2/ 4): ~16195 levels ~5120000 states ~20905888 transitions
pnml2lts-mc( 1/ 4): ~24191 levels ~10240000 states ~40437196 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~293!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3173532
pnml2lts-mc( 0/ 4): unique states count: 10870272
pnml2lts-mc( 0/ 4): unique transitions count: 46689452
pnml2lts-mc( 0/ 4): - self-loop count: 15476
pnml2lts-mc( 0/ 4): - claim dead count: 19110428
pnml2lts-mc( 0/ 4): - claim found count: 16708732
pnml2lts-mc( 0/ 4): - claim success count: 10876670
pnml2lts-mc( 0/ 4): - cum. max stack depth: 89761
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10884126 states 46764196 transitions, fanout: 4.297
pnml2lts-mc( 0/ 4): Total exploration time 119.630 sec (119.630 sec minimum, 119.630 sec on average)
pnml2lts-mc( 0/ 4): States per second: 90982, Transitions per second: 390907
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 85.1MB, 8.2 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 32.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 603 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 85.1MB (~256.0MB paged-in)

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="CO4-PT-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CO4-PT-18, 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 r553-tall-171734901000139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-18.tgz
mv CO4-PT-18 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 ;