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.r180-tall-171640603700556.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 itstools
Input is GPUForwardProgress-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603700556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 22:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 22:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 22:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 22:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 122K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716510574218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 00:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 00:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:29:35] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-24 00:29:35] [INFO ] Transformed 492 places.
[2024-05-24 00:29:35] [INFO ] Transformed 517 transitions.
[2024-05-24 00:29:35] [INFO ] Found NUPN structural information;
[2024-05-24 00:29:35] [INFO ] Parsed PT model containing 492 places and 517 transitions and 1277 arcs in 190 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 4 formulas.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 517/517 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 491 transition count 517
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 50 place count 442 transition count 468
Iterating global reduction 1 with 49 rules applied. Total rules applied 99 place count 442 transition count 468
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 120 place count 421 transition count 447
Iterating global reduction 1 with 21 rules applied. Total rules applied 141 place count 421 transition count 447
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 160 place count 421 transition count 428
Applied a total of 160 rules in 113 ms. Remains 421 /492 variables (removed 71) and now considering 428/517 (removed 89) transitions.
// Phase 1: matrix 428 rows 421 cols
[2024-05-24 00:29:35] [INFO ] Computed 25 invariants in 22 ms
[2024-05-24 00:29:36] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-24 00:29:36] [INFO ] Invariant cache hit.
[2024-05-24 00:29:36] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-05-24 00:29:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 428/848 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/848 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 1/849 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (OVERLAPS) 0/849 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 446 constraints, problems are : Problem set: 0 solved, 427 unsolved in 29436 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 428/848 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/848 variables, 427/872 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/848 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 1/849 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 0/849 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 873 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
After SMT, in 59636ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 59658ms
Starting structural reductions in LTL mode, iteration 1 : 421/492 places, 428/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60397 ms. Remains : 421/492 places, 428/517 transitions.
Support contains 28 out of 421 places after structural reductions.
[2024-05-24 00:30:36] [INFO ] Flatten gal took : 52 ms
[2024-05-24 00:30:36] [INFO ] Flatten gal took : 24 ms
[2024-05-24 00:30:36] [INFO ] Input system was already deterministic with 428 transitions.
RANDOM walk for 40000 steps (187 resets) in 2932 ms. (13 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40003 steps (17 resets) in 171 ms. (232 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (22 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
[2024-05-24 00:30:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 337/420 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 428/848 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/849 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/849 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 226 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 337/420 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 428/848 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/849 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/849 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 448 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 345 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 646 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 388 transition count 218
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 205 rules applied. Total rules applied 407 place count 190 transition count 211
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 412 place count 187 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 414 place count 185 transition count 209
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 414 place count 185 transition count 159
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 514 place count 135 transition count 159
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 540 place count 109 transition count 133
Iterating global reduction 4 with 26 rules applied. Total rules applied 566 place count 109 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 566 place count 109 transition count 132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 568 place count 108 transition count 132
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 712 place count 36 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 98 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 714 place count 35 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 716 place count 35 transition count 57
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 736 place count 15 transition count 17
Iterating global reduction 6 with 20 rules applied. Total rules applied 756 place count 15 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 761 place count 12 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 17 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 3 rules applied. Total rules applied 764 place count 11 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 765 place count 11 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 766 place count 10 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 767 place count 9 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 767 place count 9 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 773 place count 6 transition count 8
Applied a total of 773 rules in 52 ms. Remains 6 /421 variables (removed 415) and now considering 8/428 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 6/421 places, 8/428 transitions.
RANDOM walk for 13349 steps (3 resets) in 48 ms. (272 steps per ms) remains 0/2 properties
Computed a total of 81 stabilizing places and 81 stable transitions
Graph (complete) has 653 edges and 421 vertex of which 393 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 351 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 387 transition count 216
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 210 rules applied. Total rules applied 414 place count 185 transition count 208
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 417 place count 182 transition count 208
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 417 place count 182 transition count 157
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 519 place count 131 transition count 157
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 543 place count 107 transition count 133
Iterating global reduction 3 with 24 rules applied. Total rules applied 567 place count 107 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 567 place count 107 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 569 place count 106 transition count 132
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 739 place count 10 transition count 13
Iterating global reduction 4 with 23 rules applied. Total rules applied 762 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 764 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 765 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 766 place count 8 transition count 11
Applied a total of 766 rules in 36 ms. Remains 8 /421 variables (removed 413) and now considering 11/428 (removed 417) transitions.
[2024-05-24 00:30:38] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-24 00:30:38] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 00:30:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 00:30:38] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-24 00:30:38] [INFO ] Invariant cache hit.
[2024-05-24 00:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:30:38] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-24 00:30:38] [INFO ] Redundant transitions in 13 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 00:30:38] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-24 00:30:38] [INFO ] Invariant cache hit.
[2024-05-24 00:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/421 places, 11/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 8/421 places, 11/428 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-01 finished in 414 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(p0)||F((p1||X((p2||X(F((p2&&F(p0))))))))))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 28 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-24 00:30:39] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 00:30:39] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-24 00:30:39] [INFO ] Invariant cache hit.
[2024-05-24 00:30:39] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-24 00:30:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 27001 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 57107ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 57112ms
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57488 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 254 ms.
Product exploration explored 100000 steps with 25000 reset in 160 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.7 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (193 resets) in 417 ms. (95 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
[2024-05-24 00:31:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 362/407 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 362/407 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/817 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/818 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/818 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 2 factoid took 304 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Applied a total of 0 rules in 5 ms. Remains 408 /408 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2024-05-24 00:31:38] [INFO ] Invariant cache hit.
[2024-05-24 00:31:38] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-24 00:31:38] [INFO ] Invariant cache hit.
[2024-05-24 00:31:39] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-24 00:31:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 26803 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 56903ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56907ms
Finished structural reductions in LTL mode , in 1 iterations and 57254 ms. Remains : 408/408 places, 410/410 transitions.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (189 resets) in 152 ms. (261 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
[2024-05-24 00:32:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 362/407 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 362/407 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/817 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/818 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/818 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=99 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 107 ms.
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Graph (trivial) has 328 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 629 edges and 403 vertex of which 375 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 192 rules applied. Total rules applied 194 place count 375 transition count 401
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 194 place count 375 transition count 403
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 222 place count 375 transition count 403
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 365 place count 232 transition count 260
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 143 rules applied. Total rules applied 508 place count 232 transition count 260
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 531 place count 209 transition count 237
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 554 place count 209 transition count 237
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 629 place count 209 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 631 place count 209 transition count 236
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 683 place count 157 transition count 183
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 735 place count 157 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 736 place count 157 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 737 place count 156 transition count 182
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 156 transition count 182
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 760 place count 156 transition count 247
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 802 place count 114 transition count 163
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 844 place count 114 transition count 163
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 904 place count 54 transition count 63
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 964 place count 54 transition count 63
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 964 rules in 78 ms. Remains 54 /408 variables (removed 354) and now considering 63/410 (removed 347) transitions.
[2024-05-24 00:32:38] [INFO ] Redundant transitions in 12 ms returned []
Running 62 sub problems to find dead transitions.
// Phase 1: matrix 63 rows 54 cols
[2024-05-24 00:32:38] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:32:38] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 1 (OVERLAPS) 62/115 variables, 53/53 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 12/65 constraints. Problems are: Problem set: 44 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/65 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/116 variables, 1/66 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/66 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/67 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/67 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/67 constraints. Problems are: Problem set: 44 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 67 constraints, problems are : Problem set: 44 solved, 18 unsolved in 388 ms.
Refiners :[State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 61/74 variables, 13/13 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 12/25 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 18/43 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/43 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 42/116 variables, 41/84 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/84 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/85 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 44 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 85 constraints, problems are : Problem set: 44 solved, 18 unsolved in 355 ms.
Refiners :[State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 18/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 752ms problems are : Problem set: 44 solved, 18 unsolved
Search for dead transitions found 44 dead transitions in 753ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/408 places, 19/410 transitions.
Graph (complete) has 47 edges and 54 vertex of which 14 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 14 /54 variables (removed 40) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/408 places, 19/410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 850 ms. Remains : 14/408 places, 19/410 transitions.
Built C files in :
/tmp/ltsmin10907257434568225310
[2024-05-24 00:32:39] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10907257434568225310
Running compilation step : cd /tmp/ltsmin10907257434568225310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 783 ms.
Running link step : cd /tmp/ltsmin10907257434568225310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10907257434568225310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12206747606655322594.hoa' '--buchi-type=spotba'
LTSmin run took 245 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-03 finished in 121442 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 U p1)||F(p2)))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 347 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 387 transition count 220
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 204 rules applied. Total rules applied 404 place count 189 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 406 place count 187 transition count 214
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 406 place count 187 transition count 162
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 510 place count 135 transition count 162
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 533 place count 112 transition count 139
Iterating global reduction 3 with 23 rules applied. Total rules applied 556 place count 112 transition count 139
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 704 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 705 place count 38 transition count 64
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 727 place count 16 transition count 21
Iterating global reduction 4 with 22 rules applied. Total rules applied 749 place count 16 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 753 place count 14 transition count 20
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 755 place count 14 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 13 transition count 19
Applied a total of 756 rules in 26 ms. Remains 13 /421 variables (removed 408) and now considering 19/428 (removed 409) transitions.
[2024-05-24 00:32:40] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 00:32:40] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 00:32:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 00:32:40] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 00:32:40] [INFO ] Invariant cache hit.
[2024-05-24 00:32:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 00:32:40] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-24 00:32:40] [INFO ] Redundant transitions in 11 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-24 00:32:40] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 00:32:40] [INFO ] Invariant cache hit.
[2024-05-24 00:32:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 16 constraints, problems are : Problem set: 0 solved, 17 unsolved in 135 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/31 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 144 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/421 places, 19/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 13/421 places, 19/428 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-04
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-04 finished in 533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 411 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 411 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 31 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-24 00:32:41] [INFO ] Computed 25 invariants in 5 ms
[2024-05-24 00:32:41] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 00:32:41] [INFO ] Invariant cache hit.
[2024-05-24 00:32:41] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-24 00:32:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 27949 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 58050ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 58055ms
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58418 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 75345 steps with 359 reset in 135 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-05 finished in 58773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U p1))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 411 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 411 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 32 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-24 00:33:39] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 00:33:39] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 00:33:39] [INFO ] Invariant cache hit.
[2024-05-24 00:33:40] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-24 00:33:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 27841 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 57934ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 57938ms
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58289 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-06
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-06 finished in 58494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 351 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 387 transition count 218
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 208 rules applied. Total rules applied 410 place count 187 transition count 210
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 414 place count 184 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 183 transition count 209
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 415 place count 183 transition count 158
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 517 place count 132 transition count 158
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 541 place count 108 transition count 134
Iterating global reduction 4 with 24 rules applied. Total rules applied 565 place count 108 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 565 place count 108 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 567 place count 107 transition count 133
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 739 place count 10 transition count 13
Iterating global reduction 5 with 23 rules applied. Total rules applied 762 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 764 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 765 place count 8 transition count 11
Applied a total of 765 rules in 22 ms. Remains 8 /421 variables (removed 413) and now considering 11/428 (removed 417) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 00:34:38] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:34:38] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 00:34:38] [INFO ] Invariant cache hit.
[2024-05-24 00:34:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:34:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 00:34:38] [INFO ] Redundant transitions in 12 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-24 00:34:38] [INFO ] Invariant cache hit.
[2024-05-24 00:34:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 54 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 65 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/421 places, 11/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 8/421 places, 11/428 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-07 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U X(G((p2&&X(!p0))))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 410 transition count 414
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 410 transition count 414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 410 transition count 412
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 409 transition count 411
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 409 transition count 411
Applied a total of 29 rules in 28 ms. Remains 409 /421 variables (removed 12) and now considering 411/428 (removed 17) transitions.
// Phase 1: matrix 411 rows 409 cols
[2024-05-24 00:34:38] [INFO ] Computed 25 invariants in 5 ms
[2024-05-24 00:34:38] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-24 00:34:38] [INFO ] Invariant cache hit.
[2024-05-24 00:34:38] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2024-05-24 00:34:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (OVERLAPS) 1/820 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (OVERLAPS) 0/820 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 434 constraints, problems are : Problem set: 0 solved, 410 unsolved in 27101 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 410/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 1/820 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 844 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
After SMT, in 57211ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 57214ms
Starting structural reductions in LTL mode, iteration 1 : 409/421 places, 411/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57586 ms. Remains : 409/421 places, 411/428 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) p0), true, (AND p2 p0), (NOT p1), (AND (NOT p1) p2 p0), p0]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-09
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-09 finished in 57990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 353 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 387 transition count 215
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 211 rules applied. Total rules applied 416 place count 184 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 419 place count 181 transition count 207
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 419 place count 181 transition count 156
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 521 place count 130 transition count 156
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 545 place count 106 transition count 132
Iterating global reduction 3 with 24 rules applied. Total rules applied 569 place count 106 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 569 place count 106 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 105 transition count 131
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 740 place count 9 transition count 11
Iterating global reduction 4 with 24 rules applied. Total rules applied 764 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 766 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 767 place count 7 transition count 9
Applied a total of 767 rules in 19 ms. Remains 7 /421 variables (removed 414) and now considering 9/428 (removed 419) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-24 00:35:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:35:36] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 00:35:36] [INFO ] Invariant cache hit.
[2024-05-24 00:35:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:35:36] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-24 00:35:36] [INFO ] Redundant transitions in 12 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-24 00:35:36] [INFO ] Invariant cache hit.
[2024-05-24 00:35:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/421 places, 9/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 7/421 places, 9/428 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-11
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-11 finished in 313 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)||G(p1)))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 349 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 387 transition count 218
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 206 rules applied. Total rules applied 408 place count 187 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 185 transition count 212
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 410 place count 185 transition count 160
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 514 place count 133 transition count 160
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 538 place count 109 transition count 136
Iterating global reduction 3 with 24 rules applied. Total rules applied 562 place count 109 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 562 place count 109 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 564 place count 108 transition count 135
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 708 place count 36 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 709 place count 36 transition count 62
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 732 place count 13 transition count 17
Iterating global reduction 4 with 23 rules applied. Total rules applied 755 place count 13 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 759 place count 11 transition count 16
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 761 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 762 place count 10 transition count 15
Applied a total of 762 rules in 27 ms. Remains 10 /421 variables (removed 411) and now considering 15/428 (removed 413) transitions.
[2024-05-24 00:35:36] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2024-05-24 00:35:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:35:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 00:35:36] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 00:35:36] [INFO ] Invariant cache hit.
[2024-05-24 00:35:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:35:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 00:35:36] [INFO ] Redundant transitions in 40 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-24 00:35:36] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 00:35:36] [INFO ] Invariant cache hit.
[2024-05-24 00:35:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 61 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 123 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/421 places, 15/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 10/421 places, 15/428 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-12 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 26 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-24 00:35:37] [INFO ] Computed 25 invariants in 11 ms
[2024-05-24 00:35:37] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-24 00:35:37] [INFO ] Invariant cache hit.
[2024-05-24 00:35:37] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-24 00:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 27022 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 57121ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 57126ms
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57556 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Product exploration explored 100000 steps with 33333 reset in 171 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 52 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-13 finished in 58074 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)||(p1&&X(p1)))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 414 transition count 421
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 414 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 414 transition count 419
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 411 transition count 416
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 411 transition count 416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 27 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-24 00:36:35] [INFO ] Computed 25 invariants in 1 ms
[2024-05-24 00:36:35] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-24 00:36:35] [INFO ] Invariant cache hit.
[2024-05-24 00:36:35] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-24 00:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 27530 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 57632ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 57636ms
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58165 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-14 finished in 58359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 25 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-24 00:37:33] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 00:37:33] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-24 00:37:33] [INFO ] Invariant cache hit.
[2024-05-24 00:37:34] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-24 00:37:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 26369 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30009 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 56475ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56482ms
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56904 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-15
Product exploration explored 100000 steps with 633 reset in 211 ms.
Product exploration explored 100000 steps with 630 reset in 250 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.18 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 662 steps (0 resets) in 5 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-24 00:38:31] [INFO ] Invariant cache hit.
[2024-05-24 00:38:31] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-24 00:38:32] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-24 00:38:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:38:32] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-24 00:38:32] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-24 00:38:32] [INFO ] Computed and/alt/rep : 404/530/404 causal constraints (skipped 5 transitions) in 45 ms.
[2024-05-24 00:38:34] [INFO ] Added : 390 causal constraints over 78 iterations in 2548 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Graph (trivial) has 333 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 629 edges and 403 vertex of which 375 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 193 place count 374 transition count 209
Reduce places removed 191 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 192 rules applied. Total rules applied 385 place count 183 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 182 transition count 208
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 386 place count 182 transition count 156
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 490 place count 130 transition count 156
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 513 place count 107 transition count 133
Iterating global reduction 3 with 23 rules applied. Total rules applied 536 place count 107 transition count 133
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 684 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 685 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 708 place count 10 transition count 13
Iterating global reduction 4 with 23 rules applied. Total rules applied 731 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 733 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 734 place count 8 transition count 11
Applied a total of 734 rules in 10 ms. Remains 8 /408 variables (removed 400) and now considering 11/410 (removed 399) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 00:38:34] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 00:38:35] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-24 00:38:35] [INFO ] Invariant cache hit.
[2024-05-24 00:38:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:38:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-24 00:38:35] [INFO ] Redundant transitions in 56 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-24 00:38:35] [INFO ] Invariant cache hit.
[2024-05-24 00:38:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 57 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 67 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/408 places, 11/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 8/408 places, 11/410 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-24 00:38:35] [INFO ] Invariant cache hit.
[2024-05-24 00:38:35] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 00:38:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:38:35] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 00:38:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:38:35] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 00:38:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 00:38:35] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 00:38:35] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-15 finished in 62288 ms.
All properties solved by simple procedures.
Total runtime 540690 ms.

BK_STOP 1716511116098

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-24b, 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 r180-tall-171640603700556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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