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.r496-tall-171640603600540.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is GPUForwardProgress-PT-20b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603600540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 22:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 22:22 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 103K 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-20b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717198069262

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:27:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:27:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:27:50] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-31 23:27:50] [INFO ] Transformed 416 places.
[2024-05-31 23:27:50] [INFO ] Transformed 437 transitions.
[2024-05-31 23:27:50] [INFO ] Found NUPN structural information;
[2024-05-31 23:27:50] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 437/437 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 437
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 43 place count 373 transition count 395
Iterating global reduction 1 with 42 rules applied. Total rules applied 85 place count 373 transition count 395
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 102 place count 356 transition count 378
Iterating global reduction 1 with 17 rules applied. Total rules applied 119 place count 356 transition count 378
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 134 place count 356 transition count 363
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 355 transition count 362
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 355 transition count 362
Applied a total of 136 rules in 109 ms. Remains 355 /416 variables (removed 61) and now considering 362/437 (removed 75) transitions.
// Phase 1: matrix 362 rows 355 cols
[2024-05-31 23:27:50] [INFO ] Computed 21 invariants in 22 ms
[2024-05-31 23:27:51] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-31 23:27:51] [INFO ] Invariant cache hit.
[2024-05-31 23:27:51] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-31 23:27:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 362/716 variables, 354/375 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/716 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 1/717 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 0/717 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 376 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21638 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 362/716 variables, 354/375 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/716 variables, 361/736 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/716 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 1/717 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/717 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 717/717 variables, and 737 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21983 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 43744ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 43773ms
Starting structural reductions in LTL mode, iteration 1 : 355/416 places, 362/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44430 ms. Remains : 355/416 places, 362/437 transitions.
Support contains 30 out of 355 places after structural reductions.
[2024-05-31 23:28:35] [INFO ] Flatten gal took : 44 ms
[2024-05-31 23:28:35] [INFO ] Flatten gal took : 18 ms
[2024-05-31 23:28:35] [INFO ] Input system was already deterministic with 362 transitions.
Support contains 29 out of 355 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (226 resets) in 2110 ms. (18 steps per ms) remains 4/27 properties
BEST_FIRST walk for 40003 steps (25 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (25 resets) in 87 ms. (454 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (27 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2024-05-31 23:28:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 289/354 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 362/716 variables, 354/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/717 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/717 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 376 constraints, problems are : Problem set: 0 solved, 2 unsolved in 205 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 289/354 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 362/716 variables, 354/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/716 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/717 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/717 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 717/717 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 205 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8944 steps, including 88 resets, run visited all 2 properties in 111 ms. (steps per millisecond=80 )
Parikh walk visited 2 properties in 117 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Graph (complete) has 551 edges and 355 vertex of which 331 are kept as prefixes of interest. Removing 24 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' '!((X(G((p0&&X(G(p1))))) U (p0||X(F(p2)))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
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 348 transition count 353
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 346 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 346 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 346 transition count 349
Applied a total of 22 rules in 37 ms. Remains 346 /355 variables (removed 9) and now considering 349/362 (removed 13) transitions.
// Phase 1: matrix 349 rows 346 cols
[2024-05-31 23:28:37] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 23:28:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 23:28:37] [INFO ] Invariant cache hit.
[2024-05-31 23:28:37] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-31 23:28:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 1/695 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 367 constraints, problems are : Problem set: 0 solved, 348 unsolved in 19703 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 348/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 1/695 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 695/695 variables, and 715 constraints, problems are : Problem set: 0 solved, 348 unsolved in 22391 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
After SMT, in 42165ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 42169ms
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 349/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42487 ms. Remains : 346/355 places, 349/362 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 538 edges and 346 vertex of which 322 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/346 stabilizing places and 63/349 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-00 finished in 43207 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((X(p1)||p0)))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 21 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-31 23:29:20] [INFO ] Computed 21 invariants in 2 ms
[2024-05-31 23:29:20] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 23:29:20] [INFO ] Invariant cache hit.
[2024-05-31 23:29:20] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:29:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 18979 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22086 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41123ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41127ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41465 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-02 finished in 41603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
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 348 transition count 353
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 346 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 346 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 346 transition count 349
Applied a total of 22 rules in 14 ms. Remains 346 /355 variables (removed 9) and now considering 349/362 (removed 13) transitions.
// Phase 1: matrix 349 rows 346 cols
[2024-05-31 23:30:01] [INFO ] Computed 21 invariants in 5 ms
[2024-05-31 23:30:01] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 23:30:01] [INFO ] Invariant cache hit.
[2024-05-31 23:30:02] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-31 23:30:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 1/695 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 367 constraints, problems are : Problem set: 0 solved, 348 unsolved in 19397 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 348/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 1/695 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 695/695 variables, and 715 constraints, problems are : Problem set: 0 solved, 348 unsolved in 22751 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
After SMT, in 42205ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 42210ms
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 349/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42485 ms. Remains : 346/355 places, 349/362 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 5936 steps with 28 reset in 23 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-03 finished in 42604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 16 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-31 23:30:44] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 23:30:44] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 23:30:44] [INFO ] Invariant cache hit.
[2024-05-31 23:30:44] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19612 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22528 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 42193ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 42196ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42534 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-04 finished in 42652 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 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 345 transition count 350
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 345 transition count 350
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 345 transition count 348
Applied a total of 24 rules in 19 ms. Remains 345 /355 variables (removed 10) and now considering 348/362 (removed 14) transitions.
// Phase 1: matrix 348 rows 345 cols
[2024-05-31 23:31:27] [INFO ] Computed 21 invariants in 6 ms
[2024-05-31 23:31:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 23:31:27] [INFO ] Invariant cache hit.
[2024-05-31 23:31:27] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2024-05-31 23:31:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/692 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (OVERLAPS) 1/693 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (OVERLAPS) 0/693 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 693/693 variables, and 366 constraints, problems are : Problem set: 0 solved, 347 unsolved in 19298 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/692 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 347/712 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 1/693 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (OVERLAPS) 0/693 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Int declared 693/693 variables, and 713 constraints, problems are : Problem set: 0 solved, 347 unsolved in 23829 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints]
After SMT, in 43181ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 43185ms
Starting structural reductions in LTL mode, iteration 1 : 345/355 places, 348/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43474 ms. Remains : 345/355 places, 348/362 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 537 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-05 finished in 43811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 16 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-31 23:32:10] [INFO ] Computed 21 invariants in 5 ms
[2024-05-31 23:32:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 23:32:11] [INFO ] Invariant cache hit.
[2024-05-31 23:32:11] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:32:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19245 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22511 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41804ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41808ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42144 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-06
Product exploration explored 100000 steps with 978 reset in 120 ms.
Product exploration explored 100000 steps with 979 reset in 132 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 396 steps (0 resets) in 6 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 23:32:54] [INFO ] Invariant cache hit.
[2024-05-31 23:32:54] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 23:32:54] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 23:32:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:32:54] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 23:32:54] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-31 23:32:54] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 20 ms.
[2024-05-31 23:32:56] [INFO ] Added : 326 causal constraints over 66 iterations in 1718 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 4 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2024-05-31 23:32:56] [INFO ] Invariant cache hit.
[2024-05-31 23:32:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 23:32:56] [INFO ] Invariant cache hit.
[2024-05-31 23:32:56] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:32:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19277 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22650 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41976ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41980ms
Finished structural reductions in LTL mode , in 1 iterations and 42294 ms. Remains : 344/344 places, 346/346 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 396 steps (0 resets) in 8 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 23:33:39] [INFO ] Invariant cache hit.
[2024-05-31 23:33:39] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 23:33:39] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-31 23:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:33:39] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 23:33:39] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-31 23:33:39] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 19 ms.
[2024-05-31 23:33:41] [INFO ] Added : 326 causal constraints over 66 iterations in 1585 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 974 reset in 123 ms.
Product exploration explored 100000 steps with 965 reset in 194 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 281 edges and 344 vertex of which 6 / 344 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 315 transition count 337
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 162 place count 315 transition count 339
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 315 transition count 339
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 300 place count 199 transition count 223
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 416 place count 199 transition count 223
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 435 place count 180 transition count 204
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 454 place count 180 transition count 204
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 520 place count 180 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 522 place count 180 transition count 203
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 569 place count 133 transition count 155
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 616 place count 133 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 617 place count 133 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 618 place count 132 transition count 154
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 619 place count 132 transition count 154
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 639 place count 132 transition count 213
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 677 place count 94 transition count 137
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 715 place count 94 transition count 137
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 769 place count 40 transition count 47
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 823 place count 40 transition count 47
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 823 rules in 84 ms. Remains 40 /344 variables (removed 304) and now considering 47/346 (removed 299) transitions.
[2024-05-31 23:33:41] [INFO ] Redundant transitions in 21 ms returned []
Running 46 sub problems to find dead transitions.
// Phase 1: matrix 47 rows 40 cols
[2024-05-31 23:33:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:33:41] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/85 variables, 39/39 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 8/47 constraints. Problems are: Problem set: 35 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/47 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/86 variables, 1/48 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/48 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/87 variables, 1/49 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/49 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/87 variables, 0/49 constraints. Problems are: Problem set: 35 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 49 constraints, problems are : Problem set: 35 solved, 11 unsolved in 204 ms.
Refiners :[State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 8/8 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/16 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 11/27 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/27 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 33/86 variables, 32/59 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/59 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/60 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/60 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/60 constraints. Problems are: Problem set: 35 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 60 constraints, problems are : Problem set: 35 solved, 11 unsolved in 180 ms.
Refiners :[State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 11/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 35 solved, 11 unsolved
Search for dead transitions found 35 dead transitions in 396ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/344 places, 12/346 transitions.
Graph (complete) has 30 edges and 40 vertex of which 9 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 9 /40 variables (removed 31) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/344 places, 12/346 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 507 ms. Remains : 9/344 places, 12/346 transitions.
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 15 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-31 23:33:42] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 23:33:42] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-31 23:33:42] [INFO ] Invariant cache hit.
[2024-05-31 23:33:42] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:33:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19328 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22589 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41972ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41976ms
Finished structural reductions in LTL mode , in 1 iterations and 42317 ms. Remains : 344/344 places, 346/346 transitions.
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-06 finished in 133798 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||X(X(p1))||G(p2)||F(p3))))'
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 17 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
[2024-05-31 23:34:24] [INFO ] Invariant cache hit.
[2024-05-31 23:34:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 23:34:24] [INFO ] Invariant cache hit.
[2024-05-31 23:34:25] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:34:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19282 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22090 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41426ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41430ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41739 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-08
Product exploration explored 100000 steps with 663 reset in 126 ms.
Product exploration explored 100000 steps with 659 reset in 251 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 (NOT p0)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p0) p2 (NOT p3))), (X (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 84 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (229 resets) in 460 ms. (86 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (25 resets) in 95 ms. (416 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (26 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
[2024-05-31 23:35:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 282/343 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 282/343 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 690/690 variables, and 366 constraints, problems are : Problem set: 1 solved, 0 unsolved in 137 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 (NOT p0)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p0) p2 (NOT p3))), (X (NOT p0)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (G (OR p2 p3 p1))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p3)))), (F (NOT (AND p2 (NOT p3) (NOT p1)))), (F p1), (F p3), (F (NOT p2)), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 11 factoid took 260 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 245 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Support contains 2 out of 344 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 7 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2024-05-31 23:35:08] [INFO ] Invariant cache hit.
[2024-05-31 23:35:08] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 23:35:08] [INFO ] Invariant cache hit.
[2024-05-31 23:35:09] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:35:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19296 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22834 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 42179ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 42182ms
Finished structural reductions in LTL mode , in 1 iterations and 42495 ms. Remains : 344/344 places, 346/346 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (226 resets) in 358 ms. (111 steps per ms) remains 3/6 properties
BEST_FIRST walk for 31835 steps (20 resets) in 77 ms. (408 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1))]
False Knowledge obtained : [(F p3), (F (NOT (AND p2 (NOT p3)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 242 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 249 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 656 reset in 130 ms.
Product exploration explored 100000 steps with 655 reset in 139 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 227 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 280 edges and 344 vertex of which 6 / 344 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 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 315 transition count 337
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 162 place count 315 transition count 339
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 315 transition count 339
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 300 place count 199 transition count 223
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 416 place count 199 transition count 223
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 435 place count 180 transition count 204
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 454 place count 180 transition count 204
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 519 place count 180 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 521 place count 180 transition count 203
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 567 place count 134 transition count 156
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 613 place count 134 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 614 place count 134 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 615 place count 133 transition count 155
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 133 transition count 155
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 636 place count 133 transition count 213
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 673 place count 96 transition count 139
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 710 place count 96 transition count 139
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 761 place count 45 transition count 54
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 812 place count 45 transition count 54
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 812 rules in 45 ms. Remains 45 /344 variables (removed 299) and now considering 54/346 (removed 292) transitions.
[2024-05-31 23:35:53] [INFO ] Redundant transitions in 12 ms returned []
Running 53 sub problems to find dead transitions.
// Phase 1: matrix 54 rows 45 cols
[2024-05-31 23:35:53] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 23:35:53] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/97 variables, 44/44 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 10/54 constraints. Problems are: Problem set: 39 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/54 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/55 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/55 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/99 variables, 1/56 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/56 constraints. Problems are: Problem set: 39 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 56 constraints, problems are : Problem set: 39 solved, 14 unsolved in 270 ms.
Refiners :[State Equation: 45/45 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 52/62 variables, 10/10 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 10/20 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 14/34 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/34 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 36/98 variables, 35/69 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/69 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/70 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/70 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/70 constraints. Problems are: Problem set: 39 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 70 constraints, problems are : Problem set: 39 solved, 14 unsolved in 263 ms.
Refiners :[State Equation: 45/45 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 14/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 545ms problems are : Problem set: 39 solved, 14 unsolved
Search for dead transitions found 39 dead transitions in 545ms
Found 39 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/344 places, 15/346 transitions.
Graph (complete) has 38 edges and 45 vertex of which 11 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 11 /45 variables (removed 34) and now considering 15/15 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/344 places, 15/346 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 612 ms. Remains : 11/344 places, 15/346 transitions.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-31 23:35:53] [INFO ] Computed 21 invariants in 4 ms
[2024-05-31 23:35:54] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 23:35:54] [INFO ] Invariant cache hit.
[2024-05-31 23:35:54] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:35:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19302 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22060 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41408ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41412ms
Finished structural reductions in LTL mode , in 1 iterations and 41734 ms. Remains : 344/344 places, 346/346 transitions.
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-08 finished in 130991 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 G(p1)))||F(p2)))'
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
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 348 transition count 353
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 345 transition count 350
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 345 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 345 transition count 347
Applied a total of 25 rules in 13 ms. Remains 345 /355 variables (removed 10) and now considering 347/362 (removed 15) transitions.
// Phase 1: matrix 347 rows 345 cols
[2024-05-31 23:36:35] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 23:36:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 23:36:35] [INFO ] Invariant cache hit.
[2024-05-31 23:36:35] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-05-31 23:36:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 347/691 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (OVERLAPS) 1/692 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (OVERLAPS) 0/692 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 366 constraints, problems are : Problem set: 0 solved, 346 unsolved in 19420 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 347/691 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 346/711 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (OVERLAPS) 1/692 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (OVERLAPS) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Int declared 692/692 variables, and 712 constraints, problems are : Problem set: 0 solved, 346 unsolved in 24363 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints]
After SMT, in 43830ms problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 43833ms
Starting structural reductions in LTL mode, iteration 1 : 345/355 places, 347/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44096 ms. Remains : 345/355 places, 347/362 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-09
Product exploration explored 100000 steps with 582 reset in 226 ms.
Product exploration explored 100000 steps with 581 reset in 197 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Graph (complete) has 536 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 64 stable transitions
Detected a total of 64/345 stabilizing places and 64/347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), (X p1), (X (AND (NOT p2) p1 (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 181 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 34688 steps (197 resets) in 233 ms. (148 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), (X p1), (X (AND (NOT p2) p1 (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) p1))), (F p2)]
Knowledge based reduction with 18 factoid took 329 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 345 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 347/347 transitions.
Applied a total of 0 rules in 9 ms. Remains 345 /345 variables (removed 0) and now considering 347/347 (removed 0) transitions.
[2024-05-31 23:37:21] [INFO ] Invariant cache hit.
[2024-05-31 23:37:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 23:37:21] [INFO ] Invariant cache hit.
[2024-05-31 23:37:21] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-05-31 23:37:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 347/691 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (OVERLAPS) 1/692 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (OVERLAPS) 0/692 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 366 constraints, problems are : Problem set: 0 solved, 346 unsolved in 19361 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 347/691 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 346/711 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (OVERLAPS) 1/692 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (OVERLAPS) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Int declared 692/692 variables, and 712 constraints, problems are : Problem set: 0 solved, 346 unsolved in 24989 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints]
After SMT, in 44397ms problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 44400ms
Finished structural reductions in LTL mode , in 1 iterations and 44655 ms. Remains : 345/345 places, 347/347 transitions.
Computed a total of 64 stabilizing places and 64 stable transitions
Graph (complete) has 536 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Computed a total of 64 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 19268 steps (109 resets) in 256 ms. (74 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F p2)]
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering criterion allowed to conclude after 55338 steps with 319 reset in 106 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-09 finished in 91670 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))&&F((G(F(p1))||(p2&&F(p1))))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 295 edges and 355 vertex of which 6 / 355 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 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 325 transition count 184
Reduce places removed 168 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 176 rules applied. Total rules applied 346 place count 157 transition count 176
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 350 place count 154 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 351 place count 153 transition count 175
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 351 place count 153 transition count 134
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 433 place count 112 transition count 134
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 453 place count 92 transition count 114
Iterating global reduction 4 with 20 rules applied. Total rules applied 473 place count 92 transition count 114
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 591 place count 33 transition count 55
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 608 place count 16 transition count 21
Iterating global reduction 4 with 17 rules applied. Total rules applied 625 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 629 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 630 place count 13 transition count 19
Applied a total of 630 rules in 25 ms. Remains 13 /355 variables (removed 342) and now considering 19/362 (removed 343) transitions.
[2024-05-31 23:38:07] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-31 23:38:07] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:38:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 23:38:07] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-31 23:38:07] [INFO ] Invariant cache hit.
[2024-05-31 23:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:38:07] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-31 23:38:07] [INFO ] Redundant transitions in 10 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-31 23:38:07] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-31 23:38:07] [INFO ] Invariant cache hit.
[2024-05-31 23:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 127 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 121 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 255ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/355 places, 19/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 13/355 places, 19/362 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-10
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-10 finished in 538 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)&&(p0||G((p1||X(G(p0))))))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 16 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-31 23:38:07] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 23:38:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 23:38:08] [INFO ] Invariant cache hit.
[2024-05-31 23:38:08] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:38:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19325 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22511 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41882ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41886ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42224 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), false, true]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-11
Stuttering criterion allowed to conclude after 171 steps with 1 reset in 5 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-11 finished in 42425 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 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 297 edges and 355 vertex of which 6 / 355 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 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 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 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 325 transition count 181
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 180 rules applied. Total rules applied 353 place count 154 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 356 place count 151 transition count 172
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 356 place count 151 transition count 129
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 442 place count 108 transition count 129
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 462 place count 88 transition count 109
Iterating global reduction 3 with 20 rules applied. Total rules applied 482 place count 88 transition count 109
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 602 place count 28 transition count 49
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 620 place count 10 transition count 13
Iterating global reduction 3 with 18 rules applied. Total rules applied 638 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 3 with 2 rules applied. Total rules applied 640 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 641 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 8 transition count 11
Applied a total of 642 rules in 16 ms. Remains 8 /355 variables (removed 347) and now considering 11/362 (removed 351) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-31 23:38:50] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:38:50] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 23:38:50] [INFO ] Invariant cache hit.
[2024-05-31 23:38:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:38:50] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-31 23:38:50] [INFO ] Redundant transitions in 9 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-31 23:38:50] [INFO ] Invariant cache hit.
[2024-05-31 23:38:50] [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) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 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) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/355 places, 11/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 8/355 places, 11/362 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-12 finished in 256 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(F(p0))||G(p1))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 296 edges and 355 vertex of which 6 / 355 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 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 325 transition count 182
Reduce places removed 170 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 177 rules applied. Total rules applied 349 place count 155 transition count 175
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 352 place count 153 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 353 place count 152 transition count 174
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 353 place count 152 transition count 130
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 441 place count 108 transition count 130
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 460 place count 89 transition count 111
Iterating global reduction 4 with 19 rules applied. Total rules applied 479 place count 89 transition count 111
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 597 place count 30 transition count 52
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 616 place count 11 transition count 14
Iterating global reduction 4 with 19 rules applied. Total rules applied 635 place count 11 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 637 place count 9 transition count 12
Applied a total of 637 rules in 21 ms. Remains 9 /355 variables (removed 346) and now considering 12/362 (removed 350) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-31 23:38:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:38:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 23:38:50] [INFO ] Invariant cache hit.
[2024-05-31 23:38:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:38:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-31 23:38:50] [INFO ] Redundant transitions in 13 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-31 23:38:50] [INFO ] Invariant cache hit.
[2024-05-31 23:38:50] [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) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 8 unsolved in 55 ms.
Refiners :[State Equation: 9/9 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) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 55 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/355 places, 12/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 9/355 places, 12/362 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-13
Stuttering criterion allowed to conclude after 46 steps with 6 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-13 finished in 273 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||G(p1)))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 14 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-31 23:38:50] [INFO ] Computed 21 invariants in 4 ms
[2024-05-31 23:38:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 23:38:50] [INFO ] Invariant cache hit.
[2024-05-31 23:38:51] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-31 23:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 18957 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22442 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41446ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41450ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41783 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-14
Product exploration explored 100000 steps with 1422 reset in 138 ms.
Product exploration explored 100000 steps with 1475 reset in 180 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (220 resets) in 128 ms. (310 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (25 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-05-31 23:39:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 292/343 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 292/343 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/690 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/690 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8087 steps, including 94 resets, run visited all 1 properties in 18 ms. (steps per millisecond=449 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-31 23:39:34] [INFO ] Invariant cache hit.
[2024-05-31 23:39:34] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-31 23:39:34] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-31 23:39:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:39:34] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 23:39:34] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-31 23:39:34] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 19 ms.
[2024-05-31 23:39:36] [INFO ] Added : 316 causal constraints over 64 iterations in 1525 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 279 edges and 344 vertex of which 6 / 344 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 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 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 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 314 transition count 177
Reduce places removed 159 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 160 rules applied. Total rules applied 321 place count 155 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 154 transition count 176
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 322 place count 154 transition count 133
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 408 place count 111 transition count 133
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 427 place count 92 transition count 114
Iterating global reduction 3 with 19 rules applied. Total rules applied 446 place count 92 transition count 114
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 568 place count 31 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 31 transition count 52
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 587 place count 13 transition count 17
Iterating global reduction 4 with 18 rules applied. Total rules applied 605 place count 13 transition count 17
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 607 place count 12 transition count 16
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 608 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 609 place count 11 transition count 15
Applied a total of 609 rules in 15 ms. Remains 11 /344 variables (removed 333) and now considering 15/346 (removed 331) transitions.
[2024-05-31 23:39:36] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 11 cols
[2024-05-31 23:39:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:39:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-31 23:39:36] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-31 23:39:36] [INFO ] Invariant cache hit.
[2024-05-31 23:39:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:39:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-31 23:39:36] [INFO ] Redundant transitions in 10 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-31 23:39:36] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-31 23:39:36] [INFO ] Invariant cache hit.
[2024-05-31 23:39:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/344 places, 15/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 11/344 places, 15/346 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/11 stabilizing places and 7/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 616 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 243 steps (20 resets) in 7 ms. (30 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 820 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-31 23:39:38] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-31 23:39:38] [INFO ] Invariant cache hit.
[2024-05-31 23:39:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-31 23:39:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:39:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-31 23:39:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:39:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 23:39:38] [INFO ] Computed and/alt/rep : 9/21/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 23:39:38] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-14 finished in 47931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||G(p2))))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 349 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 349 transition count 356
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 346 transition count 353
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 346 transition count 353
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 346 transition count 350
Applied a total of 21 rules in 17 ms. Remains 346 /355 variables (removed 9) and now considering 350/362 (removed 12) transitions.
// Phase 1: matrix 350 rows 346 cols
[2024-05-31 23:39:38] [INFO ] Computed 21 invariants in 4 ms
[2024-05-31 23:39:38] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 23:39:38] [INFO ] Invariant cache hit.
[2024-05-31 23:39:39] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-05-31 23:39:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/695 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 1/696 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (OVERLAPS) 0/696 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 367 constraints, problems are : Problem set: 0 solved, 349 unsolved in 19873 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/695 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 349/715 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (OVERLAPS) 1/696 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 7 (OVERLAPS) 0/696 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
No progress, stopping.
After SMT solving in domain Int declared 696/696 variables, and 716 constraints, problems are : Problem set: 0 solved, 349 unsolved in 24883 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints]
After SMT, in 44803ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 44807ms
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 350/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45092 ms. Remains : 346/355 places, 350/362 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-15
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-15 finished in 45222 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))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-20b-LTLFireability-06
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 297 edges and 355 vertex of which 6 / 355 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 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 325 transition count 183
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 178 rules applied. Total rules applied 349 place count 156 transition count 174
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 353 place count 153 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 354 place count 152 transition count 173
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 354 place count 152 transition count 130
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 440 place count 109 transition count 130
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 460 place count 89 transition count 110
Iterating global reduction 4 with 20 rules applied. Total rules applied 480 place count 89 transition count 110
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 602 place count 28 transition count 49
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 620 place count 10 transition count 13
Iterating global reduction 4 with 18 rules applied. Total rules applied 638 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 640 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 641 place count 8 transition count 11
Applied a total of 641 rules in 20 ms. Remains 8 /355 variables (removed 347) and now considering 11/362 (removed 351) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-31 23:40:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:40:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 23:40:24] [INFO ] Invariant cache hit.
[2024-05-31 23:40:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:40:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-05-31 23:40:24] [INFO ] Invariant cache hit.
[2024-05-31 23:40:24] [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 52 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 54 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Starting structural reductions in LI_LTL mode, iteration 1 : 8/355 places, 11/362 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 174 ms. Remains : 8/355 places, 11/362 transitions.
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-06 finished in 395 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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||X(X(p1))||G(p2)||F(p3))))'
[2024-05-31 23:40:24] [INFO ] Flatten gal took : 15 ms
[2024-05-31 23:40:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 23:40:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 355 places, 362 transitions and 925 arcs took 4 ms.
Total runtime 754214 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA GPUForwardProgress-PT-20b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPUForwardProgress-PT-20b-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717198867184

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name GPUForwardProgress-PT-20b-LTLFireability-06
ltl formula formula --ltl=/tmp/1985/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 355 places, 362 transitions and 925 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1985/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1985/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1985/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1985/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 356, there are 366 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 57
pnml2lts-mc( 0/ 4): unique states count: 422
pnml2lts-mc( 0/ 4): unique transitions count: 2359
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 435
pnml2lts-mc( 0/ 4): - cum. max stack depth: 378
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 435 states 2387 transitions, fanout: 5.487
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 21750, Transitions per second: 119350
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 25.2 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 365 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-20b-LTLFireability-08
ltl formula formula --ltl=/tmp/1985/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 355 places, 362 transitions and 925 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1985/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1985/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1985/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1985/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 357 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 356, there are 431 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~167 levels ~10000 states ~24444 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~20000 states ~50212 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~40000 states ~103096 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~80000 states ~221592 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~160000 states ~455248 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~320000 states ~983312 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~640000 states ~2050896 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~1280000 states ~4398968 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~2560000 states ~9153988 transitions
pnml2lts-mc( 0/ 4): ~167 levels ~5120000 states ~18519544 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~3120!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7367349
pnml2lts-mc( 0/ 4): unique states count: 7371114
pnml2lts-mc( 0/ 4): unique transitions count: 30864611
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 23475187
pnml2lts-mc( 0/ 4): - claim found count: 3800
pnml2lts-mc( 0/ 4): - claim success count: 7371123
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3622
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7371123 states 30864645 transitions, fanout: 4.187
pnml2lts-mc( 0/ 4): Total exploration time 42.000 sec (42.000 sec minimum, 42.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: 175503, Transitions per second: 734872
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 63.6MB, 9.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/11.0%
pnml2lts-mc( 0/ 4): Stored 365 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 63.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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