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-171734897900124.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-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897900124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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 260K 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-16-LTLFireability-00
FORMULA_NAME CO4-PT-16-LTLFireability-01
FORMULA_NAME CO4-PT-16-LTLFireability-02
FORMULA_NAME CO4-PT-16-LTLFireability-03
FORMULA_NAME CO4-PT-16-LTLFireability-04
FORMULA_NAME CO4-PT-16-LTLFireability-05
FORMULA_NAME CO4-PT-16-LTLFireability-06
FORMULA_NAME CO4-PT-16-LTLFireability-07
FORMULA_NAME CO4-PT-16-LTLFireability-08
FORMULA_NAME CO4-PT-16-LTLFireability-09
FORMULA_NAME CO4-PT-16-LTLFireability-10
FORMULA_NAME CO4-PT-16-LTLFireability-11
FORMULA_NAME CO4-PT-16-LTLFireability-12
FORMULA_NAME CO4-PT-16-LTLFireability-13
FORMULA_NAME CO4-PT-16-LTLFireability-14
FORMULA_NAME CO4-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717358337059

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:58:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:58:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:58:58] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-02 19:58:58] [INFO ] Transformed 837 places.
[2024-06-02 19:58:58] [INFO ] Transformed 1122 transitions.
[2024-06-02 19:58:58] [INFO ] Found NUPN structural information;
[2024-06-02 19:58:58] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 704 transition count 939
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 180 place count 544 transition count 777
Iterating global reduction 1 with 160 rules applied. Total rules applied 340 place count 544 transition count 777
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 346 place count 544 transition count 771
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 431 place count 459 transition count 669
Iterating global reduction 2 with 85 rules applied. Total rules applied 516 place count 459 transition count 669
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 519 place count 459 transition count 666
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 537 place count 441 transition count 639
Iterating global reduction 3 with 18 rules applied. Total rules applied 555 place count 441 transition count 639
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 557 place count 441 transition count 637
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 566 place count 432 transition count 628
Iterating global reduction 4 with 9 rules applied. Total rules applied 575 place count 432 transition count 628
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 581 place count 426 transition count 622
Iterating global reduction 4 with 6 rules applied. Total rules applied 587 place count 426 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 593 place count 426 transition count 616
Applied a total of 593 rules in 155 ms. Remains 426 /721 variables (removed 295) and now considering 616/942 (removed 326) transitions.
// Phase 1: matrix 616 rows 426 cols
[2024-06-02 19:58:58] [INFO ] Computed 7 invariants in 25 ms
[2024-06-02 19:58:59] [INFO ] Implicit Places using invariants in 300 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 328 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/721 places, 616/942 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 509 ms. Remains : 424/721 places, 616/942 transitions.
Support contains 31 out of 424 places after structural reductions.
[2024-06-02 19:58:59] [INFO ] Flatten gal took : 83 ms
[2024-06-02 19:58:59] [INFO ] Flatten gal took : 58 ms
[2024-06-02 19:58:59] [INFO ] Input system was already deterministic with 616 transitions.
RANDOM walk for 40000 steps (591 resets) in 1716 ms. (23 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (14 resets) in 19 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (12 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
// Phase 1: matrix 616 rows 424 cols
[2024-06-02 19:59:00] [INFO ] Computed 5 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/51 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 209/260 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 403/663 variables, 153/209 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 317/980 variables, 176/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/980 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 53/1033 variables, 40/425 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1033 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 7/1040 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1040 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/1040 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 429 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 23/51 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 209/260 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 403/663 variables, 153/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 317/980 variables, 176/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 53/1033 variables, 40/438 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1033 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 7/1040 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1040 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/1040 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 442 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2092 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 3534ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Parikh walk visited 13 properties in 1598 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 919 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 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(G(p0))||G(p1))))'
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 412 transition count 600
Applied a total of 26 rules in 41 ms. Remains 412 /424 variables (removed 12) and now considering 600/616 (removed 16) transitions.
// Phase 1: matrix 600 rows 412 cols
[2024-06-02 19:59:05] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 19:59:05] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 19:59:05] [INFO ] Invariant cache hit.
[2024-06-02 19:59:06] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 19:59:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/1012 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 19:59:24] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 23 ms to minimize.
[2024-06-02 19:59:25] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 419 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 19:59:43] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (OVERLAPS) 600/1012 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 599/1019 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 19:59:59] [INFO ] Deduced a trap composed of 152 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 600/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60834 ms. Remains : 412/424 places, 600/616 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-16-LTLFireability-00
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 5 ms.
FORMULA CO4-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-00 finished in 61131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 600
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 412 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 412 transition count 599
Applied a total of 26 rules in 25 ms. Remains 412 /424 variables (removed 12) and now considering 599/616 (removed 17) transitions.
// Phase 1: matrix 599 rows 412 cols
[2024-06-02 20:00:06] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:00:07] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-02 20:00:07] [INFO ] Invariant cache hit.
[2024-06-02 20:00:07] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2024-06-02 20:00:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1011 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 20:00:25] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 10 ms to minimize.
[2024-06-02 20:00:25] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:00:25] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1011 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 20:00:55] [INFO ] Deduced a trap composed of 152 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1011 variables, 1/1019 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1019 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 599/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 412/424 places, 599/616 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 895 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-16-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-01 finished in 61427 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))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 457 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 418 transition count 456
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 157 rules applied. Total rules applied 312 place count 265 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 313 place count 264 transition count 452
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 313 place count 264 transition count 405
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 407 place count 217 transition count 405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 411 place count 213 transition count 400
Iterating global reduction 3 with 4 rules applied. Total rules applied 415 place count 213 transition count 400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 415 place count 213 transition count 397
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 421 place count 210 transition count 397
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 424 place count 207 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 427 place count 207 transition count 391
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 549 place count 146 transition count 315
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 567 place count 146 transition count 297
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 573 place count 143 transition count 294
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 576 place count 140 transition count 288
Iterating global reduction 5 with 3 rules applied. Total rules applied 579 place count 140 transition count 288
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 587 place count 136 transition count 284
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 588 place count 135 transition count 282
Iterating global reduction 5 with 1 rules applied. Total rules applied 589 place count 135 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 590 place count 135 transition count 281
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 672 place count 94 transition count 326
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 693 place count 94 transition count 305
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 720 place count 67 transition count 197
Iterating global reduction 7 with 27 rules applied. Total rules applied 747 place count 67 transition count 197
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 765 place count 67 transition count 179
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 772 place count 60 transition count 141
Iterating global reduction 8 with 7 rules applied. Total rules applied 779 place count 60 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 784 place count 60 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 796 place count 60 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 798 place count 58 transition count 122
Applied a total of 798 rules in 156 ms. Remains 58 /424 variables (removed 366) and now considering 122/616 (removed 494) transitions.
[2024-06-02 20:01:08] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
// Phase 1: matrix 105 rows 58 cols
[2024-06-02 20:01:08] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:01:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 20:01:08] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2024-06-02 20:01:08] [INFO ] Invariant cache hit.
[2024-06-02 20:01:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:01:08] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-02 20:01:08] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-02 20:01:08] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2024-06-02 20:01:08] [INFO ] Invariant cache hit.
[2024-06-02 20:01:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 65 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 99/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 164 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1975 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3538ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3540ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/424 places, 122/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3877 ms. Remains : 58/424 places, 122/616 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-03
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-03 finished in 3944 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(F(p0))&&F((!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 601
Applied a total of 24 rules in 12 ms. Remains 413 /424 variables (removed 11) and now considering 601/616 (removed 15) transitions.
// Phase 1: matrix 601 rows 413 cols
[2024-06-02 20:01:12] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 20:01:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 20:01:12] [INFO ] Invariant cache hit.
[2024-06-02 20:01:12] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-02 20:01:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/1014 variables, 413/418 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-02 20:01:31] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
[2024-06-02 20:01:31] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1014 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-02 20:01:40] [INFO ] Deduced a trap composed of 152 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 421 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/421 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 600/1021 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1014 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1021 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LTL mode, iteration 1 : 413/424 places, 601/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60605 ms. Remains : 413/424 places, 601/616 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-04
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-04 finished in 60814 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(p0)&&X(G(X(p1)))) U p2)))'
Support contains 6 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 607
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 605
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 412 transition count 600
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 411 transition count 599
Applied a total of 28 rules in 22 ms. Remains 411 /424 variables (removed 13) and now considering 599/616 (removed 17) transitions.
// Phase 1: matrix 599 rows 411 cols
[2024-06-02 20:02:13] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 20:02:13] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 20:02:13] [INFO ] Invariant cache hit.
[2024-06-02 20:02:13] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2024-06-02 20:02:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 20:02:24] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1010 variables, 411/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 20:02:32] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 3 ms to minimize.
[2024-06-02 20:02:32] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:02:33] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1010 variables, 411/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 20:02:54] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2024-06-02 20:03:04] [INFO ] Deduced a trap composed of 152 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 2/1020 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1020 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 6/6 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 411/424 places, 599/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60610 ms. Remains : 411/424 places, 599/616 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-05 finished in 60812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!(X(p0) U p1)&&!(p0 U p2)))))'
Support contains 2 out of 424 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 22 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
// Phase 1: matrix 597 rows 410 cols
[2024-06-02 20:03:13] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 20:03:13] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 20:03:13] [INFO ] Invariant cache hit.
[2024-06-02 20:03:14] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 20:03:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:03:32] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:03:32] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:03:41] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:03:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (OR p2 p1), (OR p2 p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-07
Entered a terminal (fully accepting) state of product in 31947 steps with 712 reset in 81 ms.
FORMULA CO4-PT-16-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-07 finished in 60798 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||G(p1)))&&F(G(p2)))))'
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 445 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 418 transition count 465
Reduce places removed 144 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 147 rules applied. Total rules applied 293 place count 274 transition count 462
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 301 place count 273 transition count 455
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 309 place count 266 transition count 454
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 309 place count 266 transition count 408
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 401 place count 220 transition count 408
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 405 place count 216 transition count 403
Iterating global reduction 4 with 4 rules applied. Total rules applied 409 place count 216 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 409 place count 216 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 415 place count 213 transition count 400
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 418 place count 210 transition count 394
Iterating global reduction 4 with 3 rules applied. Total rules applied 421 place count 210 transition count 394
Performed 61 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
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 543 place count 149 transition count 319
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 17 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 565 place count 147 transition count 299
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 567 place count 146 transition count 298
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 570 place count 143 transition count 292
Iterating global reduction 7 with 3 rules applied. Total rules applied 573 place count 143 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 579 place count 140 transition count 289
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 580 place count 139 transition count 287
Iterating global reduction 7 with 1 rules applied. Total rules applied 581 place count 139 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 582 place count 139 transition count 286
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 664 place count 98 transition count 332
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 683 place count 98 transition count 313
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 711 place count 70 transition count 201
Iterating global reduction 9 with 28 rules applied. Total rules applied 739 place count 70 transition count 201
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 756 place count 70 transition count 184
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 763 place count 63 transition count 146
Iterating global reduction 10 with 7 rules applied. Total rules applied 770 place count 63 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 775 place count 63 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 777 place count 62 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 796 place count 62 transition count 139
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 798 place count 62 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 800 place count 60 transition count 137
Applied a total of 800 rules in 85 ms. Remains 60 /424 variables (removed 364) and now considering 137/616 (removed 479) transitions.
[2024-06-02 20:04:14] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
// Phase 1: matrix 123 rows 60 cols
[2024-06-02 20:04:14] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 20:04:14] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:04:14] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 20:04:14] [INFO ] Invariant cache hit.
[2024-06-02 20:04:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 20:04:14] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-02 20:04:14] [INFO ] Redundant transitions in 4 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-02 20:04:14] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 20:04:14] [INFO ] Invariant cache hit.
[2024-06-02 20:04:14] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 71/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/182 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 47/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 188 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3438 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 6139ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 6140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/424 places, 137/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6373 ms. Remains : 60/424 places, 137/616 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CO4-PT-16-LTLFireability-08
Product exploration explored 100000 steps with 115 reset in 87 ms.
Product exploration explored 100000 steps with 60 reset in 88 ms.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 152 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (3004 resets) in 215 ms. (185 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (211 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
[2024-06-02 20:04:21] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 20:04:21] [INFO ] Invariant cache hit.
[2024-06-02 20:04:21] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/96 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/164 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/167 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/182 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/96 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/164 variables, 28/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/167 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/182 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/183 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 370 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-02 20:04:22] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 20:04:22] [INFO ] Invariant cache hit.
[2024-06-02 20:04:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 20:04:22] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 20:04:22] [INFO ] Invariant cache hit.
[2024-06-02 20:04:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 20:04:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-02 20:04:22] [INFO ] Redundant transitions in 5 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-02 20:04:22] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 20:04:22] [INFO ] Invariant cache hit.
[2024-06-02 20:04:22] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 71/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/182 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 47/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 188 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3495 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 6121ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 6123ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6247 ms. Remains : 60/60 places, 137/137 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (3019 resets) in 129 ms. (307 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (206 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2024-06-02 20:04:29] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 20:04:29] [INFO ] Invariant cache hit.
[2024-06-02 20:04:29] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/96 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/164 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/167 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/182 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/96 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/164 variables, 28/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/167 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/182 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/183 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/183 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 270 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering criterion allowed to conclude after 3201 steps with 237 reset in 8 ms.
FORMULA CO4-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-08 finished in 15218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0||F(p1)))))))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 416 transition count 607
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 416 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 416 transition count 606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 413 transition count 601
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 412 transition count 600
Applied a total of 25 rules in 25 ms. Remains 412 /424 variables (removed 12) and now considering 600/616 (removed 16) transitions.
// Phase 1: matrix 600 rows 412 cols
[2024-06-02 20:04:29] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 20:04:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 20:04:29] [INFO ] Invariant cache hit.
[2024-06-02 20:04:30] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 20:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 20:04:41] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 20:04:49] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 3 ms to minimize.
[2024-06-02 20:04:49] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:04:49] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 600/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60601 ms. Remains : 412/424 places, 600/616 transitions.
Stuttering acceptance computed with spot in 119 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-16-LTLFireability-09
Product exploration explored 100000 steps with 1279 reset in 106 ms.
Product exploration explored 100000 steps with 493 reset in 192 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 896 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (887 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (160 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (157 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (158 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 760878 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 3
Probabilistic random walk after 760878 steps, saw 120802 distinct states, run finished after 3004 ms. (steps per millisecond=253 ) properties seen :0
[2024-06-02 20:05:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 184/269 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/282 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/299 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 321/620 variables, 120/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 288/908 variables, 141/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/908 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 98/1006 variables, 68/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/1012 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 417 constraints, problems are : Problem set: 0 solved, 3 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 184/269 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/282 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/299 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 321/620 variables, 120/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 288/908 variables, 141/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 98/1006 variables, 68/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/1012 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 420 constraints, problems are : Problem set: 0 solved, 3 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 826ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 6873 steps, including 109 resets, run visited all 3 properties in 19 ms. (steps per millisecond=361 )
Parikh walk visited 3 properties in 19 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 196 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 600/600 transitions.
Applied a total of 0 rules in 6 ms. Remains 412 /412 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-02 20:05:35] [INFO ] Invariant cache hit.
[2024-06-02 20:05:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 20:05:35] [INFO ] Invariant cache hit.
[2024-06-02 20:05:35] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 20:05:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 20:05:46] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 20:05:54] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 3 ms to minimize.
[2024-06-02 20:05:55] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-06-02 20:05:55] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Finished structural reductions in LTL mode , in 1 iterations and 60576 ms. Remains : 412/412 places, 600/600 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 896 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (889 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (159 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (154 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (154 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 601295 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 3
Probabilistic random walk after 601295 steps, saw 99788 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2024-06-02 20:06:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 184/269 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/282 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/299 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 321/620 variables, 120/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 288/908 variables, 141/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/908 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 98/1006 variables, 68/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/1012 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 417 constraints, problems are : Problem set: 0 solved, 3 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 184/269 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/282 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/299 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 321/620 variables, 120/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 288/908 variables, 141/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 98/1006 variables, 68/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/1012 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 420 constraints, problems are : Problem set: 0 solved, 3 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 5844 steps, including 94 resets, run visited all 3 properties in 67 ms. (steps per millisecond=87 )
Parikh walk visited 3 properties in 67 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 477 reset in 82 ms.
Product exploration explored 100000 steps with 3 reset in 92 ms.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 600/600 transitions.
Applied a total of 0 rules in 4 ms. Remains 412 /412 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-02 20:06:41] [INFO ] Invariant cache hit.
[2024-06-02 20:06:41] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 20:06:41] [INFO ] Invariant cache hit.
[2024-06-02 20:06:41] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 20:06:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 20:06:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 20:07:01] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 3 ms to minimize.
[2024-06-02 20:07:01] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 4 ms to minimize.
[2024-06-02 20:07:01] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Finished structural reductions in LTL mode , in 1 iterations and 60570 ms. Remains : 412/412 places, 600/600 transitions.
Treatment of property CO4-PT-16-LTLFireability-09 finished in 192212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 453 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 418 transition count 458
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 155 rules applied. Total rules applied 308 place count 267 transition count 454
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 310 place count 266 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 265 transition count 453
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 311 place count 265 transition count 407
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 403 place count 219 transition count 407
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 407 place count 215 transition count 402
Iterating global reduction 4 with 4 rules applied. Total rules applied 411 place count 215 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 215 transition count 399
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 212 transition count 399
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 420 place count 209 transition count 393
Iterating global reduction 4 with 3 rules applied. Total rules applied 423 place count 209 transition count 393
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 547 place count 147 transition count 316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 564 place count 147 transition count 299
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 570 place count 144 transition count 296
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 573 place count 141 transition count 290
Iterating global reduction 6 with 3 rules applied. Total rules applied 576 place count 141 transition count 290
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 582 place count 138 transition count 287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 583 place count 137 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 584 place count 137 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 585 place count 137 transition count 284
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 665 place count 97 transition count 327
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 685 place count 97 transition count 307
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 712 place count 70 transition count 199
Iterating global reduction 8 with 27 rules applied. Total rules applied 739 place count 70 transition count 199
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 757 place count 70 transition count 181
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 763 place count 64 transition count 149
Iterating global reduction 9 with 6 rules applied. Total rules applied 769 place count 64 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 773 place count 64 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 775 place count 63 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 793 place count 63 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 795 place count 61 transition count 142
Applied a total of 795 rules in 74 ms. Remains 61 /424 variables (removed 363) and now considering 142/616 (removed 474) transitions.
[2024-06-02 20:07:42] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
// Phase 1: matrix 119 rows 61 cols
[2024-06-02 20:07:42] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:07:42] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-02 20:07:42] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
[2024-06-02 20:07:42] [INFO ] Invariant cache hit.
[2024-06-02 20:07:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 20:07:42] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 20:07:42] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-02 20:07:42] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
[2024-06-02 20:07:42] [INFO ] Invariant cache hit.
[2024-06-02 20:07:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 118/179 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 70 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1997 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 118/179 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 119/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 1/180 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 189 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2666 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4716ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4719ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/424 places, 142/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5081 ms. Remains : 61/424 places, 142/616 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-10 finished in 5209 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((p1||X(F(p2)))))))'
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 452 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 418 transition count 460
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 153 rules applied. Total rules applied 304 place count 269 transition count 456
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 306 place count 268 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 267 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 307 place count 267 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 401 place count 220 transition count 408
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 406 place count 215 transition count 402
Iterating global reduction 4 with 5 rules applied. Total rules applied 411 place count 215 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 215 transition count 399
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 212 transition count 399
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 419 place count 210 transition count 395
Iterating global reduction 4 with 2 rules applied. Total rules applied 421 place count 210 transition count 395
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 543 place count 149 transition count 319
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 566 place count 146 transition count 299
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 569 place count 143 transition count 293
Iterating global reduction 6 with 3 rules applied. Total rules applied 572 place count 143 transition count 293
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 578 place count 140 transition count 290
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 660 place count 99 transition count 340
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 681 place count 99 transition count 319
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 709 place count 71 transition count 207
Iterating global reduction 7 with 28 rules applied. Total rules applied 737 place count 71 transition count 207
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 756 place count 71 transition count 188
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 762 place count 65 transition count 156
Iterating global reduction 8 with 6 rules applied. Total rules applied 768 place count 65 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 772 place count 65 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 786 place count 65 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 788 place count 63 transition count 136
Applied a total of 788 rules in 63 ms. Remains 63 /424 variables (removed 361) and now considering 136/616 (removed 480) transitions.
[2024-06-02 20:07:47] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
// Phase 1: matrix 118 rows 63 cols
[2024-06-02 20:07:47] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:07:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:07:47] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
[2024-06-02 20:07:47] [INFO ] Invariant cache hit.
[2024-06-02 20:07:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:07:47] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-06-02 20:07:47] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2024-06-02 20:07:47] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
[2024-06-02 20:07:47] [INFO ] Invariant cache hit.
[2024-06-02 20:07:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 117/179 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/181 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 70 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2529 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 117/179 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 68/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/180 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/181 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 183 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3203 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 5773ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 5775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/424 places, 136/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5978 ms. Remains : 63/424 places, 136/616 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-16-LTLFireability-11
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-11 finished in 6124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 22 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
// Phase 1: matrix 597 rows 410 cols
[2024-06-02 20:07:53] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 20:07:53] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 20:07:53] [INFO ] Invariant cache hit.
[2024-06-02 20:07:53] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 20:07:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:08:12] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:08:12] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:08:21] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:08:31] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60566 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-12 finished in 60684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 30 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
[2024-06-02 20:08:54] [INFO ] Invariant cache hit.
[2024-06-02 20:08:54] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 20:08:54] [INFO ] Invariant cache hit.
[2024-06-02 20:08:54] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 20:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:09:12] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-06-02 20:09:12] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:09:21] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 20:09:31] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60635 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 577 steps with 12 reset in 2 ms.
FORMULA CO4-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-13 finished in 60832 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))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 457 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 422 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 421 transition count 459
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 158 rules applied. Total rules applied 314 place count 267 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 266 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 315 place count 266 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 409 place count 219 transition count 408
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 413 place count 215 transition count 403
Iterating global reduction 3 with 4 rules applied. Total rules applied 417 place count 215 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 417 place count 215 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 423 place count 212 transition count 400
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 426 place count 209 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 429 place count 209 transition count 394
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
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 553 place count 147 transition count 317
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 571 place count 147 transition count 299
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 577 place count 144 transition count 296
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 580 place count 141 transition count 290
Iterating global reduction 5 with 3 rules applied. Total rules applied 583 place count 141 transition count 290
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 5 with 8 rules applied. Total rules applied 591 place count 137 transition count 286
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 592 place count 136 transition count 284
Iterating global reduction 5 with 1 rules applied. Total rules applied 593 place count 136 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 594 place count 136 transition count 283
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 676 place count 95 transition count 329
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 696 place count 95 transition count 309
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 724 place count 67 transition count 197
Iterating global reduction 7 with 28 rules applied. Total rules applied 752 place count 67 transition count 197
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 771 place count 67 transition count 178
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 778 place count 60 transition count 140
Iterating global reduction 8 with 7 rules applied. Total rules applied 785 place count 60 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 790 place count 60 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 792 place count 59 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 812 place count 59 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 814 place count 57 transition count 130
Applied a total of 814 rules in 66 ms. Remains 57 /424 variables (removed 367) and now considering 130/616 (removed 486) transitions.
[2024-06-02 20:09:54] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
// Phase 1: matrix 102 rows 57 cols
[2024-06-02 20:09:54] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:09:55] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-02 20:09:55] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2024-06-02 20:09:55] [INFO ] Invariant cache hit.
[2024-06-02 20:09:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 20:09:55] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-06-02 20:09:55] [INFO ] Redundant transitions in 0 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-02 20:09:55] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2024-06-02 20:09:55] [INFO ] Invariant cache hit.
[2024-06-02 20:09:55] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 1/159 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 65 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1645 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 107/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 172 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2167 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 3851ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 3852ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/424 places, 130/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4152 ms. Remains : 57/424 places, 130/616 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-14 finished in 4205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0||F(p1)))))))'
Found a Lengthening insensitive property : CO4-PT-16-LTLFireability-09
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 455 edges and 424 vertex of which 2 / 424 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 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 418 transition count 457
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 154 rules applied. Total rules applied 308 place count 266 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 308 place count 266 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 402 place count 219 transition count 408
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 405 place count 216 transition count 404
Iterating global reduction 2 with 3 rules applied. Total rules applied 408 place count 216 transition count 404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 408 place count 216 transition count 402
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 214 transition count 402
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 414 place count 212 transition count 398
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 212 transition count 398
Performed 63 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 542 place count 149 transition count 320
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 18 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 566 place count 146 transition count 299
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 569 place count 143 transition count 293
Iterating global reduction 4 with 3 rules applied. Total rules applied 572 place count 143 transition count 293
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 4 with 8 rules applied. Total rules applied 580 place count 139 transition count 289
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 581 place count 138 transition count 287
Iterating global reduction 4 with 1 rules applied. Total rules applied 582 place count 138 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 583 place count 138 transition count 286
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 665 place count 97 transition count 334
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 686 place count 97 transition count 313
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 714 place count 69 transition count 201
Iterating global reduction 6 with 28 rules applied. Total rules applied 742 place count 69 transition count 201
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 761 place count 69 transition count 182
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 767 place count 63 transition count 150
Iterating global reduction 7 with 6 rules applied. Total rules applied 773 place count 63 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 777 place count 63 transition count 146
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 779 place count 61 transition count 144
Applied a total of 779 rules in 43 ms. Remains 61 /424 variables (removed 363) and now considering 144/616 (removed 472) transitions.
[2024-06-02 20:09:59] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
// Phase 1: matrix 126 rows 61 cols
[2024-06-02 20:09:59] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:09:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 20:09:59] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:09:59] [INFO ] Invariant cache hit.
[2024-06-02 20:09:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:09:59] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-02 20:09:59] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:09:59] [INFO ] Invariant cache hit.
[2024-06-02 20:09:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2558 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 4542ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 4544ms
Starting structural reductions in LI_LTL mode, iteration 1 : 61/424 places, 144/616 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4824 ms. Remains : 61/424 places, 144/616 transitions.
Running random walk in product with property : CO4-PT-16-LTLFireability-09
Product exploration explored 100000 steps with 1378 reset in 114 ms.
Product exploration explored 100000 steps with 127 reset in 151 ms.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3332 resets) in 186 ms. (213 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (262 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
[2024-06-02 20:10:04] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:10:04] [INFO ] Invariant cache hit.
[2024-06-02 20:10:04] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/63 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/96 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/99 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/110 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/149 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/186 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/63 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/96 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/99 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/110 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/149 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/186 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-06-02 20:10:05] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:10:05] [INFO ] Invariant cache hit.
[2024-06-02 20:10:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 20:10:05] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:10:05] [INFO ] Invariant cache hit.
[2024-06-02 20:10:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:10:05] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-02 20:10:05] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:10:05] [INFO ] Invariant cache hit.
[2024-06-02 20:10:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2634 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 4676ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 4678ms
Finished structural reductions in LTL mode , in 1 iterations and 4778 ms. Remains : 61/61 places, 144/144 transitions.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3340 resets) in 198 ms. (201 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (259 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 20:10:10] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:10:10] [INFO ] Invariant cache hit.
[2024-06-02 20:10:10] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/63 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/96 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/99 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/110 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/149 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/186 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/63 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/96 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/99 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/110 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/149 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 37/186 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/187 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 163 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 927 reset in 44 ms.
Product exploration explored 100000 steps with 94 reset in 40 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-06-02 20:10:11] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:10:11] [INFO ] Invariant cache hit.
[2024-06-02 20:10:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 20:10:11] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:10:11] [INFO ] Invariant cache hit.
[2024-06-02 20:10:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 20:10:11] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-02 20:10:11] [INFO ] Flow matrix only has 126 transitions (discarded 18 similar events)
[2024-06-02 20:10:11] [INFO ] Invariant cache hit.
[2024-06-02 20:10:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 125/186 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2627 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 4685ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 4686ms
Finished structural reductions in LTL mode , in 1 iterations and 4794 ms. Remains : 61/61 places, 144/144 transitions.
Treatment of property CO4-PT-16-LTLFireability-09 finished in 17051 ms.
[2024-06-02 20:10:16] [INFO ] Flatten gal took : 52 ms
[2024-06-02 20:10:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 20:10:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 424 places, 616 transitions and 1650 arcs took 6 ms.
Total runtime 678045 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CO4-PT-16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 424
TRANSITIONS: 616
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 1635
MODEL NAME: /home/mcc/execution/414/model
424 places, 616 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.
Building monolithic NSF...
FORMULA CO4-PT-16-LTLFireability-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717359547932

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-16, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734897900124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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