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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 8.0K Apr 29 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 12:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 12:47 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.4K May 9 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 27K 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-04b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652721670390

Running Version 202205111006
[2022-05-16 17:21:12] [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 17:21:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:21:12] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2022-05-16 17:21:12] [INFO ] Transformed 112 places.
[2022-05-16 17:21:12] [INFO ] Transformed 117 transitions.
[2022-05-16 17:21:12] [INFO ] Found NUPN structural information;
[2022-05-16 17:21:12] [INFO ] Parsed PT model containing 112 places and 117 transitions in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 103 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 103 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 102 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 102 transition count 107
Applied a total of 20 rules in 45 ms. Remains 102 /112 variables (removed 10) and now considering 107/117 (removed 10) transitions.
// Phase 1: matrix 107 rows 102 cols
[2022-05-16 17:21:13] [INFO ] Computed 6 place invariants in 23 ms
[2022-05-16 17:21:13] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 107 rows 102 cols
[2022-05-16 17:21:13] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-16 17:21:13] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 102 cols
[2022-05-16 17:21:13] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 17:21:13] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/112 places, 107/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/112 places, 107/117 transitions.
Support contains 40 out of 102 places after structural reductions.
[2022-05-16 17:21:14] [INFO ] Flatten gal took : 78 ms
[2022-05-16 17:21:14] [INFO ] Flatten gal took : 27 ms
[2022-05-16 17:21:14] [INFO ] Input system was already deterministic with 107 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 759 ms. (steps per millisecond=13 ) properties (out of 37) seen :34
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 107 rows 102 cols
[2022-05-16 17:21:15] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 17:21:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 17:21:15] [INFO ] After 95ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2022-05-16 17:21:15] [INFO ] After 152ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-16 17:21:15] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 102/102 places, 107/107 transitions.
Graph (trivial) has 92 edges and 102 vertex of which 6 / 102 are part of one of the 1 SCC in 15 ms
Free SCC test removed 5 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 97 transition count 55
Reduce places removed 45 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 51 rules applied. Total rules applied 97 place count 52 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 50 transition count 49
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 99 place count 50 transition count 38
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 121 place count 39 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 37 transition count 36
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 37 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 125 place count 37 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 36 transition count 35
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 157 place count 21 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 21 transition count 19
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 160 place count 20 transition count 18
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 164 place count 20 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 166 place count 19 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 19 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 168 place count 18 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 17 transition count 14
Applied a total of 169 rules in 77 ms. Remains 17 /102 variables (removed 85) and now considering 14/107 (removed 93) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/102 places, 14/107 transitions.
Finished random walk after 120 steps, including 20 resets, run visited all 1 properties in 1 ms. (steps per millisecond=120 )
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 154 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||G((G(F(p2))&&p3))))'
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Graph (complete) has 154 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 93 transition count 67
Reduce places removed 37 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 44 rules applied. Total rules applied 82 place count 56 transition count 60
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 53 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 52 transition count 59
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 87 place count 52 transition count 49
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 107 place count 42 transition count 49
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 112 place count 37 transition count 44
Iterating global reduction 4 with 5 rules applied. Total rules applied 117 place count 37 transition count 44
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 149 place count 21 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 150 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 20 transition count 25
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 20 transition count 25
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 154 place count 19 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 158 place count 17 transition count 30
Applied a total of 158 rules in 29 ms. Remains 17 /102 variables (removed 85) and now considering 30/107 (removed 77) transitions.
[2022-05-16 17:21:16] [INFO ] Flow matrix only has 28 transitions (discarded 2 similar events)
// Phase 1: matrix 28 rows 17 cols
[2022-05-16 17:21:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:21:16] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-16 17:21:16] [INFO ] Flow matrix only has 28 transitions (discarded 2 similar events)
// Phase 1: matrix 28 rows 17 cols
[2022-05-16 17:21:16] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 17:21:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 17:21:16] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2022-05-16 17:21:16] [INFO ] Redundant transitions in 49 ms returned []
[2022-05-16 17:21:16] [INFO ] Flow matrix only has 28 transitions (discarded 2 similar events)
// Phase 1: matrix 28 rows 17 cols
[2022-05-16 17:21:16] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 17:21:16] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/102 places, 30/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/102 places, 30/107 transitions.
Stuttering acceptance computed with spot in 590 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s13 1) (EQ s16 1)), p3:(OR (EQ s12 1) (EQ s3 1)), p0:(EQ s12 1), p2:(OR (EQ s14 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-00 finished in 974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!(G(p0)||p0) U G(X(!X((G(p1)||p2))))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 92 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 92 transition count 98
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 92 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 89 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 89 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 89 transition count 91
Applied a total of 29 rules in 15 ms. Remains 89 /102 variables (removed 13) and now considering 91/107 (removed 16) transitions.
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:17] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 17:21:17] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:17] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 17:21:17] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/102 places, 91/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/102 places, 91/107 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s63 1), p2:(EQ s46 1), p1:(EQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3227 reset in 444 ms.
Product exploration explored 100000 steps with 3218 reset in 243 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 136 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 471 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 93 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 456 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:20] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-16 17:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:21:20] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2022-05-16 17:21:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:21:20] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-16 17:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:21:20] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-16 17:21:20] [INFO ] Computed and/alt/rep : 90/134/90 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-16 17:21:20] [INFO ] Added : 85 causal constraints over 17 iterations in 394 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:21] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 17:21:21] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:21] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 91/91 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 136 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 260 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 183 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=91 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 419 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:22] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-16 17:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:21:22] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-05-16 17:21:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:21:22] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-16 17:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:21:22] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-16 17:21:22] [INFO ] Computed and/alt/rep : 90/134/90 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 17:21:23] [INFO ] Added : 85 causal constraints over 17 iterations in 257 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3231 reset in 193 ms.
Product exploration explored 100000 steps with 3231 reset in 241 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 91/91 transitions.
Graph (trivial) has 71 edges and 89 vertex of which 6 / 89 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 130 edges and 84 vertex of which 76 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 76 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 32 place count 76 transition count 84
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 76 transition count 84
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 55 place count 58 transition count 66
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 73 place count 58 transition count 66
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 55 transition count 63
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 55 transition count 63
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 98 place count 55 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 55 transition count 62
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 115 place count 40 transition count 46
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 130 place count 40 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 40 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 39 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 39 transition count 45
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 39 transition count 55
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 34 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 34 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 31 transition count 40
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 31 transition count 40
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 153 rules in 38 ms. Remains 31 /89 variables (removed 58) and now considering 40/91 (removed 51) transitions.
[2022-05-16 17:21:24] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 40 rows 31 cols
[2022-05-16 17:21:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:21:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/89 places, 40/91 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/89 places, 40/91 transitions.
Stuttering criterion allowed to conclude after 29 steps with 3 reset in 7 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-01 finished in 6800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0) U (X(F(p1))||G(p0)))) U X(p2)))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 94 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 94 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 94 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 91 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 91 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 91 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 90 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 90 transition count 92
Applied a total of 27 rules in 10 ms. Remains 90 /102 variables (removed 12) and now considering 92/107 (removed 15) transitions.
// Phase 1: matrix 92 rows 90 cols
[2022-05-16 17:21:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:24] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 92 rows 90 cols
[2022-05-16 17:21:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:24] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 90 cols
[2022-05-16 17:21:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 17:21:24] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 92/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/102 places, 92/107 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s76 1) (EQ s53 1)), p1:(AND (EQ s25 1) (EQ s77 1) (EQ s88 1)), p0:(EQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-03 finished in 549 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((F((F(p0)&&p1))||F(p2))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 94 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 94 transition count 100
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 94 transition count 99
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 91 transition count 96
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 91 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 91 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 90 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 90 transition count 93
Applied a total of 26 rules in 8 ms. Remains 90 /102 variables (removed 12) and now considering 93/107 (removed 14) transitions.
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:24] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:24] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 17:21:24] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:25] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-16 17:21:25] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 93/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/102 places, 93/107 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s59 0), p1:(OR (EQ s41 0) (EQ s77 0) (EQ s88 0)), p0:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 138 edges and 90 vertex of which 82 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/90 stabilizing places and 16/93 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1 (NOT p0))))
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-04 finished in 1003 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 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 93 transition count 99
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 93 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 93 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 90 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 90 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 89 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 89 transition count 91
Applied a total of 29 rules in 10 ms. Remains 89 /102 variables (removed 13) and now considering 91/107 (removed 16) transitions.
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:25] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 17:21:25] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:26] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:26] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/102 places, 91/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/102 places, 91/107 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-05 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 s77 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 1199 steps with 25 reset in 2 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-05 finished in 510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U p1))&&F((X(p3)||p2))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 92 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 92 transition count 98
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 92 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 89 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 89 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 88 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 88 transition count 90
Applied a total of 31 rules in 8 ms. Remains 88 /102 variables (removed 14) and now considering 90/107 (removed 17) transitions.
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:26] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 17:21:26] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:26] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/102 places, 90/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/102 places, 90/107 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s55 0) (EQ s75 0) (EQ s86 0)), p1:(AND (EQ s55 1) (EQ s75 1) (EQ s86 1)), p0:(AND (EQ s66 1) (EQ s79 1)), p3:(OR (EQ s55 0) (EQ s75 0) (EQ s86 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-06 finished in 772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 93 transition count 99
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 93 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 93 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 91 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 91 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 91 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 90 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 90 transition count 93
Applied a total of 26 rules in 8 ms. Remains 90 /102 variables (removed 12) and now considering 93/107 (removed 14) transitions.
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:27] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 17:21:27] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:27] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 93/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/102 places, 93/107 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s6 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1118 steps with 25 reset in 3 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-07 finished in 393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((false U X(F((G(p0)||F(!p1))))))))'
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Graph (trivial) has 90 edges and 102 vertex of which 6 / 102 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 96 transition count 58
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 47 rules applied. Total rules applied 90 place count 54 transition count 53
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 93 place count 52 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 51 transition count 52
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 94 place count 51 transition count 43
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 112 place count 42 transition count 43
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 41 transition count 42
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 41 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 114 place count 41 transition count 41
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 116 place count 40 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 144 place count 26 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 26 transition count 26
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 25 transition count 25
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 25 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 153 place count 22 transition count 26
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 155 place count 22 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 21 transition count 25
Applied a total of 156 rules in 36 ms. Remains 21 /102 variables (removed 81) and now considering 25/107 (removed 82) transitions.
[2022-05-16 17:21:27] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-16 17:21:27] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 17:21:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-16 17:21:27] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-16 17:21:27] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 17:21:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:21:27] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-16 17:21:27] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-16 17:21:27] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-16 17:21:27] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 17:21:27] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/102 places, 25/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/102 places, 25/107 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s9 1) (EQ s11 1) (EQ s14 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9133 reset in 418 ms.
Product exploration explored 100000 steps with 9065 reset in 562 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 77 edges and 21 vertex of which 13 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 351 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 1171 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-16 17:21:29] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-16 17:21:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 17:21:29] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-16 17:21:29] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[p1, p1]
Stuttering acceptance computed with spot in 82 ms :[p1, p1]
Support contains 6 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2022-05-16 17:21:29] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-16 17:21:29] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 17:21:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-16 17:21:30] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-16 17:21:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 17:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:21:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-16 17:21:30] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 17:21:30] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 21 cols
[2022-05-16 17:21:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 17:21:30] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 25/25 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 77 edges and 21 vertex of which 13 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[p1, p1]
Finished random walk after 175 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[p1, p1]
Stuttering acceptance computed with spot in 86 ms :[p1, p1]
Stuttering acceptance computed with spot in 88 ms :[p1, p1]
Product exploration explored 100000 steps with 9092 reset in 339 ms.
Product exploration explored 100000 steps with 9079 reset in 446 ms.
Built C files in :
/tmp/ltsmin4195046373524543803
[2022-05-16 17:21:31] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2022-05-16 17:21:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:21:31] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2022-05-16 17:21:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:21:31] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2022-05-16 17:21:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:21:31] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4195046373524543803
Running compilation step : cd /tmp/ltsmin4195046373524543803;'/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 294 ms.
Running link step : cd /tmp/ltsmin4195046373524543803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin4195046373524543803;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased259323158663164227.hoa' '--buchi-type=spotba'
LTSmin run took 223 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-08 finished in 4734 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((X(X(p1))&&X(!(p0 U p2))&&p3))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 92 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 92 transition count 98
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 92 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 89 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 89 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 89 transition count 91
Applied a total of 29 rules in 9 ms. Remains 89 /102 variables (removed 13) and now considering 91/107 (removed 16) transitions.
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:32] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 91 rows 89 cols
[2022-05-16 17:21:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:32] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/102 places, 91/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/102 places, 91/107 transitions.
Stuttering acceptance computed with spot in 546 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p3) (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), (NOT p1), p2]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=p3, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p3 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={0} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={0} source=5 dest: 4}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND p3 p2 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 3}, { cond=(AND p3 p2), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s69 1), p0:(EQ s60 1), p2:(EQ s56 1), p1:(EQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-09 finished in 879 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&p1) U X((G(!p1)||p2))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 93 transition count 99
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 93 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 93 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 91 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 91 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 91 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 90 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 90 transition count 93
Applied a total of 26 rules in 14 ms. Remains 90 /102 variables (removed 12) and now considering 93/107 (removed 14) transitions.
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 17:21:33] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:33] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 93 rows 90 cols
[2022-05-16 17:21:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 17:21:33] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 93/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/102 places, 93/107 transitions.
Stuttering acceptance computed with spot in 443 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s52 1), p0:(EQ s19 1), p2:(OR (EQ s52 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-10 finished in 983 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F((X(F(p1))||p2))&&p0))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 92 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 92 transition count 98
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 92 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 89 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 89 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 88 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 88 transition count 90
Applied a total of 31 rules in 9 ms. Remains 88 /102 variables (removed 14) and now considering 90/107 (removed 17) transitions.
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:34] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:34] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:34] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/102 places, 90/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/102 places, 90/107 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s75 1) (EQ s86 1)), p2:(EQ s31 1), p1:(AND (EQ s59 1) (EQ s75 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-11 finished in 586 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((!p0 U F(p0))||!(F(p1)&&p2))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Graph (trivial) has 85 edges and 102 vertex of which 6 / 102 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 148 edges and 97 vertex of which 88 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 87 transition count 60
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 42 rules applied. Total rules applied 81 place count 50 transition count 55
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 48 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 46 transition count 53
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 87 place count 46 transition count 43
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 107 place count 36 transition count 43
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 32 transition count 39
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 32 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 32 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 116 place count 32 transition count 37
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 118 place count 31 transition count 37
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 148 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 16 transition count 21
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 152 place count 13 transition count 16
Iterating global reduction 6 with 3 rules applied. Total rules applied 155 place count 13 transition count 16
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 6 with 2 rules applied. Total rules applied 157 place count 12 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 11 transition count 14
Applied a total of 158 rules in 45 ms. Remains 11 /102 variables (removed 91) and now considering 14/107 (removed 93) transitions.
// Phase 1: matrix 14 rows 11 cols
[2022-05-16 17:21:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:21:34] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2022-05-16 17:21:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:21:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-16 17:21:34] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2022-05-16 17:21:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:21:34] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/102 places, 14/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/102 places, 14/107 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s1 1), p1:(EQ s8 1), p2:(NEQ s5 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, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-12 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((G(p0)&&p0)))))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 92 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 92 transition count 98
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 92 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 89 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 89 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 88 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 88 transition count 90
Applied a total of 31 rules in 6 ms. Remains 88 /102 variables (removed 14) and now considering 90/107 (removed 17) transitions.
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:35] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:35] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 88 cols
[2022-05-16 17:21:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:35] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/102 places, 90/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/102 places, 90/107 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-13 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 s58 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-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-13 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X(G((!G(p1) U p2)))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 107/107 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 107
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 93 transition count 99
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 93 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 93 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 90 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 90 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 89 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 89 transition count 92
Applied a total of 28 rules in 5 ms. Remains 89 /102 variables (removed 13) and now considering 92/107 (removed 15) transitions.
// Phase 1: matrix 92 rows 89 cols
[2022-05-16 17:21:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:35] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 92 rows 89 cols
[2022-05-16 17:21:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:35] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 89 cols
[2022-05-16 17:21:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:35] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/102 places, 92/107 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/102 places, 92/107 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), (NOT p2), p1, (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 2}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s12 1), p2:(OR (EQ s12 1) (NEQ s5 1)), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4119 reset in 222 ms.
Product exploration explored 100000 steps with 4166 reset in 183 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Graph (complete) has 137 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1011 ms. Reduced automaton from 8 states, 23 edges and 3 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), p1, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 213 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Finished Best-First random walk after 6711 steps, including 36 resets, run visited all 1 properties in 13 ms. (steps per millisecond=516 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 17 factoid took 856 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), p1, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), p1, (NOT p2), (NOT p2)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 89 cols
[2022-05-16 17:21:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 17:21:39] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 92 rows 89 cols
[2022-05-16 17:21:39] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 17:21:39] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 89 cols
[2022-05-16 17:21:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 17:21:39] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 92/92 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Graph (complete) has 137 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) p1))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 394 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), p1, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :2
Finished Best-First random walk after 1513 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=504 )
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) p1))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 7 factoid took 501 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), p1, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), p1, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), p1, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4193 reset in 206 ms.
Product exploration explored 100000 steps with 4155 reset in 148 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), p1, (NOT p2), (NOT p2)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 92/92 transitions.
Graph (trivial) has 71 edges and 89 vertex of which 6 / 89 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 131 edges and 84 vertex of which 76 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 76 transition count 83
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 34 place count 76 transition count 86
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 76 transition count 86
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 64 place count 54 transition count 64
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 86 place count 54 transition count 64
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 51 transition count 61
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 51 transition count 61
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 106 place count 51 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 51 transition count 60
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 120 place count 39 transition count 47
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 132 place count 39 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 39 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 38 transition count 46
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 38 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 38 transition count 55
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 143 place count 33 transition count 45
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 33 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 30 transition count 40
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 30 transition count 40
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 154 rules in 16 ms. Remains 30 /89 variables (removed 59) and now considering 40/92 (removed 52) transitions.
[2022-05-16 17:21:42] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 40 rows 30 cols
[2022-05-16 17:21:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:21:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/89 places, 40/92 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/89 places, 40/92 transitions.
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-15 finished in 6748 ms.
All properties solved by simple procedures.
Total runtime 29791 ms.

BK_STOP 1652721702342

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

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