Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576200404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-28b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576200404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 7.2K Apr 29 12:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 12:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 141K May 10 09:34 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-28b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652732332255

Running Version 202205111006
[2022-05-16 20:18:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 20:18:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 20:18:54] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2022-05-16 20:18:54] [INFO ] Transformed 568 places.
[2022-05-16 20:18:54] [INFO ] Transformed 597 transitions.
[2022-05-16 20:18:54] [INFO ] Found NUPN structural information;
[2022-05-16 20:18:54] [INFO ] Parsed PT model containing 568 places and 597 transitions in 377 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 56 place count 512 transition count 542
Iterating global reduction 1 with 55 rules applied. Total rules applied 111 place count 512 transition count 542
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 135 place count 488 transition count 518
Iterating global reduction 1 with 24 rules applied. Total rules applied 159 place count 488 transition count 518
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 181 place count 488 transition count 496
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 182 place count 487 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 487 transition count 495
Applied a total of 183 rules in 183 ms. Remains 487 /568 variables (removed 81) and now considering 495/597 (removed 102) transitions.
// Phase 1: matrix 495 rows 487 cols
[2022-05-16 20:18:55] [INFO ] Computed 29 place invariants in 48 ms
[2022-05-16 20:18:55] [INFO ] Implicit Places using invariants in 668 ms returned []
// Phase 1: matrix 495 rows 487 cols
[2022-05-16 20:18:55] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-16 20:18:56] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
// Phase 1: matrix 495 rows 487 cols
[2022-05-16 20:18:56] [INFO ] Computed 29 place invariants in 6 ms
[2022-05-16 20:18:56] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 487/568 places, 495/597 transitions.
Finished structural reductions, in 1 iterations. Remains : 487/568 places, 495/597 transitions.
Support contains 39 out of 487 places after structural reductions.
[2022-05-16 20:18:57] [INFO ] Flatten gal took : 106 ms
[2022-05-16 20:18:57] [INFO ] Flatten gal took : 52 ms
[2022-05-16 20:18:57] [INFO ] Input system was already deterministic with 495 transitions.
Support contains 37 out of 487 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 924 ms. (steps per millisecond=10 ) properties (out of 40) seen :30
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 495 rows 487 cols
[2022-05-16 20:18:59] [INFO ] Computed 29 place invariants in 5 ms
[2022-05-16 20:18:59] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 25 ms returned sat
[2022-05-16 20:19:00] [INFO ] After 616ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:6
[2022-05-16 20:19:00] [INFO ] After 883ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-16 20:19:00] [INFO ] After 1440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-16 20:19:00] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 19 ms returned sat
[2022-05-16 20:19:01] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-16 20:19:01] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 237 ms.
[2022-05-16 20:19:02] [INFO ] After 1747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 127 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 10 properties in 80 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 92 stabilizing places and 92 stable transitions
Graph (complete) has 756 edges and 487 vertex of which 455 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.22 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(F((G(!p0)||p1))))||!p0)))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Graph (trivial) has 404 edges and 487 vertex of which 6 / 487 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 750 edges and 482 vertex of which 450 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 449 transition count 250
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 245 rules applied. Total rules applied 482 place count 214 transition count 240
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 487 place count 211 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 489 place count 209 transition count 238
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 489 place count 209 transition count 180
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 605 place count 151 transition count 180
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 633 place count 123 transition count 152
Iterating global reduction 4 with 28 rules applied. Total rules applied 661 place count 123 transition count 152
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 831 place count 38 transition count 67
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 856 place count 13 transition count 17
Iterating global reduction 4 with 25 rules applied. Total rules applied 881 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 883 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 884 place count 11 transition count 15
Applied a total of 884 rules in 68 ms. Remains 11 /487 variables (removed 476) and now considering 15/495 (removed 480) transitions.
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 20:19:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 20:19:03] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 20:19:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 20:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 20:19:03] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-16 20:19:03] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 15 rows 11 cols
[2022-05-16 20:19:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 20:19:03] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/487 places, 15/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/487 places, 15/495 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s4 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-00 finished in 541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U G(p1))&&F(p2)))&&X(F(G(p0)))))'
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 478 transition count 486
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 478 transition count 486
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 478 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 474 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 474 transition count 480
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 474 transition count 476
Applied a total of 32 rules in 84 ms. Remains 474 /487 variables (removed 13) and now considering 476/495 (removed 19) transitions.
// Phase 1: matrix 476 rows 474 cols
[2022-05-16 20:19:03] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:03] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 476 rows 474 cols
[2022-05-16 20:19:03] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-16 20:19:04] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
// Phase 1: matrix 476 rows 474 cols
[2022-05-16 20:19:04] [INFO ] Computed 29 place invariants in 5 ms
[2022-05-16 20:19:04] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 474/487 places, 476/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 474/487 places, 476/495 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 5}, { cond=(OR p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s332 1), p0:(EQ s290 1), p2:(EQ s472 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-01 finished in 1554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1))))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 476 transition count 484
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 476 transition count 484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 476 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 472 transition count 478
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 472 transition count 474
Applied a total of 36 rules in 40 ms. Remains 472 /487 variables (removed 15) and now considering 474/495 (removed 21) transitions.
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:04] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:05] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:05] [INFO ] Computed 29 place invariants in 6 ms
[2022-05-16 20:19:05] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:05] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 20:19:06] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/487 places, 474/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/487 places, 474/495 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s172 0), p1:(EQ s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 417 reset in 497 ms.
Stack based approach found an accepted trace after 8992 steps with 33 reset with depth 374 and stack size 374 in 39 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-02 finished in 2026 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||X((F(p1)||G(p1))))))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 476 transition count 484
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 476 transition count 484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 476 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 472 transition count 478
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 472 transition count 474
Applied a total of 36 rules in 50 ms. Remains 472 /487 variables (removed 15) and now considering 474/495 (removed 21) transitions.
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:07] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 20:19:07] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:07] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 20:19:07] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:07] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 20:19:08] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/487 places, 474/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/487 places, 474/495 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s335 1), p0:(AND (EQ s335 1) (EQ s446 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-03 finished in 1304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 476 transition count 484
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 476 transition count 484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 476 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 472 transition count 478
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 472 transition count 474
Applied a total of 36 rules in 56 ms. Remains 472 /487 variables (removed 15) and now considering 474/495 (removed 21) transitions.
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:08] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:08] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:08] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:09] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:09] [INFO ] Computed 29 place invariants in 4 ms
[2022-05-16 20:19:09] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/487 places, 474/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/487 places, 474/495 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s355 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-04 finished in 1596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((F(p1)&&p0))))'
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 477 transition count 485
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 477 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 477 transition count 483
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 473 transition count 479
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 473 transition count 479
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 473 transition count 475
Applied a total of 34 rules in 39 ms. Remains 473 /487 variables (removed 14) and now considering 475/495 (removed 20) transitions.
// Phase 1: matrix 475 rows 473 cols
[2022-05-16 20:19:09] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:10] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 475 rows 473 cols
[2022-05-16 20:19:10] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:10] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
// Phase 1: matrix 475 rows 473 cols
[2022-05-16 20:19:10] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 20:19:11] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/487 places, 475/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/487 places, 475/495 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s227 1), p1:(EQ s216 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-05 finished in 1702 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 477 transition count 485
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 477 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 477 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 474 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 474 transition count 477
Applied a total of 31 rules in 63 ms. Remains 474 /487 variables (removed 13) and now considering 477/495 (removed 18) transitions.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:11] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:11] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:11] [INFO ] Computed 29 place invariants in 5 ms
[2022-05-16 20:19:12] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:12] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:12] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 474/487 places, 477/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 474/487 places, 477/495 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-06 finished in 1205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||(X(p1)&&p2)))))'
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 477 transition count 485
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 477 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 477 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 473 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 473 transition count 480
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 33 place count 473 transition count 476
Applied a total of 33 rules in 73 ms. Remains 473 /487 variables (removed 14) and now considering 476/495 (removed 19) transitions.
// Phase 1: matrix 476 rows 473 cols
[2022-05-16 20:19:12] [INFO ] Computed 29 place invariants in 4 ms
[2022-05-16 20:19:13] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 476 rows 473 cols
[2022-05-16 20:19:13] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:13] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
// Phase 1: matrix 476 rows 473 cols
[2022-05-16 20:19:13] [INFO ] Computed 29 place invariants in 4 ms
[2022-05-16 20:19:14] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/487 places, 476/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/487 places, 476/495 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s151 1), p2:(OR (EQ s410 0) (EQ s460 0) (EQ s471 0)), p1:(OR (EQ s399 0) (EQ s460 0) (EQ s471 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 965 steps with 4 reset in 6 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-08 finished in 1534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U F((X(p2)&&p1)))||X(F(p3))))'
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 478 transition count 486
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 478 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 478 transition count 485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 475 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 475 transition count 482
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 475 transition count 479
Applied a total of 28 rules in 35 ms. Remains 475 /487 variables (removed 12) and now considering 479/495 (removed 16) transitions.
// Phase 1: matrix 479 rows 475 cols
[2022-05-16 20:19:14] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 20:19:14] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 479 rows 475 cols
[2022-05-16 20:19:14] [INFO ] Computed 29 place invariants in 4 ms
[2022-05-16 20:19:15] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
// Phase 1: matrix 479 rows 475 cols
[2022-05-16 20:19:15] [INFO ] Computed 29 place invariants in 5 ms
[2022-05-16 20:19:15] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 475/487 places, 479/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 475/487 places, 479/495 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p3) p1 p2), (AND (NOT p3) p1 p2), (AND p2 (NOT p3)), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s169 1) (EQ s462 1) (EQ s473 1)), p3:(EQ s397 0), p2:(AND (NOT (AND (EQ s169 1) (EQ s462 1) (EQ s473 1))) (EQ s408 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1033 ms.
Product exploration explored 100000 steps with 50000 reset in 587 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 740 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.8 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p3))
Knowledge based reduction with 12 factoid took 235 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-09 finished in 3520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||X((X((F(p1) U p2))||p0)))))'
Support contains 2 out of 487 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 477 transition count 485
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 477 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 477 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 474 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 474 transition count 477
Applied a total of 31 rules in 34 ms. Remains 474 /487 variables (removed 13) and now considering 477/495 (removed 18) transitions.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:17] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 20:19:18] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:18] [INFO ] Computed 29 place invariants in 6 ms
[2022-05-16 20:19:18] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:18] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:19] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 474/487 places, 477/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 474/487 places, 477/495 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s180 1), p2:(EQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-10 finished in 1580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(F((p0&&(!(p1 U p2)||p3))))))))'
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Graph (trivial) has 402 edges and 487 vertex of which 6 / 487 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 750 edges and 482 vertex of which 450 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 236 place count 449 transition count 251
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 244 rules applied. Total rules applied 480 place count 215 transition count 241
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 484 place count 212 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 485 place count 211 transition count 240
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 485 place count 211 transition count 181
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 603 place count 152 transition count 181
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 631 place count 124 transition count 153
Iterating global reduction 4 with 28 rules applied. Total rules applied 659 place count 124 transition count 153
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 823 place count 42 transition count 71
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 848 place count 17 transition count 21
Iterating global reduction 4 with 25 rules applied. Total rules applied 873 place count 17 transition count 21
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 875 place count 16 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 876 place count 15 transition count 19
Applied a total of 876 rules in 86 ms. Remains 15 /487 variables (removed 472) and now considering 19/495 (removed 476) transitions.
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 20:19:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 20:19:19] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 20:19:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 20:19:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 20:19:19] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-16 20:19:19] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 19 rows 15 cols
[2022-05-16 20:19:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 20:19:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/487 places, 19/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/487 places, 19/495 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (OR (AND (NOT p0) p2) (AND p2 (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p3) p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p3) p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p3) p1 (NOT p2))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s8 0), p3:(EQ s11 0), p2:(EQ s1 1), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-12 finished in 479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))&&X(G((X(p1)&&F(p2))))))'
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 476 transition count 484
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 476 transition count 484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 476 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 472 transition count 478
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 472 transition count 474
Applied a total of 36 rules in 38 ms. Remains 472 /487 variables (removed 15) and now considering 474/495 (removed 21) transitions.
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:19] [INFO ] Computed 29 place invariants in 5 ms
[2022-05-16 20:19:20] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:20] [INFO ] Computed 29 place invariants in 4 ms
[2022-05-16 20:19:20] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 472 cols
[2022-05-16 20:19:20] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 20:19:21] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/487 places, 474/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/487 places, 474/495 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s412 1), p0:(EQ s84 1), p2:(EQ s380 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-13 finished in 1785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((!(p0 U !G(p1))&&(p2||(X(p2)&&p3))))))'
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Graph (trivial) has 402 edges and 487 vertex of which 6 / 487 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 750 edges and 482 vertex of which 450 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 239 place count 449 transition count 248
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 247 rules applied. Total rules applied 486 place count 212 transition count 238
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 489 place count 209 transition count 238
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 489 place count 209 transition count 180
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 605 place count 151 transition count 180
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 632 place count 124 transition count 153
Iterating global reduction 3 with 27 rules applied. Total rules applied 659 place count 124 transition count 153
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 825 place count 41 transition count 70
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 851 place count 15 transition count 18
Iterating global reduction 3 with 26 rules applied. Total rules applied 877 place count 15 transition count 18
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 3 with 4 rules applied. Total rules applied 881 place count 13 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 882 place count 12 transition count 16
Applied a total of 882 rules in 45 ms. Remains 12 /487 variables (removed 475) and now considering 16/495 (removed 479) transitions.
[2022-05-16 20:19:21] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 12 cols
[2022-05-16 20:19:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 20:19:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-16 20:19:21] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 12 cols
[2022-05-16 20:19:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 20:19:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 20:19:21] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-16 20:19:21] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-16 20:19:21] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 12 cols
[2022-05-16 20:19:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 20:19:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/487 places, 16/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/487 places, 16/495 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) (NOT p2)) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 p1) (AND p1 p2)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 0}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(OR (EQ s3 0) (EQ s9 0) (EQ s11 0)), p2:(EQ s6 0), p1:(AND (EQ s3 1) (EQ s9 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-14 finished in 369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((((G(p0) U p1) U p2)||G(X(p3)))))))'
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 495/495 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 477 transition count 485
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 477 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 477 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 474 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 474 transition count 477
Applied a total of 31 rules in 37 ms. Remains 474 /487 variables (removed 13) and now considering 477/495 (removed 18) transitions.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:22] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-16 20:19:22] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:22] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:22] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:22] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:23] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 474/487 places, 477/495 transitions.
Finished structural reductions, in 1 iterations. Remains : 474/487 places, 477/495 transitions.
Stuttering acceptance computed with spot in 471 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 5}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p2 (NOT p0) p3) (AND p1 (NOT p0) p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 p0 p3) (AND p1 p0 p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p2 (NOT p1) p0 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 8}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(EQ s40 1), p1:(NEQ s82 1), p0:(EQ s43 1), p3:(EQ s43 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24987 reset in 402 ms.
Product exploration explored 100000 steps with 25057 reset in 404 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.6 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/474 stabilizing places and 87/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) p3), (X (OR p2 p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X p3)), (X (X (OR p2 p1 p0))), (X (X (OR (AND p2 (NOT p0) p3) (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND p2 p0 p3) (AND p1 p0 p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3)))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1804 ms. Reduced automaton from 10 states, 28 edges and 4 AP to 10 states, 28 edges and 4 AP.
Stuttering acceptance computed with spot in 548 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 17) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:27] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 20:19:28] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 23 ms returned sat
[2022-05-16 20:19:28] [INFO ] After 319ms SMT Verify possible using state equation in real domain returned unsat :2 sat :4 real:5
[2022-05-16 20:19:28] [INFO ] After 470ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :4 real:5
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-16 20:19:28] [INFO ] After 847ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :4 real:5
[2022-05-16 20:19:28] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 20 ms returned sat
[2022-05-16 20:19:29] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2022-05-16 20:19:29] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 138 ms.
[2022-05-16 20:19:29] [INFO ] After 1010ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :7
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 477/477 transitions.
Graph (trivial) has 384 edges and 474 vertex of which 6 / 474 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 731 edges and 469 vertex of which 437 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 225 rules applied. Total rules applied 227 place count 437 transition count 242
Reduce places removed 223 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 224 rules applied. Total rules applied 451 place count 214 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 452 place count 213 transition count 241
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 452 place count 213 transition count 183
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 568 place count 155 transition count 183
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 597 place count 126 transition count 154
Iterating global reduction 3 with 29 rules applied. Total rules applied 626 place count 126 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 626 place count 126 transition count 153
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 628 place count 125 transition count 153
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 798 place count 40 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 107 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 800 place count 39 transition count 67
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 802 place count 39 transition count 65
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 827 place count 14 transition count 15
Iterating global reduction 5 with 25 rules applied. Total rules applied 852 place count 14 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 857 place count 11 transition count 13
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 14 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 860 place count 10 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 861 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 862 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 865 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 866 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 866 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 868 place count 6 transition count 6
Applied a total of 868 rules in 47 ms. Remains 6 /474 variables (removed 468) and now considering 6/477 (removed 471) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/474 places, 6/477 transitions.
Finished random walk after 3336 steps, including 1 resets, run visited all 7 properties in 34 ms. (steps per millisecond=98 )
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) p3), (X (OR p2 p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X p3)), (X (X (OR p2 p1 p0))), (X (X (OR (AND p2 (NOT p0) p3) (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND p2 p0 p3) (AND p1 p0 p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3)))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) p3 p0 p2))), (G (NOT (OR (AND p1 p3 p0) (AND p3 p0 p2)))), (G (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p3) p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p0))), (F p0), (F (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (F (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p3) p0 (NOT p2)))), (F (NOT (OR (AND p1 p3 (NOT p0)) (AND p3 (NOT p0) p2)))), (F (AND (NOT p1) (NOT p3) p0 (NOT p2))), (F (NOT (OR p1 p0 p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p3) p0))]
Knowledge based reduction with 25 factoid took 2377 ms. Reduced automaton from 10 states, 28 edges and 4 AP to 9 states, 23 edges and 4 AP.
Stuttering acceptance computed with spot in 519 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p1), (OR (NOT p2) (AND p0 p3))]
Stuttering acceptance computed with spot in 452 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p1), (OR (NOT p2) (AND p0 p3))]
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Applied a total of 0 rules in 20 ms. Remains 474 /474 variables (removed 0) and now considering 477/477 (removed 0) transitions.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:33] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:33] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:33] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:33] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:34] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-16 20:19:34] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 477/477 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.12 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/474 stabilizing places and 87/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 p3))), (X (OR p1 p0 p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 p3)))), (X (X (OR p1 p0 p2))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1435 ms. Reduced automaton from 9 states, 23 edges and 4 AP to 9 states, 23 edges and 4 AP.
Stuttering acceptance computed with spot in 583 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p1), (OR (NOT p2) (AND p0 p3))]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:37] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 20:19:37] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 28 ms returned sat
[2022-05-16 20:19:37] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-16 20:19:38] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 20 ms returned sat
[2022-05-16 20:19:38] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-16 20:19:38] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-05-16 20:19:38] [INFO ] After 723ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 95 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=7 )
Parikh walk visited 3 properties in 11 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 p3))), (X (OR p1 p0 p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)) (AND p0 p3)))), (X (X (OR p1 p0 p2))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p3) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p3) (NOT p2))), (F (NOT p3)), (F (NOT (OR (AND p1 (NOT p2)) (AND p3 p0) (AND p0 (NOT p2))))), (F (OR (AND p1 (NOT p3)) (AND (NOT p3) p2))), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (F (AND (NOT p1) p0)), (F (NOT (OR p1 p0 p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 18 factoid took 1757 ms. Reduced automaton from 9 states, 23 edges and 4 AP to 9 states, 22 edges and 4 AP.
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (AND (NOT p1) p2), (OR (NOT p2) (AND p0 p3))]
Stuttering acceptance computed with spot in 493 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (AND (NOT p1) p2), (OR (NOT p2) (AND p0 p3))]
Stuttering acceptance computed with spot in 463 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (AND (NOT p1) p2), (OR (NOT p2) (AND p0 p3))]
Product exploration explored 100000 steps with 24967 reset in 362 ms.
Product exploration explored 100000 steps with 25094 reset in 381 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (AND (NOT p1) p2), (OR (NOT p2) (AND p0 p3))]
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Graph (trivial) has 384 edges and 474 vertex of which 6 / 474 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 732 edges and 469 vertex of which 437 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 223 rules applied. Total rules applied 225 place count 437 transition count 468
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 225 place count 437 transition count 470
Deduced a syphon composed of 253 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 255 place count 437 transition count 470
Discarding 164 places :
Symmetric choice reduction at 1 with 164 rule applications. Total rules 419 place count 273 transition count 306
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 164 rules applied. Total rules applied 583 place count 273 transition count 306
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 610 place count 246 transition count 279
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 637 place count 246 transition count 279
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 177 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 725 place count 246 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 727 place count 246 transition count 278
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 788 place count 185 transition count 216
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 849 place count 185 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 850 place count 185 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 851 place count 184 transition count 215
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 852 place count 184 transition count 215
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -87
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 881 place count 184 transition count 302
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 934 place count 131 transition count 196
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 2 with 53 rules applied. Total rules applied 987 place count 131 transition count 196
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1062 place count 56 transition count 71
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 1137 place count 56 transition count 71
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 1137 rules in 149 ms. Remains 56 /474 variables (removed 418) and now considering 71/477 (removed 406) transitions.
[2022-05-16 20:19:43] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-16 20:19:43] [INFO ] Flow matrix only has 70 transitions (discarded 1 similar events)
// Phase 1: matrix 70 rows 56 cols
[2022-05-16 20:19:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 20:19:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/474 places, 71/477 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/474 places, 71/477 transitions.
Product exploration explored 100000 steps with 24978 reset in 568 ms.
Product exploration explored 100000 steps with 25042 reset in 468 ms.
Built C files in :
/tmp/ltsmin2387147253698929231
[2022-05-16 20:19:44] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2387147253698929231
Running compilation step : cd /tmp/ltsmin2387147253698929231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1385 ms.
Running link step : cd /tmp/ltsmin2387147253698929231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2387147253698929231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5354582931607493456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Applied a total of 0 rules in 11 ms. Remains 474 /474 variables (removed 0) and now considering 477/477 (removed 0) transitions.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:19:59] [INFO ] Computed 29 place invariants in 6 ms
[2022-05-16 20:20:00] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:20:00] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-16 20:20:00] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
// Phase 1: matrix 477 rows 474 cols
[2022-05-16 20:20:00] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-16 20:20:00] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 477/477 transitions.
Built C files in :
/tmp/ltsmin18357311403210183023
[2022-05-16 20:20:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18357311403210183023
Running compilation step : cd /tmp/ltsmin18357311403210183023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1146 ms.
Running link step : cd /tmp/ltsmin18357311403210183023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18357311403210183023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased209013767174405270.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 20:20:16] [INFO ] Flatten gal took : 35 ms
[2022-05-16 20:20:16] [INFO ] Flatten gal took : 33 ms
[2022-05-16 20:20:16] [INFO ] Time to serialize gal into /tmp/LTL1396311811143392332.gal : 11 ms
[2022-05-16 20:20:16] [INFO ] Time to serialize properties into /tmp/LTL10567169639618405185.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1396311811143392332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10567169639618405185.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1396311...267
Read 1 LTL properties
Checking formula 0 : !((G(X(G((((G("(p46==1)"))U("(p91!=1)"))U("(p42==1)"))||(G(X("(p46==0)"))))))))
Formula 0 simplified : !GXG(((G"(p46==1)" U "(p91!=1)") U "(p42==1)") | GX"(p46==0)")
Detected timeout of ITS tools.
[2022-05-16 20:20:31] [INFO ] Flatten gal took : 29 ms
[2022-05-16 20:20:31] [INFO ] Applying decomposition
[2022-05-16 20:20:31] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13021489327727840763.txt' '-o' '/tmp/graph13021489327727840763.bin' '-w' '/tmp/graph13021489327727840763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13021489327727840763.bin' '-l' '-1' '-v' '-w' '/tmp/graph13021489327727840763.weights' '-q' '0' '-e' '0.001'
[2022-05-16 20:20:31] [INFO ] Decomposing Gal with order
[2022-05-16 20:20:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 20:20:31] [INFO ] Removed a total of 147 redundant transitions.
[2022-05-16 20:20:31] [INFO ] Flatten gal took : 189 ms
[2022-05-16 20:20:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-16 20:20:31] [INFO ] Time to serialize gal into /tmp/LTL3155074440416079920.gal : 24 ms
[2022-05-16 20:20:31] [INFO ] Time to serialize properties into /tmp/LTL13770057705579896273.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3155074440416079920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13770057705579896273.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3155074...246
Read 1 LTL properties
Checking formula 0 : !((G(X(G((((G("(i2.u18.p46==1)"))U("(i4.u33.p91!=1)"))U("(i2.u15.p42==1)"))||(G(X("(i2.u18.p46==0)"))))))))
Formula 0 simplified : !GXG(((G"(i2.u18.p46==1)" U "(i4.u33.p91!=1)") U "(i2.u15.p42==1)") | GX"(i2.u18.p46==0)")
Reverse transition relation is NOT exact ! Due to transitions t437, i1.t405, i1.u25.t398, i2.t425, i2.u17.t432, i3.t419, i3.u19.t412, i4.t391, i4.t381, i5....850
Computing Next relation with stutter on 4.57533e+13 deadlock states
235 unique states visited
235 strongly connected components in search stack
237 transitions explored
235 items max in DFS search stack
864 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.74313,169336,1,0,373625,269,4744,406873,153,755,631868
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-15 finished in 79764 ms.
All properties solved by simple procedures.
Total runtime 107695 ms.

BK_STOP 1652732442024

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-28b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-28b, 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 r096-smll-165260576200404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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