Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 239K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME 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 1748609646256

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 12:54:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 12:54:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:54:07] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2025-05-30 12:54:07] [INFO ] Transformed 979 places.
[2025-05-30 12:54:07] [INFO ] Transformed 1111 transitions.
[2025-05-30 12:54:07] [INFO ] Found NUPN structural information;
[2025-05-30 12:54:07] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 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-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 810 transition count 931
Discarding 124 places :
Symmetric choice reduction at 1 with 124 rule applications. Total rules 139 place count 686 transition count 805
Iterating global reduction 1 with 124 rules applied. Total rules applied 263 place count 686 transition count 805
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 368 place count 581 transition count 700
Iterating global reduction 1 with 105 rules applied. Total rules applied 473 place count 581 transition count 700
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 476 place count 581 transition count 697
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 524 place count 533 transition count 649
Iterating global reduction 2 with 48 rules applied. Total rules applied 572 place count 533 transition count 649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 573 place count 533 transition count 648
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 605 place count 501 transition count 616
Iterating global reduction 3 with 32 rules applied. Total rules applied 637 place count 501 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 501 transition count 615
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 656 place count 483 transition count 597
Iterating global reduction 4 with 18 rules applied. Total rules applied 674 place count 483 transition count 597
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 676 place count 483 transition count 595
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 682 place count 477 transition count 589
Iterating global reduction 5 with 6 rules applied. Total rules applied 688 place count 477 transition count 589
Applied a total of 688 rules in 249 ms. Remains 477 /822 variables (removed 345) and now considering 589/934 (removed 345) transitions.
// Phase 1: matrix 589 rows 477 cols
[2025-05-30 12:54:08] [INFO ] Computed 5 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:54:08] [INFO ] Implicit Places using invariants in 296 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/822 places, 589/934 transitions.
Applied a total of 0 rules in 18 ms. Remains 476 /476 variables (removed 0) and now considering 589/589 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 608 ms. Remains : 476/822 places, 589/934 transitions.
Support contains 34 out of 476 places after structural reductions.
[2025-05-30 12:54:08] [INFO ] Flatten gal took : 55 ms
[2025-05-30 12:54:08] [INFO ] Flatten gal took : 28 ms
[2025-05-30 12:54:08] [INFO ] Input system was already deterministic with 589 transitions.
Support contains 30 out of 476 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (46 resets) in 1445 ms. (27 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4002 steps (24 resets) in 58 ms. (67 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (22 resets) in 45 ms. (87 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (18 resets) in 53 ms. (74 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (19 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (15 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (20 resets) in 30 ms. (129 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4002 steps (20 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (22 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
// Phase 1: matrix 589 rows 476 cols
[2025-05-30 12:54:09] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 46/69 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 179/248 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 15/263 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 11/274 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 362/636 variables, 170/242 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 289/925 variables, 151/393 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/925 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 112/1037 variables, 68/461 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1037 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 24/1061 variables, 16/477 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1061 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 4/1065 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1065 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/1065 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1065/1065 variables, and 480 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 46/69 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 179/248 variables, 44/67 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 15/263 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 11/274 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 362/636 variables, 170/258 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:54:12] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 289/925 variables, 151/410 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/925 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 112/1037 variables, 68/478 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1037 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 24/1061 variables, 16/494 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1061 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 4/1065 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1065 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 0/1065 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1065/1065 variables, and 497 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4685 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6460ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 15 properties in 1720 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 589/589 transitions.
Graph (trivial) has 508 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 2 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 731 edges and 474 vertex of which 454 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 454 transition count 329
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 228 rules applied. Total rules applied 473 place count 229 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 474 place count 228 transition count 326
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 474 place count 228 transition count 281
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 564 place count 183 transition count 281
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 566 place count 181 transition count 279
Iterating global reduction 3 with 2 rules applied. Total rules applied 568 place count 181 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 181 transition count 278
Performed 70 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 709 place count 111 transition count 194
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 716 place count 111 transition count 187
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 723 place count 104 transition count 180
Iterating global reduction 5 with 7 rules applied. Total rules applied 730 place count 104 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 731 place count 104 transition count 179
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 735 place count 102 transition count 177
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 797 place count 71 transition count 179
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 817 place count 71 transition count 159
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 844 place count 44 transition count 105
Iterating global reduction 7 with 27 rules applied. Total rules applied 871 place count 44 transition count 105
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 889 place count 44 transition count 87
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 896 place count 37 transition count 67
Iterating global reduction 8 with 7 rules applied. Total rules applied 903 place count 37 transition count 67
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 908 place count 37 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 910 place count 36 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 913 place count 36 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 922 place count 36 transition count 59
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 927 place count 36 transition count 54
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 10 with 7 rules applied. Total rules applied 934 place count 31 transition count 52
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 937 place count 31 transition count 52
Graph (complete) has 98 edges and 31 vertex of which 30 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 11 with 1 rules applied. Total rules applied 938 place count 30 transition count 52
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 939 place count 30 transition count 51
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 940 place count 30 transition count 51
Graph (complete) has 95 edges and 30 vertex of which 29 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 941 place count 29 transition count 51
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 942 place count 29 transition count 50
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 943 place count 29 transition count 50
Graph (complete) has 92 edges and 29 vertex of which 28 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 944 place count 28 transition count 50
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 945 place count 28 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 946 place count 27 transition count 48
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 t69.t73.t525.t560 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 19 edges and 23 vertex of which 3 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 17 with 3 rules applied. Total rules applied 949 place count 21 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 954 place count 21 transition count 41
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 955 place count 20 transition count 39
Iterating global reduction 19 with 1 rules applied. Total rules applied 956 place count 20 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 957 place count 20 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 20 with 7 rules applied. Total rules applied 964 place count 20 transition count 31
Discarding 4 places :
Symmetric choice reduction at 20 with 4 rule applications. Total rules 968 place count 16 transition count 27
Iterating global reduction 20 with 4 rules applied. Total rules applied 972 place count 16 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 976 place count 16 transition count 23
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 978 place count 14 transition count 21
Iterating global reduction 21 with 2 rules applied. Total rules applied 980 place count 14 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 982 place count 14 transition count 19
Free-agglomeration rule applied 2 times.
Iterating global reduction 22 with 2 rules applied. Total rules applied 984 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 986 place count 12 transition count 17
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 988 place count 12 transition count 17
Applied a total of 988 rules in 104 ms. Remains 12 /476 variables (removed 464) and now considering 17/589 (removed 572) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 12/476 places, 17/589 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA CO4-PT-18-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 734 edges and 476 vertex of which 466 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0)) U (p1&&X(X(X(p2)))))))'
Support contains 5 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 589/589 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 589
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 458 transition count 573
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 458 transition count 573
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 449 transition count 564
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 449 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 449 transition count 563
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 443 transition count 557
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 443 transition count 557
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 440 transition count 554
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 440 transition count 554
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 439 transition count 553
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 439 transition count 553
Applied a total of 73 rules in 52 ms. Remains 439 /476 variables (removed 37) and now considering 553/589 (removed 36) transitions.
// Phase 1: matrix 553 rows 439 cols
[2025-05-30 12:54:18] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:54:18] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-30 12:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:54:18] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 552 sub problems to find dead transitions.
[2025-05-30 12:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (OVERLAPS) 553/992 variables, 439/443 constraints. Problems are: Problem set: 0 solved, 552 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:54:41] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:54:41] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/992 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 552 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 992/992 variables, and 445 constraints, problems are : Problem set: 0 solved, 552 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 553/992 variables, 439/445 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/992 variables, 552/997 constraints. Problems are: Problem set: 0 solved, 552 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/992 variables, and 997 constraints, problems are : Problem set: 0 solved, 552 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 439/476 places, 553/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60536 ms. Remains : 439/476 places, 553/589 transitions.
Stuttering acceptance computed with spot in 827 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-00
Product exploration explored 100000 steps with 19900 reset in 236 ms.
Product exploration explored 100000 steps with 20093 reset in 193 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 697 edges and 439 vertex of which 434 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 15 states, 33 edges and 3 AP (stutter sensitive) to 15 states, 33 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 679 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (74 resets) in 319 ms. (125 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40000 steps (138 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (109 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (62 resets) in 138 ms. (287 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (29 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
[2025-05-30 12:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/94 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 262/356 variables, 89/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/367 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 18/385 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 328/713 variables, 176/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/713 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 187/900 variables, 96/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/900 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 73/973 variables, 45/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/973 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 15/988 variables, 10/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/988 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 4/992 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/992 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/992 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 443 constraints, problems are : Problem set: 0 solved, 3 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/94 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 262/356 variables, 89/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/367 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 18/385 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 328/713 variables, 176/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/713 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 187/900 variables, 96/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/900 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 73/973 variables, 45/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/973 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 15/988 variables, 10/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/988 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 4/992 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/992 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/992 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 446 constraints, problems are : Problem set: 0 solved, 3 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 3 properties in 16 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 4 factoid took 333 ms. Reduced automaton from 15 states, 33 edges and 3 AP (stutter sensitive) to 15 states, 33 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 714 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 673 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
[2025-05-30 12:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 12:55:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-30 12:55:24] [INFO ] [Real]Absence check using state equation in 133 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (OR p2 p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 372 ms. Reduced automaton from 15 states, 33 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-00 finished in 66793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&F(G(p0))))))'
Support contains 1 out of 476 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 589/589 transitions.
Graph (trivial) has 509 edges and 476 vertex of which 3 / 476 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 732 edges and 474 vertex of which 464 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 219 place count 463 transition count 360
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 439 place count 246 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 440 place count 245 transition count 357
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 440 place count 245 transition count 311
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 532 place count 199 transition count 311
Performed 76 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 684 place count 123 transition count 216
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 691 place count 123 transition count 209
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 698 place count 116 transition count 202
Iterating global reduction 4 with 7 rules applied. Total rules applied 705 place count 116 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 706 place count 116 transition count 201
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 710 place count 114 transition count 199
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 776 place count 81 transition count 201
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 797 place count 81 transition count 180
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 824 place count 54 transition count 126
Iterating global reduction 6 with 27 rules applied. Total rules applied 851 place count 54 transition count 126
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 869 place count 54 transition count 108
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 876 place count 47 transition count 88
Iterating global reduction 7 with 7 rules applied. Total rules applied 883 place count 47 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 888 place count 47 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 892 place count 45 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 914 place count 45 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 916 place count 43 transition count 86
Applied a total of 916 rules in 52 ms. Remains 43 /476 variables (removed 433) and now considering 86/589 (removed 503) transitions.
[2025-05-30 12:55:24] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
// Phase 1: matrix 76 rows 43 cols
[2025-05-30 12:55:24] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:55:24] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 12:55:24] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
[2025-05-30 12:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:55:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 12:55:24] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:55:24] [INFO ] Redundant transitions in 2 ms returned []
Running 73 sub problems to find dead transitions.
[2025-05-30 12:55:24] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
[2025-05-30 12:55:24] [INFO ] Invariant cache hit.
[2025-05-30 12:55:24] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 73/122 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 123 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2195 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3662ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3662ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/476 places, 86/589 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3810 ms. Remains : 43/476 places, 86/589 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-01
Product exploration explored 100000 steps with 39 reset in 63 ms.
Product exploration explored 100000 steps with 18 reset in 69 ms.
Computed a total of 8 stabilizing places and 16 stable transitions
Computed a total of 8 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
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 38 ms :[(NOT p0)]
RANDOM walk for 1236 steps (130 resets) in 27 ms. (44 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 104 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2025-05-30 12:55:29] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
[2025-05-30 12:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:55:29] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 12:55:29] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
[2025-05-30 12:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:55:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 12:55:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:55:29] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2025-05-30 12:55:29] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
[2025-05-30 12:55:29] [INFO ] Invariant cache hit.
[2025-05-30 12:55:29] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 50 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 75/118 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 73/122 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 123 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2112 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3523ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3523ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3617 ms. Remains : 43/43 places, 86/86 transitions.
Computed a total of 8 stabilizing places and 16 stable transitions
Computed a total of 8 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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)]
RANDOM walk for 3352 steps (356 resets) in 49 ms. (67 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 102 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30 reset in 38 ms.
Product exploration explored 100000 steps with 5 reset in 34 ms.
Built C files in :
/tmp/ltsmin5065558302501760055
[2025-05-30 12:55:33] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2025-05-30 12:55:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:55:33] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2025-05-30 12:55:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:55:33] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2025-05-30 12:55:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:55:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5065558302501760055
Running compilation step : cd /tmp/ltsmin5065558302501760055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 298 ms.
Running link step : cd /tmp/ltsmin5065558302501760055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5065558302501760055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2941735110525567057.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA CO4-PT-18-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLCardinality-01 finished in 8914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U ((!p1&&X(X(p0)))||X(X(G(p0)))))))'
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 589/589 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 589
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 456 transition count 571
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 447 transition count 562
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 447 transition count 562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 447 transition count 560
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 441 transition count 554
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 441 transition count 554
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 438 transition count 551
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 438 transition count 551
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 437 transition count 550
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 437 transition count 550
Applied a total of 78 rules in 47 ms. Remains 437 /476 variables (removed 39) and now considering 550/589 (removed 39) transitions.
// Phase 1: matrix 550 rows 437 cols
[2025-05-30 12:55:33] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:55:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-30 12:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:55:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2025-05-30 12:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:55:57] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:55:57] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 992 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 437/476 places, 550/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60470 ms. Remains : 437/476 places, 550/589 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-18-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 3208 steps with 635 reset in 7 ms.
FORMULA CO4-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-02 finished in 60670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 589/589 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 589
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 454 transition count 569
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 454 transition count 569
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 444 transition count 559
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 444 transition count 559
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 444 transition count 557
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 438 transition count 551
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 438 transition count 551
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 435 transition count 548
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 435 transition count 548
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 434 transition count 547
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 434 transition count 547
Applied a total of 84 rules in 46 ms. Remains 434 /476 variables (removed 42) and now considering 547/589 (removed 42) transitions.
// Phase 1: matrix 547 rows 434 cols
[2025-05-30 12:56:34] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:56:34] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 12:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:56:34] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2025-05-30 12:56:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 547/981 variables, 434/438 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:56:57] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:56:57] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/981 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/981 variables, and 440 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (OVERLAPS) 547/981 variables, 434/440 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 546/986 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 986 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 434/476 places, 547/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60493 ms. Remains : 434/476 places, 547/589 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-08 finished in 60696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X(X(!G(p0))) U p1)))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 589/589 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 589
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 457 transition count 571
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 457 transition count 571
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 449 transition count 563
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 449 transition count 563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 449 transition count 561
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 444 transition count 556
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 444 transition count 556
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 442 transition count 554
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 442 transition count 554
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 441 transition count 553
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 441 transition count 553
Applied a total of 71 rules in 44 ms. Remains 441 /476 variables (removed 35) and now considering 553/589 (removed 36) transitions.
// Phase 1: matrix 553 rows 441 cols
[2025-05-30 12:57:35] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:57:35] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-30 12:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:57:35] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 552 sub problems to find dead transitions.
[2025-05-30 12:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (OVERLAPS) 1/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (OVERLAPS) 553/993 variables, 440/444 constraints. Problems are: Problem set: 0 solved, 552 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:57:58] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:57:59] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/994 variables, and 446 constraints, problems are : Problem set: 0 solved, 552 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 440/441 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (OVERLAPS) 1/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 553/993 variables, 440/446 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/993 variables, 551/997 constraints. Problems are: Problem set: 0 solved, 552 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/994 variables, and 997 constraints, problems are : Problem set: 0 solved, 552 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 440/441 constraints, PredecessorRefiner: 551/552 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 441/476 places, 553/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60424 ms. Remains : 441/476 places, 553/589 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : CO4-PT-18-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 697 edges and 441 vertex of which 433 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-09 finished in 60920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(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, 589/589 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 589
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 458 transition count 573
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 458 transition count 573
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 450 transition count 565
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 450 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 450 transition count 564
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 445 transition count 559
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 445 transition count 559
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 443 transition count 557
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 443 transition count 557
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 442 transition count 556
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 442 transition count 556
Applied a total of 67 rules in 37 ms. Remains 442 /476 variables (removed 34) and now considering 556/589 (removed 33) transitions.
// Phase 1: matrix 556 rows 442 cols
[2025-05-30 12:58:36] [INFO ] Computed 4 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:58:36] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-30 12:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:58:36] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2025-05-30 12:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:58:59] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:59:00] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 7 ms to minimize.
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 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
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 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 442/476 places, 556/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60449 ms. Remains : 442/476 places, 556/589 transitions.
Stuttering acceptance computed with spot in 214 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 31 reset in 169 ms.
Product exploration explored 100000 steps with 11 reset in 153 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 (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)))), (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (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 p2 (NOT p3) p1) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1))))), (X (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 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 (NOT (AND (NOT p3) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 141 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 221 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p1)), (NOT p3)]
RANDOM walk for 40000 steps (71 resets) in 224 ms. (177 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40000 steps (20 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (100 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (40 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (80 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (89 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (115 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (55 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (46 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (108 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (70 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
[2025-05-30 12:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 apf6 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 2686 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3707ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Finished Parikh walk after 612 steps, including 9 resets, run visited all 6 properties in 6 ms. (steps per millisecond=102 )
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 105 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p0 (NOT p3) p1)))), (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 p1))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (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 p2 (NOT p3) p1) (AND p0 (NOT p3) p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (NOT p1))))), (X (X (OR (AND p2 p3) (AND p2 p1) (AND p0 p3) (AND p0 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 (NOT (AND (NOT p3) p1)))), (X (X p1)), (G (OR p3 p1))]
False Knowledge obtained : [(F (NOT (OR p3 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND (OR p2 p0) (OR p3 p1)))), (F (NOT p3)), (F (NOT (AND (OR p2 p0) p1))), (F (NOT p2)), (F (NOT (OR (AND p2 p3) (AND p2 p1) (AND p3 p0) (AND p1 p0)))), (F (NOT (AND (OR p2 (NOT p3) (NOT p0)) (OR p2 (NOT p1) (NOT p0))))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT (AND (OR (NOT p2) p3 (NOT p1)) (OR p3 (NOT p1) (NOT p0)))))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND (OR p2 p0) (OR p3 p1))))
Knowledge based reduction with 22 factoid took 277 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 66161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((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, 589/589 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 589
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 456 transition count 571
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 446 transition count 561
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 446 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 446 transition count 559
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 440 transition count 553
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 440 transition count 553
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 437 transition count 550
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 436 transition count 549
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 436 transition count 549
Applied a total of 80 rules in 47 ms. Remains 436 /476 variables (removed 40) and now considering 549/589 (removed 40) transitions.
// Phase 1: matrix 549 rows 436 cols
[2025-05-30 12:59:42] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:59:42] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-30 12:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:59:42] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2025-05-30 12:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:00:05] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:00:05] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 9 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 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 436/476 places, 549/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60500 ms. Remains : 436/476 places, 549/589 transitions.
Stuttering acceptance computed with spot in 159 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 33378 reset in 137 ms.
Product exploration explored 100000 steps with 33424 reset in 147 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 (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 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 121 ms :[(NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (24 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (98 resets) in 61 ms. (645 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (105 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
[2025-05-30 13:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 apf3 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 354 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 420 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 781ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND 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 215 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 129 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 9 ms. Remains 436 /436 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2025-05-30 13:00:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:00:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-30 13:00:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:00:44] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2025-05-30 13:00:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:01:07] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:01:08] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 10 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 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
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 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in LTL mode , in 1 iterations and 60434 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 (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 117 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 154 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (137 resets) in 82 ms. (481 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (107 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (54 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
[2025-05-30 13:01:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 498 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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 662 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1164ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 254 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 134 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16 reset in 94 ms.
Product exploration explored 100000 steps with 41 reset in 103 ms.
Built C files in :
/tmp/ltsmin830941376738650408
[2025-05-30 13:01:47] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin830941376738650408
Running compilation step : cd /tmp/ltsmin830941376738650408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 760 ms.
Running link step : cd /tmp/ltsmin830941376738650408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin830941376738650408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12201361896994925572.hoa' '--buchi-type=spotba'
LTSmin run took 367 ms.
FORMULA CO4-PT-18-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLCardinality-13 finished in 126772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((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, 589/589 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 589
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 456 transition count 571
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 456 transition count 571
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 448 transition count 563
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 448 transition count 563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 448 transition count 561
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 444 transition count 557
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 444 transition count 557
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 442 transition count 555
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 442 transition count 555
Applied a total of 68 rules in 35 ms. Remains 442 /476 variables (removed 34) and now considering 555/589 (removed 34) transitions.
// Phase 1: matrix 555 rows 442 cols
[2025-05-30 13:01:48] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:01:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-30 13:01:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:01:49] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 554 sub problems to find dead transitions.
[2025-05-30 13:01:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:02:12] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:02:12] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 7 ms to minimize.
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 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
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 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 442/476 places, 555/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60443 ms. Remains : 442/476 places, 555/589 transitions.
Stuttering acceptance computed with spot in 227 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 157 ms.
Product exploration explored 100000 steps with 50000 reset in 161 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.2 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 p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND 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 61031 ms.
All properties solved by simple procedures.
Total runtime 522421 ms.

BK_STOP 1748610169948

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
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 r044-tall-174854028600515"
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.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 ;