Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 248K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717359365090

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:16:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:16:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:16:06] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-02 20:16:06] [INFO ] Transformed 967 places.
[2024-06-02 20:16:06] [INFO ] Transformed 1150 transitions.
[2024-06-02 20:16:06] [INFO ] Found NUPN structural information;
[2024-06-02 20:16:06] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 198 places in 11 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 752 transition count 912
Discarding 161 places :
Symmetric choice reduction at 1 with 161 rule applications. Total rules 178 place count 591 transition count 751
Iterating global reduction 1 with 161 rules applied. Total rules applied 339 place count 591 transition count 751
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 347 place count 591 transition count 743
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 429 place count 509 transition count 661
Iterating global reduction 2 with 82 rules applied. Total rules applied 511 place count 509 transition count 661
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 527 place count 493 transition count 643
Iterating global reduction 2 with 16 rules applied. Total rules applied 543 place count 493 transition count 643
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 546 place count 493 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 548 place count 491 transition count 638
Iterating global reduction 3 with 2 rules applied. Total rules applied 550 place count 491 transition count 638
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 551 place count 490 transition count 637
Iterating global reduction 3 with 1 rules applied. Total rules applied 552 place count 490 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 553 place count 490 transition count 636
Applied a total of 553 rules in 186 ms. Remains 490 /769 variables (removed 279) and now considering 636/912 (removed 276) transitions.
// Phase 1: matrix 636 rows 490 cols
[2024-06-02 20:16:06] [INFO ] Computed 5 invariants in 25 ms
[2024-06-02 20:16:07] [INFO ] Implicit Places using invariants in 301 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 489/769 places, 636/912 transitions.
Applied a total of 0 rules in 17 ms. Remains 489 /489 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 563 ms. Remains : 489/769 places, 636/912 transitions.
Support contains 23 out of 489 places after structural reductions.
[2024-06-02 20:16:07] [INFO ] Flatten gal took : 78 ms
[2024-06-02 20:16:07] [INFO ] Flatten gal took : 49 ms
[2024-06-02 20:16:07] [INFO ] Input system was already deterministic with 636 transitions.
RANDOM walk for 40000 steps (42 resets) in 1890 ms. (21 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40000 steps (75 resets) in 598 ms. (66 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40001 steps (92 resets) in 204 ms. (195 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (34 resets) in 271 ms. (147 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40000 steps (87 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (79 resets) in 476 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (124 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (86 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (59 resets) in 117 ms. (338 steps per ms) remains 7/7 properties
// Phase 1: matrix 636 rows 489 cols
[2024-06-02 20:16:09] [INFO ] Computed 4 invariants in 17 ms
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/40 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 176/216 variables, 32/45 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 9/225 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 16/241 variables, 3/50 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 463/704 variables, 199/249 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/704 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 346/1050 variables, 193/442 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1050 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 66/1116 variables, 45/487 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1116 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 9/1125 variables, 6/493 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1125 variables, 0/493 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1125 variables, 0/493 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 493 constraints, problems are : Problem set: 1 solved, 6 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/35 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 169/204 variables, 29/40 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 6/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/213 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 16/229 variables, 3/51 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 20:16:10] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 1/52 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 461/690 variables, 197/249 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/690 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 353/1043 variables, 196/445 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1043 variables, 0/445 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 70/1113 variables, 47/492 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1113 variables, 0/492 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 11/1124 variables, 7/499 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 1/1125 variables, 1/500 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1125 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/1125 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 500 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2101ms problems are : Problem set: 1 solved, 6 unsolved
Finished Parikh walk after 181 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Parikh walk visited 6 properties in 422 ms.
FORMULA CO4-PT-17-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 825 edges and 489 vertex of which 484 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((G(p0)&&F(p1)))))))))'
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 487 transition count 635
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 480 transition count 628
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 480 transition count 628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 478 transition count 625
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 478 transition count 625
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 477 transition count 624
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 477 transition count 624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 476 transition count 623
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 476 transition count 623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 476 transition count 622
Applied a total of 26 rules in 67 ms. Remains 476 /489 variables (removed 13) and now considering 622/636 (removed 14) transitions.
// Phase 1: matrix 622 rows 476 cols
[2024-06-02 20:16:11] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 20:16:12] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 20:16:12] [INFO ] Invariant cache hit.
[2024-06-02 20:16:12] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2024-06-02 20:16:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (OVERLAPS) 622/1098 variables, 476/480 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-02 20:16:33] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 5 ms to minimize.
[2024-06-02 20:16:33] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 482 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 622/1098 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1098 variables, 621/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1098 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 1103 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 476/489 places, 622/636 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 476/489 places, 622/636 transitions.
Stuttering acceptance computed with spot in 548 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-00
Product exploration explored 100000 steps with 91 reset in 210 ms.
Product exploration explored 100000 steps with 46 reset in 127 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 807 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (78 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (36 resets) in 448 ms. (89 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (64 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (61 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 741030 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 3
Probabilistic random walk after 741030 steps, saw 138042 distinct states, run finished after 3004 ms. (steps per millisecond=246 ) properties seen :0
[2024-06-02 20:17:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/78 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 285/363 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 9/372 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/387 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 463/850 variables, 226/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/850 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 221/1071 variables, 137/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1071 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 25/1096 variables, 17/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1096 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1098 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1098 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1098 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 480 constraints, problems are : Problem set: 0 solved, 3 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/78 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 285/363 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/372 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 15/387 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 463/850 variables, 226/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:17:18] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/850 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/850 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 221/1071 variables, 137/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1071 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 25/1096 variables, 17/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1096 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1098 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1098 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1098 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 484 constraints, problems are : Problem set: 0 solved, 3 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 60 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 622/622 transitions.
Applied a total of 0 rules in 7 ms. Remains 476 /476 variables (removed 0) and now considering 622/622 (removed 0) transitions.
[2024-06-02 20:17:19] [INFO ] Invariant cache hit.
[2024-06-02 20:17:19] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-06-02 20:17:19] [INFO ] Invariant cache hit.
[2024-06-02 20:17:19] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2024-06-02 20:17:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (OVERLAPS) 622/1098 variables, 476/480 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-02 20:17:41] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 11 ms to minimize.
[2024-06-02 20:17:41] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 482 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 622/1098 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1098 variables, 621/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1098 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 1103 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in LTL mode , in 1 iterations and 60916 ms. Remains : 476/476 places, 622/622 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 807 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (81 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (63 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (100 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (90 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 529831 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 3
Probabilistic random walk after 529831 steps, saw 104731 distinct states, run finished after 3002 ms. (steps per millisecond=176 ) properties seen :0
[2024-06-02 20:18:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/78 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 285/363 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 9/372 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/387 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 463/850 variables, 226/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/850 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 221/1071 variables, 137/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1071 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 25/1096 variables, 17/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1096 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1098 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1098 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1098 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 480 constraints, problems are : Problem set: 0 solved, 3 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/78 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 285/363 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/372 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 15/387 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 463/850 variables, 226/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:18:24] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/850 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/850 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 221/1071 variables, 137/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1071 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 25/1096 variables, 17/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1096 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1098 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1098 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1098 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 484 constraints, problems are : Problem set: 0 solved, 3 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1005ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 13 reset in 87 ms.
Product exploration explored 100000 steps with 7 reset in 194 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 622/622 transitions.
Graph (trivial) has 516 edges and 476 vertex of which 2 / 476 are part of one of the 1 SCC in 9 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 806 edges and 475 vertex of which 472 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 165 rules applied. Total rules applied 167 place count 472 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 168 place count 472 transition count 616
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 168 place count 472 transition count 676
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 231 place count 472 transition count 676
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 265 place count 438 transition count 642
Deduced a syphon composed of 193 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 299 place count 438 transition count 642
Performed 57 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 356 place count 438 transition count 719
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 364 place count 438 transition count 711
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 391 place count 411 transition count 678
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 418 place count 411 transition count 678
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 420 place count 409 transition count 675
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 422 place count 409 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 409 transition count 674
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 424 place count 408 transition count 673
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 425 place count 408 transition count 673
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 426 place count 408 transition count 673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 427 place count 408 transition count 672
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 429 place count 406 transition count 670
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 431 place count 406 transition count 670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 432 place count 406 transition count 670
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 433 place count 405 transition count 669
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 434 place count 405 transition count 669
Performed 72 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 5 with 72 rules applied. Total rules applied 506 place count 405 transition count 964
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 5 with 79 rules applied. Total rules applied 585 place count 405 transition count 885
Discarding 149 places :
Symmetric choice reduction at 6 with 149 rule applications. Total rules 734 place count 256 transition count 547
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 6 with 149 rules applied. Total rules applied 883 place count 256 transition count 547
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 930 place count 256 transition count 500
Discarding 93 places :
Symmetric choice reduction at 7 with 93 rule applications. Total rules 1023 place count 163 transition count 333
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 7 with 93 rules applied. Total rules applied 1116 place count 163 transition count 333
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1123 place count 163 transition count 326
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1139 place count 147 transition count 294
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 1155 place count 147 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1156 place count 147 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1161 place count 147 transition count 313
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1164 place count 144 transition count 292
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1167 place count 144 transition count 292
Deduced a syphon composed of 84 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1185 place count 144 transition count 274
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1187 place count 142 transition count 272
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1189 place count 142 transition count 272
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1191 place count 142 transition count 317
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1193 place count 140 transition count 302
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1195 place count 140 transition count 302
Deduced a syphon composed of 82 places in 0 ms
Applied a total of 1195 rules in 302 ms. Remains 140 /476 variables (removed 336) and now considering 302/622 (removed 320) transitions.
[2024-06-02 20:18:27] [INFO ] Redundant transitions in 26 ms returned []
Running 301 sub problems to find dead transitions.
[2024-06-02 20:18:27] [INFO ] Flow matrix only has 292 transitions (discarded 10 similar events)
// Phase 1: matrix 292 rows 140 cols
[2024-06-02 20:18:27] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:18:27] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 289 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
At refinement iteration 4 (OVERLAPS) 291/431 variables, 140/148 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 16/164 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 0/164 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/432 variables, 1/165 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/165 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/432 variables, 0/165 constraints. Problems are: Problem set: 199 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 165 constraints, problems are : Problem set: 199 solved, 102 unsolved in 6726 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 140/140 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 199 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 11/68 variables, 4/4 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 4/8 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 276/344 variables, 68/76 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 16/92 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 102/194 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/194 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 87/431 variables, 72/266 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/266 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/432 variables, 1/267 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/267 constraints. Problems are: Problem set: 199 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/432 variables, 0/267 constraints. Problems are: Problem set: 199 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 267 constraints, problems are : Problem set: 199 solved, 102 unsolved in 5499 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 140/140 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 102/301 constraints, Known Traps: 4/4 constraints]
After SMT, in 12355ms problems are : Problem set: 199 solved, 102 unsolved
Search for dead transitions found 199 dead transitions in 12359ms
Found 199 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 199 transitions
Dead transitions reduction (with SMT) removed 199 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 140/476 places, 103/622 transitions.
Graph (complete) has 203 edges and 140 vertex of which 58 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.1 ms
Discarding 82 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 58 /140 variables (removed 82) and now considering 103/103 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/476 places, 103/622 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12718 ms. Remains : 58/476 places, 103/622 transitions.
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 622/622 transitions.
Applied a total of 0 rules in 8 ms. Remains 476 /476 variables (removed 0) and now considering 622/622 (removed 0) transitions.
// Phase 1: matrix 622 rows 476 cols
[2024-06-02 20:18:39] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 20:18:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 20:18:39] [INFO ] Invariant cache hit.
[2024-06-02 20:18:40] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2024-06-02 20:18:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (OVERLAPS) 622/1098 variables, 476/480 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-02 20:19:00] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-06-02 20:19:01] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1098 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 482 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 622/1098 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1098 variables, 621/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1098 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 1103 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in LTL mode , in 1 iterations and 60516 ms. Remains : 476/476 places, 622/622 transitions.
Treatment of property CO4-PT-17-LTLCardinality-00 finished in 208448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 487 transition count 635
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 478 transition count 626
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 478 transition count 626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 472 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 618
Applied a total of 34 rules in 27 ms. Remains 472 /489 variables (removed 17) and now considering 618/636 (removed 18) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 20:19:40] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 20:19:40] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 20:19:40] [INFO ] Invariant cache hit.
[2024-06-02 20:19:40] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2024-06-02 20:19:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
[2024-06-02 20:20:01] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2024-06-02 20:20:01] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1090 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 472/489 places, 618/636 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60584 ms. Remains : 472/489 places, 618/636 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-17-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-17-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-17-LTLCardinality-01 finished in 61134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(!p1)))))'
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Graph (trivial) has 532 edges and 489 vertex of which 2 / 489 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 824 edges and 488 vertex of which 484 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 483 transition count 456
Reduce places removed 173 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 176 rules applied. Total rules applied 353 place count 310 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 354 place count 309 transition count 453
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 354 place count 309 transition count 391
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 478 place count 247 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 480 place count 245 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 482 place count 245 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 482 place count 245 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 244 transition count 388
Performed 85 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 654 place count 159 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 660 place count 159 transition count 276
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 667 place count 152 transition count 269
Iterating global reduction 4 with 7 rules applied. Total rules applied 674 place count 152 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 675 place count 152 transition count 268
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 683 place count 148 transition count 264
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 773 place count 103 transition count 267
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 802 place count 103 transition count 238
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 841 place count 64 transition count 160
Iterating global reduction 6 with 39 rules applied. Total rules applied 880 place count 64 transition count 160
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 906 place count 64 transition count 134
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 915 place count 55 transition count 108
Iterating global reduction 7 with 9 rules applied. Total rules applied 924 place count 55 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 928 place count 55 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 936 place count 55 transition count 96
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 942 place count 55 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 944 place count 53 transition count 94
Applied a total of 944 rules in 56 ms. Remains 53 /489 variables (removed 436) and now considering 94/636 (removed 542) transitions.
[2024-06-02 20:20:41] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
// Phase 1: matrix 85 rows 53 cols
[2024-06-02 20:20:41] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:20:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:20:41] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
[2024-06-02 20:20:41] [INFO ] Invariant cache hit.
[2024-06-02 20:20:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:20:41] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-02 20:20:41] [INFO ] Redundant transitions in 0 ms returned []
Running 81 sub problems to find dead transitions.
[2024-06-02 20:20:41] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
[2024-06-02 20:20:41] [INFO ] Invariant cache hit.
[2024-06-02 20:20:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 84/136 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/137 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 59 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 84/136 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 80/137 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 140 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1826 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 3271ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/489 places, 94/636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3464 ms. Remains : 53/489 places, 94/636 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : CO4-PT-17-LTLCardinality-03
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-03 finished in 3701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(!p1 U p2)))))'
Support contains 5 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 487 transition count 635
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 480 transition count 628
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 480 transition count 628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 478 transition count 626
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 478 transition count 626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 477 transition count 625
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 477 transition count 625
Applied a total of 23 rules in 29 ms. Remains 477 /489 variables (removed 12) and now considering 625/636 (removed 11) transitions.
// Phase 1: matrix 625 rows 477 cols
[2024-06-02 20:20:45] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 20:20:45] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 20:20:45] [INFO ] Invariant cache hit.
[2024-06-02 20:20:45] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 624 sub problems to find dead transitions.
[2024-06-02 20:20:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/477 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (OVERLAPS) 625/1102 variables, 477/481 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-06-02 20:21:06] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:21:06] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1102 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 483 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/477 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 4 (OVERLAPS) 625/1102 variables, 477/483 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 624/1107 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 1107 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 2/2 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LTL mode, iteration 1 : 477/489 places, 625/636 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60586 ms. Remains : 477/489 places, 625/636 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-17-LTLCardinality-06
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-06 finished in 60751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 488 transition count 636
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 478 transition count 626
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 478 transition count 626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 472 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 618
Applied a total of 34 rules in 34 ms. Remains 472 /489 variables (removed 17) and now considering 618/636 (removed 18) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 20:21:45] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 20:21:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 20:21:46] [INFO ] Invariant cache hit.
[2024-06-02 20:21:46] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2024-06-02 20:21:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1089 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 617 unsolved
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:22:07] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1089 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1089/1090 variables, and 477 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1089 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1089 variables, 581/1058 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1089 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 617 unsolved
SMT process timed out in 60160ms, After SMT, problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 472/489 places, 618/636 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60574 ms. Remains : 472/489 places, 618/636 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-17-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-11 finished in 60750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (!p1||G(!p0))))'
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Graph (trivial) has 533 edges and 489 vertex of which 2 / 489 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 824 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 482 transition count 456
Reduce places removed 173 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 176 rules applied. Total rules applied 353 place count 309 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 354 place count 308 transition count 453
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 354 place count 308 transition count 391
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 478 place count 246 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 480 place count 244 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 482 place count 244 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 482 place count 244 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 243 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 485 place count 242 transition count 387
Iterating global reduction 3 with 1 rules applied. Total rules applied 486 place count 242 transition count 387
Performed 85 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 656 place count 157 transition count 282
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 3 with 9 rules applied. Total rules applied 665 place count 157 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 667 place count 156 transition count 272
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 674 place count 149 transition count 265
Iterating global reduction 5 with 7 rules applied. Total rules applied 681 place count 149 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 682 place count 149 transition count 264
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 690 place count 145 transition count 260
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 778 place count 101 transition count 263
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 807 place count 101 transition count 234
Discarding 39 places :
Symmetric choice reduction at 7 with 39 rule applications. Total rules 846 place count 62 transition count 156
Iterating global reduction 7 with 39 rules applied. Total rules applied 885 place count 62 transition count 156
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 911 place count 62 transition count 130
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 921 place count 52 transition count 101
Iterating global reduction 8 with 10 rules applied. Total rules applied 931 place count 52 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 938 place count 52 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 942 place count 52 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 944 place count 50 transition count 88
Applied a total of 944 rules in 60 ms. Remains 50 /489 variables (removed 439) and now considering 88/636 (removed 548) transitions.
[2024-06-02 20:22:46] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
// Phase 1: matrix 81 rows 50 cols
[2024-06-02 20:22:46] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:22:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:22:46] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 20:22:46] [INFO ] Invariant cache hit.
[2024-06-02 20:22:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 20:22:46] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 20:22:46] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-06-02 20:22:46] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 20:22:46] [INFO ] Invariant cache hit.
[2024-06-02 20:22:46] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-02 20:22:47] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 59 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1697 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 80/130 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 77/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 136 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
After SMT, in 3222ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3224ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/489 places, 88/636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3512 ms. Remains : 50/489 places, 88/636 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND p1 p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-12
Product exploration explored 100000 steps with 8 reset in 148 ms.
Product exploration explored 100000 steps with 69 reset in 142 ms.
Computed a total of 9 stabilizing places and 10 stable transitions
Computed a total of 9 stabilizing places and 10 stable transitions
Detected a total of 9/50 stabilizing places and 10/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 748 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p0 p1), (NOT p0), false, (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 3396 steps (264 resets) in 20 ms. (161 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 496 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND p0 p1), (NOT p0), false, (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(AND p0 p1), (NOT p0), false, (NOT p0)]
[2024-06-02 20:22:52] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 20:22:52] [INFO ] Invariant cache hit.
[2024-06-02 20:22:52] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 20:22:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-02 20:22:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:22:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 20:22:52] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-02 20:22:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 20:22:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-02 20:22:52] [INFO ] Computed and/alt/rep : 65/238/62 causal constraints (skipped 8 transitions) in 5 ms.
[2024-06-02 20:22:52] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Could not prove EG (AND p0 p1)
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-02 20:22:52] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 20:22:52] [INFO ] Invariant cache hit.
[2024-06-02 20:22:52] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 20:22:52] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 20:22:52] [INFO ] Invariant cache hit.
[2024-06-02 20:22:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 20:22:52] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-06-02 20:22:52] [INFO ] Redundant transitions in 0 ms returned []
Running 77 sub problems to find dead transitions.
[2024-06-02 20:22:52] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 20:22:52] [INFO ] Invariant cache hit.
[2024-06-02 20:22:52] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-02 20:22:53] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 59 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1874 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 80/130 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 77/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 136 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
After SMT, in 3433ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3434ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3561 ms. Remains : 50/50 places, 88/88 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Computed a total of 9 stabilizing places and 10 stable transitions
Detected a total of 9/50 stabilizing places and 10/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 529 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND p0 p1), (NOT p0), false, (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 2986 steps (231 resets) in 10 ms. (271 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 521 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND p0 p1), (NOT p0), false, (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(AND p0 p1), (NOT p0), false, (NOT p0)]
[2024-06-02 20:22:57] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-06-02 20:22:57] [INFO ] Invariant cache hit.
[2024-06-02 20:22:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 20:22:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-02 20:22:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:22:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 20:22:57] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-02 20:22:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 20:22:57] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-06-02 20:22:57] [INFO ] Computed and/alt/rep : 65/238/62 causal constraints (skipped 8 transitions) in 4 ms.
[2024-06-02 20:22:57] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND p0 p1)
Stuttering acceptance computed with spot in 129 ms :[(AND p0 p1), (NOT p0), false, (NOT p0)]
Stuttering criterion allowed to conclude after 116 steps with 10 reset in 1 ms.
FORMULA CO4-PT-17-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLCardinality-12 finished in 11106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Graph (trivial) has 533 edges and 489 vertex of which 2 / 489 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 824 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 482 transition count 456
Reduce places removed 173 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 176 rules applied. Total rules applied 353 place count 309 transition count 453
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 355 place count 308 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 356 place count 307 transition count 452
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 356 place count 307 transition count 391
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 478 place count 246 transition count 391
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 481 place count 243 transition count 388
Iterating global reduction 4 with 3 rules applied. Total rules applied 484 place count 243 transition count 388
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 484 place count 243 transition count 386
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 488 place count 241 transition count 386
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 489 place count 240 transition count 385
Iterating global reduction 4 with 1 rules applied. Total rules applied 490 place count 240 transition count 385
Performed 85 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 660 place count 155 transition count 280
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 4 with 9 rules applied. Total rules applied 669 place count 155 transition count 271
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 671 place count 154 transition count 270
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 678 place count 147 transition count 263
Iterating global reduction 6 with 7 rules applied. Total rules applied 685 place count 147 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 686 place count 147 transition count 262
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 694 place count 143 transition count 258
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 782 place count 99 transition count 261
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 811 place count 99 transition count 232
Discarding 39 places :
Symmetric choice reduction at 8 with 39 rule applications. Total rules 850 place count 60 transition count 154
Iterating global reduction 8 with 39 rules applied. Total rules applied 889 place count 60 transition count 154
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 916 place count 60 transition count 127
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 926 place count 50 transition count 98
Iterating global reduction 9 with 10 rules applied. Total rules applied 936 place count 50 transition count 98
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 943 place count 50 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 946 place count 50 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 948 place count 48 transition count 86
Applied a total of 948 rules in 73 ms. Remains 48 /489 variables (removed 441) and now considering 86/636 (removed 550) transitions.
[2024-06-02 20:22:57] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
// Phase 1: matrix 78 rows 48 cols
[2024-06-02 20:22:57] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 20:22:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 20:22:57] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 20:22:57] [INFO ] Invariant cache hit.
[2024-06-02 20:22:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:22:57] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-06-02 20:22:57] [INFO ] Redundant transitions in 0 ms returned []
Running 73 sub problems to find dead transitions.
[2024-06-02 20:22:57] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 20:22:57] [INFO ] Invariant cache hit.
[2024-06-02 20:22:57] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 54 constraints, problems are : Problem set: 0 solved, 73 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 73/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 127 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2208ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/489 places, 86/636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2440 ms. Remains : 48/489 places, 86/636 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLCardinality-14
Product exploration explored 100000 steps with 13 reset in 54 ms.
Product exploration explored 100000 steps with 10 reset in 49 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3237 steps (301 resets) in 13 ms. (231 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 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-02 20:23:00] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 20:23:00] [INFO ] Invariant cache hit.
[2024-06-02 20:23:00] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 20:23:00] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 20:23:00] [INFO ] Invariant cache hit.
[2024-06-02 20:23:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:23:00] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-02 20:23:00] [INFO ] Redundant transitions in 0 ms returned []
Running 73 sub problems to find dead transitions.
[2024-06-02 20:23:00] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 20:23:00] [INFO ] Invariant cache hit.
[2024-06-02 20:23:00] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 54 constraints, problems are : Problem set: 0 solved, 73 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 73/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 127 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1301 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2287ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2393 ms. Remains : 48/48 places, 86/86 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1555 steps (143 resets) in 8 ms. (172 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 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 39 ms.
Product exploration explored 100000 steps with 4 reset in 38 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-02 20:23:03] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 20:23:03] [INFO ] Invariant cache hit.
[2024-06-02 20:23:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 20:23:03] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 20:23:03] [INFO ] Invariant cache hit.
[2024-06-02 20:23:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:23:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-02 20:23:03] [INFO ] Redundant transitions in 0 ms returned []
Running 73 sub problems to find dead transitions.
[2024-06-02 20:23:03] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2024-06-02 20:23:03] [INFO ] Invariant cache hit.
[2024-06-02 20:23:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 54 constraints, problems are : Problem set: 0 solved, 73 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 73/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 127 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2185ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2185ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2279 ms. Remains : 48/48 places, 86/86 transitions.
Treatment of property CO4-PT-17-LTLCardinality-14 finished in 8435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((G(p0)&&F(p1)))))))))'
Found a Shortening insensitive property : CO4-PT-17-LTLCardinality-00
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 489/489 places, 636/636 transitions.
Graph (trivial) has 529 edges and 489 vertex of which 2 / 489 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 824 edges and 488 vertex of which 483 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 482 transition count 459
Reduce places removed 170 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 173 rules applied. Total rules applied 347 place count 312 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 348 place count 311 transition count 456
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 348 place count 311 transition count 394
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 472 place count 249 transition count 394
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 475 place count 246 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 478 place count 246 transition count 391
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 478 place count 246 transition count 389
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 482 place count 244 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 483 place count 243 transition count 388
Iterating global reduction 3 with 1 rules applied. Total rules applied 484 place count 243 transition count 388
Performed 84 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 652 place count 159 transition count 284
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 3 with 9 rules applied. Total rules applied 661 place count 159 transition count 275
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 663 place count 158 transition count 274
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 670 place count 151 transition count 267
Iterating global reduction 5 with 7 rules applied. Total rules applied 677 place count 151 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 678 place count 151 transition count 266
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 686 place count 147 transition count 262
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 772 place count 104 transition count 265
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 802 place count 104 transition count 235
Discarding 37 places :
Symmetric choice reduction at 7 with 37 rule applications. Total rules 839 place count 67 transition count 161
Iterating global reduction 7 with 37 rules applied. Total rules applied 876 place count 67 transition count 161
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 902 place count 67 transition count 135
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 910 place count 59 transition count 112
Iterating global reduction 8 with 8 rules applied. Total rules applied 918 place count 59 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 923 place count 59 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 925 place count 57 transition count 105
Applied a total of 925 rules in 38 ms. Remains 57 /489 variables (removed 432) and now considering 105/636 (removed 531) transitions.
[2024-06-02 20:23:06] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
// Phase 1: matrix 95 rows 57 cols
[2024-06-02 20:23:06] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 20:23:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 20:23:06] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
[2024-06-02 20:23:06] [INFO ] Invariant cache hit.
[2024-06-02 20:23:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:23:06] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 20:23:06] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
[2024-06-02 20:23:06] [INFO ] Invariant cache hit.
[2024-06-02 20:23:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 94/151 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/152 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 63 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 94/151 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 91/153 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/152 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 154 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1940 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 3530ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3531ms
Starting structural reductions in LI_LTL mode, iteration 1 : 57/489 places, 105/636 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3660 ms. Remains : 57/489 places, 105/636 transitions.
Running random walk in product with property : CO4-PT-17-LTLCardinality-00
Product exploration explored 100000 steps with 16 reset in 42 ms.
Product exploration explored 100000 steps with 23 reset in 45 ms.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 22989 steps (2184 resets) in 111 ms. (205 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-06-02 20:23:11] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
[2024-06-02 20:23:11] [INFO ] Invariant cache hit.
[2024-06-02 20:23:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 20:23:11] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
[2024-06-02 20:23:11] [INFO ] Invariant cache hit.
[2024-06-02 20:23:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:23:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 20:23:11] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
[2024-06-02 20:23:11] [INFO ] Invariant cache hit.
[2024-06-02 20:23:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 94/151 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/152 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 63 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 94/151 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 91/153 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/152 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 154 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 3279ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3280ms
Finished structural reductions in LTL mode , in 1 iterations and 3373 ms. Remains : 57/57 places, 105/105 transitions.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (3809 resets) in 649 ms. (61 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (437 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (430 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
[2024-06-02 20:23:15] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
[2024-06-02 20:23:15] [INFO ] Invariant cache hit.
[2024-06-02 20:23:15] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/76 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 44/120 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/123 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/129 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 10/139 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/151 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/151 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/152 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 63/76 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 44/120 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/123 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/129 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 10/139 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/151 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/151 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/151 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/152 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/152 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 34 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 15 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 44 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 105/105 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 57 transition count 102
Applied a total of 3 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 102/105 (removed 3) transitions.
[2024-06-02 20:23:17] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-02 20:23:17] [INFO ] Flow matrix only has 92 transitions (discarded 10 similar events)
// Phase 1: matrix 92 rows 57 cols
[2024-06-02 20:23:17] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 20:23:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 91/148 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/149 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 63 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 91/148 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 89/151 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 152 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3126ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 102/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3141 ms. Remains : 57/57 places, 102/105 transitions.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-06-02 20:23:20] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
// Phase 1: matrix 95 rows 57 cols
[2024-06-02 20:23:20] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 20:23:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 20:23:20] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
[2024-06-02 20:23:20] [INFO ] Invariant cache hit.
[2024-06-02 20:23:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:23:21] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 20:23:21] [INFO ] Flow matrix only has 95 transitions (discarded 10 similar events)
[2024-06-02 20:23:21] [INFO ] Invariant cache hit.
[2024-06-02 20:23:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 94/151 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/152 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 63 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1491 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 94/151 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 91/153 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/152 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 154 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 3279ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3280ms
Finished structural reductions in LTL mode , in 1 iterations and 3386 ms. Remains : 57/57 places, 105/105 transitions.
Treatment of property CO4-PT-17-LTLCardinality-00 finished in 18163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-02 20:23:24] [INFO ] Flatten gal took : 30 ms
[2024-06-02 20:23:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 20:23:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 489 places, 636 transitions and 1453 arcs took 7 ms.
Total runtime 438285 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CO4-PT-17

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2038
MODEL NAME: /home/mcc/execution/412/model
489 places, 636 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CO4-PT-17-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-17-LTLCardinality-00 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717360291826

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-17, 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 r549-tall-171734897900131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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