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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 7.8K Apr 29 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 12:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:55 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 84K 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-16b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-16b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652724613590

Running Version 202205111006
[2022-05-16 18:10:15] [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 18:10:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:10:16] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2022-05-16 18:10:16] [INFO ] Transformed 340 places.
[2022-05-16 18:10:16] [INFO ] Transformed 357 transitions.
[2022-05-16 18:10:16] [INFO ] Found NUPN structural information;
[2022-05-16 18:10:16] [INFO ] Parsed PT model containing 340 places and 357 transitions in 447 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 357/357 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 339 transition count 357
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 37 place count 303 transition count 321
Iterating global reduction 1 with 36 rules applied. Total rules applied 73 place count 303 transition count 321
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 87 place count 289 transition count 307
Iterating global reduction 1 with 14 rules applied. Total rules applied 101 place count 289 transition count 307
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 112 place count 289 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 288 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 288 transition count 295
Applied a total of 114 rules in 171 ms. Remains 288 /340 variables (removed 52) and now considering 295/357 (removed 62) transitions.
// Phase 1: matrix 295 rows 288 cols
[2022-05-16 18:10:17] [INFO ] Computed 17 place invariants in 42 ms
[2022-05-16 18:10:17] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 295 rows 288 cols
[2022-05-16 18:10:17] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 18:10:17] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 288 cols
[2022-05-16 18:10:17] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 18:10:18] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 288/340 places, 295/357 transitions.
Finished structural reductions, in 1 iterations. Remains : 288/340 places, 295/357 transitions.
Support contains 36 out of 288 places after structural reductions.
[2022-05-16 18:10:18] [INFO ] Flatten gal took : 80 ms
[2022-05-16 18:10:18] [INFO ] Flatten gal took : 34 ms
[2022-05-16 18:10:18] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 34 out of 288 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 736 ms. (steps per millisecond=13 ) properties (out of 34) seen :28
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 295 rows 288 cols
[2022-05-16 18:10:19] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-16 18:10:19] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 14 ms returned sat
[2022-05-16 18:10:19] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-16 18:10:19] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-16 18:10:19] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-05-16 18:10:20] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 26 ms returned sat
[2022-05-16 18:10:20] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 18:10:20] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-16 18:10:20] [INFO ] After 795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 295/295 transitions.
Graph (trivial) has 235 edges and 288 vertex of which 7 / 288 are part of one of the 1 SCC in 32 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 440 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.15 ms
Discarding 20 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 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 262 transition count 152
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 268 place count 132 transition count 148
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 270 place count 131 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 271 place count 130 transition count 147
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 271 place count 130 transition count 112
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 341 place count 95 transition count 112
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 358 place count 78 transition count 95
Iterating global reduction 4 with 17 rules applied. Total rules applied 375 place count 78 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 375 place count 78 transition count 94
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 377 place count 77 transition count 94
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 471 place count 30 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 75 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 473 place count 29 transition count 46
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 475 place count 29 transition count 44
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 487 place count 17 transition count 20
Iterating global reduction 6 with 12 rules applied. Total rules applied 499 place count 17 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 504 place count 14 transition count 18
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 21 edges and 14 vertex of which 13 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 2 rules applied. Total rules applied 506 place count 13 transition count 17
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 507 place count 13 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 509 place count 13 transition count 14
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 510 place count 13 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 511 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 512 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 512 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 516 place count 9 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 517 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 518 place count 8 transition count 10
Applied a total of 518 rules in 137 ms. Remains 8 /288 variables (removed 280) and now considering 10/295 (removed 285) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/288 places, 10/295 transitions.
Finished random walk after 3345 steps, including 1 resets, run visited all 3 properties in 17 ms. (steps per millisecond=196 )
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 448 edges and 288 vertex of which 268 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(X(!F(p0)) U p1))&&p2)))'
Support contains 3 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 283 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 283 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 283 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 281 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 281 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 281 transition count 284
Applied a total of 18 rules in 58 ms. Remains 281 /288 variables (removed 7) and now considering 284/295 (removed 11) transitions.
// Phase 1: matrix 284 rows 281 cols
[2022-05-16 18:10:21] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:21] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 284 rows 281 cols
[2022-05-16 18:10:21] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 18:10:22] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 281 cols
[2022-05-16 18:10:22] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:22] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 281/288 places, 284/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 281/288 places, 284/295 transitions.
Stuttering acceptance computed with spot in 622 ms :[true, (NOT p0), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s163 1), p2:(EQ s19 1), p1:(EQ s137 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-00 finished in 1879 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(G(F(X(p0))))))))'
Support contains 1 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Graph (trivial) has 244 edges and 288 vertex of which 7 / 288 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 441 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 136 place count 261 transition count 150
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 142 rules applied. Total rules applied 278 place count 127 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 281 place count 124 transition count 142
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 281 place count 124 transition count 106
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 353 place count 88 transition count 106
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 368 place count 73 transition count 91
Iterating global reduction 3 with 15 rules applied. Total rules applied 383 place count 73 transition count 91
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 479 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 480 place count 25 transition count 42
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 496 place count 9 transition count 11
Iterating global reduction 4 with 16 rules applied. Total rules applied 512 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 514 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 515 place count 7 transition count 9
Applied a total of 515 rules in 47 ms. Remains 7 /288 variables (removed 281) and now considering 9/295 (removed 286) transitions.
// Phase 1: matrix 9 rows 7 cols
[2022-05-16 18:10:23] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 18:10:23] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2022-05-16 18:10:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 18:10:23] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-16 18:10:23] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 9 rows 7 cols
[2022-05-16 18:10:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/288 places, 9/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/288 places, 9/295 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-01 finished in 257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 1 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 282 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 282 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 282 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 280 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 280 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 280 transition count 282
Applied a total of 21 rules in 62 ms. Remains 280 /288 variables (removed 8) and now considering 282/295 (removed 13) transitions.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:23] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-16 18:10:23] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:23] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-16 18:10:24] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:24] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:24] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/288 places, 282/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/288 places, 282/295 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s136 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-02 finished in 928 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 282 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 282 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 282 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 280 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 280 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 280 transition count 282
Applied a total of 21 rules in 20 ms. Remains 280 /288 variables (removed 8) and now considering 282/295 (removed 13) transitions.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:24] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:24] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:24] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:24] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:24] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-16 18:10:25] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/288 places, 282/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/288 places, 282/295 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s160 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-03 finished in 968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||p1))))'
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 282 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 282 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 282 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 280 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 280 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 280 transition count 282
Applied a total of 21 rules in 28 ms. Remains 280 /288 variables (removed 8) and now considering 282/295 (removed 13) transitions.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:25] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:25] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:25] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 18:10:26] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:26] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:26] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/288 places, 282/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/288 places, 282/295 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s69 0), p1:(EQ s249 0)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27139 steps with 190 reset in 267 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-04 finished in 1451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(X(p0))&&p1))&&(G(p2)||p2))))'
Support contains 3 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 283 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 283 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 283 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 282 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 282 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 282 transition count 285
Applied a total of 16 rules in 31 ms. Remains 282 /288 variables (removed 6) and now considering 285/295 (removed 10) transitions.
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:26] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:27] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:27] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:27] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:27] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-16 18:10:27] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/288 places, 285/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/288 places, 285/295 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s98 0), p1:(EQ s114 0), p2:(EQ s243 0)], 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]]
Product exploration explored 100000 steps with 25000 reset in 592 ms.
Product exploration explored 100000 steps with 25000 reset in 530 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 438 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.11 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3065 steps, including 19 resets, run visited all 1 properties in 18 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND p0 p1 p2), (X p2), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 282 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 285/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 282 /282 variables (removed 0) and now considering 285/285 (removed 0) transitions.
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:30] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:30] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:30] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:30] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:30] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:31] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/282 places, 285/285 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 438 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.5 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4114 steps, including 26 resets, run visited all 1 properties in 13 ms. (steps per millisecond=316 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 365 ms.
Product exploration explored 100000 steps with 25000 reset in 386 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 285/285 transitions.
Graph (trivial) has 232 edges and 282 vertex of which 6 / 282 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 432 edges and 277 vertex of which 257 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 257 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 134 place count 257 transition count 275
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 134 place count 257 transition count 277
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 152 place count 257 transition count 277
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 249 place count 160 transition count 180
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 346 place count 160 transition count 180
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 360 place count 146 transition count 166
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 374 place count 146 transition count 166
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 428 place count 146 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 430 place count 146 transition count 165
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 469 place count 107 transition count 125
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 39 rules applied. Total rules applied 508 place count 107 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 509 place count 107 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 510 place count 106 transition count 124
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 511 place count 106 transition count 124
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 526 place count 106 transition count 169
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 555 place count 77 transition count 111
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 584 place count 77 transition count 111
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 626 place count 35 transition count 41
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 42 rules applied. Total rules applied 668 place count 35 transition count 41
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 668 rules in 93 ms. Remains 35 /282 variables (removed 247) and now considering 41/285 (removed 244) transitions.
[2022-05-16 18:10:33] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 41 rows 35 cols
[2022-05-16 18:10:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 18:10:33] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/282 places, 41/285 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/282 places, 41/285 transitions.
Product exploration explored 100000 steps with 25000 reset in 743 ms.
Product exploration explored 100000 steps with 25000 reset in 476 ms.
Built C files in :
/tmp/ltsmin3797477734843221432
[2022-05-16 18:10:34] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3797477734843221432
Running compilation step : cd /tmp/ltsmin3797477734843221432;'/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 1105 ms.
Running link step : cd /tmp/ltsmin3797477734843221432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin3797477734843221432;'/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/stateBased1874675023714666781.hoa' '--buchi-type=spotba'
LTSmin run took 199 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-05 finished in 9290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(F(X(!(F(p0) U p1)))))&&G(p2)))))'
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Graph (trivial) has 242 edges and 288 vertex of which 7 / 288 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 441 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 261 transition count 152
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 140 rules applied. Total rules applied 274 place count 129 transition count 144
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 277 place count 126 transition count 144
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 277 place count 126 transition count 108
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 349 place count 90 transition count 108
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 364 place count 75 transition count 93
Iterating global reduction 3 with 15 rules applied. Total rules applied 379 place count 75 transition count 93
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 477 place count 26 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 478 place count 26 transition count 43
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 493 place count 11 transition count 14
Iterating global reduction 4 with 15 rules applied. Total rules applied 508 place count 11 transition count 14
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 510 place count 10 transition count 13
Applied a total of 510 rules in 28 ms. Remains 10 /288 variables (removed 278) and now considering 13/295 (removed 282) transitions.
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 18:10:36] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 18:10:36] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 18:10:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 18:10:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-16 18:10:36] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 18:10:36] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 18:10:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/288 places, 13/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/288 places, 13/295 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) p1), (AND p1 p0), p1]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s6 0), p1:(EQ s1 1), p0:(EQ s6 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 237 steps with 24 reset in 4 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-07 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X((G((G(p1)||p2)) U G(X(p3)))))))'
Support contains 6 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 284 transition count 291
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 284 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 284 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 282 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 282 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 282 transition count 285
Applied a total of 16 rules in 41 ms. Remains 282 /288 variables (removed 6) and now considering 285/295 (removed 10) transitions.
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:36] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:36] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:36] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:37] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:37] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:37] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/288 places, 285/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/288 places, 285/295 transitions.
Stuttering acceptance computed with spot in 550 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3 (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) p2 p3) (AND (NOT p0) p1 p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p1 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(EQ s214 1), p0:(EQ s175 1), p2:(AND (EQ s56 1) (EQ s269 1) (EQ s280 1)), p1:(EQ s262 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-08 finished in 1597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0)&&p1) U X((p2&&F(X(p3)))))))'
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 283 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 283 transition count 290
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 283 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 282 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 282 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 282 transition count 285
Applied a total of 16 rules in 27 ms. Remains 282 /288 variables (removed 6) and now considering 285/295 (removed 10) transitions.
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:38] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:38] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:38] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:38] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 282 cols
[2022-05-16 18:10:38] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:39] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/288 places, 285/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/288 places, 285/295 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s162 1), p2:(EQ s123 1), p0:(EQ s114 1), p3:(EQ s44 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-09 finished in 1311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p1)&&p0))||G(X(G(p2)))))'
Support contains 4 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 282 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 282 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 282 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 280 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 280 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 280 transition count 282
Applied a total of 21 rules in 26 ms. Remains 280 /288 variables (removed 8) and now considering 282/295 (removed 13) transitions.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:39] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 18:10:39] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:39] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:39] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:39] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:40] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/288 places, 282/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/288 places, 282/295 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}]], initial=2, aps=[p1:(EQ s255 1), p2:(OR (EQ s191 0) (EQ s267 0) (EQ s278 0)), p0:(AND (EQ s191 1) (EQ s267 1) (EQ s278 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 316 steps with 1 reset in 2 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-10 finished in 1209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(X((G(p1)||p0)))))))'
Support contains 3 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Graph (trivial) has 238 edges and 288 vertex of which 7 / 288 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 441 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 261 transition count 154
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 137 rules applied. Total rules applied 269 place count 131 transition count 147
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 274 place count 128 transition count 145
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 277 place count 126 transition count 144
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 277 place count 126 transition count 109
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 347 place count 91 transition count 109
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 362 place count 76 transition count 94
Iterating global reduction 4 with 15 rules applied. Total rules applied 377 place count 76 transition count 94
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 473 place count 28 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 474 place count 28 transition count 45
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 487 place count 15 transition count 20
Iterating global reduction 5 with 13 rules applied. Total rules applied 500 place count 15 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 502 place count 14 transition count 19
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 504 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 505 place count 13 transition count 18
Applied a total of 505 rules in 19 ms. Remains 13 /288 variables (removed 275) and now considering 18/295 (removed 277) transitions.
[2022-05-16 18:10:40] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 13 cols
[2022-05-16 18:10:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:40] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-16 18:10:40] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 13 cols
[2022-05-16 18:10:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 18:10:40] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-16 18:10:40] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-16 18:10:40] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 13 cols
[2022-05-16 18:10:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:40] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/288 places, 18/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/288 places, 18/295 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(OR (EQ s5 1) (EQ s9 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 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-11 finished in 253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(X((F(p0)&&F(p1))))))))'
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Graph (trivial) has 242 edges and 288 vertex of which 7 / 288 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 441 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 261 transition count 152
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 140 rules applied. Total rules applied 274 place count 129 transition count 144
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 279 place count 126 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 281 place count 124 transition count 142
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 281 place count 124 transition count 108
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 349 place count 90 transition count 108
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 364 place count 75 transition count 93
Iterating global reduction 4 with 15 rules applied. Total rules applied 379 place count 75 transition count 93
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 479 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 480 place count 25 transition count 42
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 494 place count 11 transition count 15
Iterating global reduction 5 with 14 rules applied. Total rules applied 508 place count 11 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 510 place count 10 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 511 place count 9 transition count 13
Applied a total of 511 rules in 18 ms. Remains 9 /288 variables (removed 279) and now considering 13/295 (removed 282) transitions.
// Phase 1: matrix 13 rows 9 cols
[2022-05-16 18:10:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:40] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 13 rows 9 cols
[2022-05-16 18:10:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 18:10:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-16 18:10:40] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 13 rows 9 cols
[2022-05-16 18:10:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/288 places, 13/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/288 places, 13/295 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-12 finished in 291 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 282 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 282 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 282 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 280 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 280 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 280 transition count 282
Applied a total of 21 rules in 21 ms. Remains 280 /288 variables (removed 8) and now considering 282/295 (removed 13) transitions.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:41] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:41] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:41] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 18:10:41] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:41] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 18:10:41] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/288 places, 282/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/288 places, 282/295 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s276 1), p0:(EQ s167 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3312 reset in 209 ms.
Product exploration explored 100000 steps with 3305 reset in 293 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 435 edges and 280 vertex of which 260 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Detected a total of 51/280 stabilizing places and 51/282 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 365 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1577 steps, including 11 resets, run visited all 2 properties in 5 ms. (steps per millisecond=315 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:43] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-16 18:10:43] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 14 ms returned sat
[2022-05-16 18:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:10:43] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-05-16 18:10:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:10:44] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 15 ms returned sat
[2022-05-16 18:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:10:44] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2022-05-16 18:10:44] [INFO ] Computed and/alt/rep : 276/362/276 causal constraints (skipped 5 transitions) in 51 ms.
[2022-05-16 18:10:47] [INFO ] Added : 265 causal constraints over 53 iterations in 2302 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:47] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 18:10:47] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:47] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:47] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:47] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:51] [INFO ] Dead Transitions using invariants and state equation in 4051 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/280 places, 282/282 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 435 edges and 280 vertex of which 260 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Computed a total of 51 stabilizing places and 51 stable transitions
Detected a total of 51/280 stabilizing places and 51/282 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 308 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 717 steps, including 5 resets, run visited all 2 properties in 3 ms. (steps per millisecond=239 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:52] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 18:10:53] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 13 ms returned sat
[2022-05-16 18:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:10:53] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-05-16 18:10:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:10:53] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 12 ms returned sat
[2022-05-16 18:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:10:54] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2022-05-16 18:10:54] [INFO ] Computed and/alt/rep : 276/362/276 causal constraints (skipped 5 transitions) in 39 ms.
[2022-05-16 18:10:56] [INFO ] Added : 265 causal constraints over 53 iterations in 2048 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3328 reset in 179 ms.
Product exploration explored 100000 steps with 3272 reset in 163 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 282/282 transitions.
Graph (trivial) has 227 edges and 280 vertex of which 6 / 280 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 429 edges and 275 vertex of which 255 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.6 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 255 transition count 273
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 132 place count 255 transition count 274
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 149 place count 255 transition count 274
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 244 place count 160 transition count 179
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 339 place count 160 transition count 179
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 354 place count 145 transition count 164
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 369 place count 145 transition count 164
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 421 place count 145 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 422 place count 145 transition count 164
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 459 place count 108 transition count 126
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 496 place count 108 transition count 126
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 512 place count 108 transition count 174
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 543 place count 77 transition count 112
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 574 place count 77 transition count 112
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 619 place count 32 transition count 37
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 664 place count 32 transition count 37
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 664 rules in 46 ms. Remains 32 /280 variables (removed 248) and now considering 37/282 (removed 245) transitions.
[2022-05-16 18:10:56] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 37 rows 32 cols
[2022-05-16 18:10:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:56] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/280 places, 37/282 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/280 places, 37/282 transitions.
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-13 finished in 15723 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((X(F(G(p0))) U p1)&&p2))))'
Support contains 3 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 282 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 282 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 282 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 280 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 280 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 280 transition count 282
Applied a total of 21 rules in 14 ms. Remains 280 /288 variables (removed 8) and now considering 282/295 (removed 13) transitions.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:56] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 18:10:56] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:56] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 18:10:57] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2022-05-16 18:10:57] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 18:10:57] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/288 places, 282/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/288 places, 282/295 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s242 1), p1:(EQ s233 1), p0:(EQ s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-14 finished in 835 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 295/295 transitions.
Graph (trivial) has 239 edges and 288 vertex of which 7 / 288 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 441 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 261 transition count 153
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 137 rules applied. Total rules applied 270 place count 130 transition count 147
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 273 place count 128 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 274 place count 127 transition count 146
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 274 place count 127 transition count 110
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 346 place count 91 transition count 110
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 361 place count 76 transition count 95
Iterating global reduction 4 with 15 rules applied. Total rules applied 376 place count 76 transition count 95
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 472 place count 28 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 473 place count 28 transition count 46
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 487 place count 14 transition count 19
Iterating global reduction 5 with 14 rules applied. Total rules applied 501 place count 14 transition count 19
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 5 with 4 rules applied. Total rules applied 505 place count 12 transition count 18
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 507 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 508 place count 11 transition count 17
Applied a total of 508 rules in 23 ms. Remains 11 /288 variables (removed 277) and now considering 17/295 (removed 278) transitions.
[2022-05-16 18:10:57] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 18:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-16 18:10:57] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 18:10:57] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 18:10:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 18:10:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-16 18:10:57] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-16 18:10:57] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2022-05-16 18:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:10:57] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/288 places, 17/295 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/288 places, 17/295 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-16b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s6 1) (EQ s3 1)), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-LTLFireability-15 finished in 301 ms.
All properties solved by simple procedures.
Total runtime 42078 ms.

BK_STOP 1652724658172

--------------------
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-16b"
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-16b, 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-165260576100356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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