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.r078-tall-165260109900140.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 DiscoveryGPU-PT-14b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109900140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 6.8K Apr 30 07:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 07:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 07:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 07:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 104K May 10 09:33 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 DiscoveryGPU-PT-14b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652636085929

Running Version 202205111006
[2022-05-15 17:34:47] [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-15 17:34:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:34:47] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2022-05-15 17:34:47] [INFO ] Transformed 408 places.
[2022-05-15 17:34:47] [INFO ] Transformed 434 transitions.
[2022-05-15 17:34:47] [INFO ] Found NUPN structural information;
[2022-05-15 17:34:47] [INFO ] Parsed PT model containing 408 places and 434 transitions in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 380 transition count 434
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 92 place count 316 transition count 370
Iterating global reduction 1 with 64 rules applied. Total rules applied 156 place count 316 transition count 370
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 167 place count 305 transition count 359
Iterating global reduction 1 with 11 rules applied. Total rules applied 178 place count 305 transition count 359
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 187 place count 296 transition count 350
Iterating global reduction 1 with 9 rules applied. Total rules applied 196 place count 296 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 203 place count 289 transition count 343
Iterating global reduction 1 with 7 rules applied. Total rules applied 210 place count 289 transition count 343
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 217 place count 282 transition count 329
Iterating global reduction 1 with 7 rules applied. Total rules applied 224 place count 282 transition count 329
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 230 place count 276 transition count 323
Iterating global reduction 1 with 6 rules applied. Total rules applied 236 place count 276 transition count 323
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 242 place count 270 transition count 317
Iterating global reduction 1 with 6 rules applied. Total rules applied 248 place count 270 transition count 317
Applied a total of 248 rules in 140 ms. Remains 270 /408 variables (removed 138) and now considering 317/434 (removed 117) transitions.
// Phase 1: matrix 317 rows 270 cols
[2022-05-15 17:34:47] [INFO ] Computed 2 place invariants in 18 ms
[2022-05-15 17:34:47] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 317 rows 270 cols
[2022-05-15 17:34:47] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:34:48] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
// Phase 1: matrix 317 rows 270 cols
[2022-05-15 17:34:48] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:34:48] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/408 places, 317/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 270/408 places, 317/434 transitions.
Support contains 34 out of 270 places after structural reductions.
[2022-05-15 17:34:48] [INFO ] Flatten gal took : 52 ms
[2022-05-15 17:34:48] [INFO ] Flatten gal took : 21 ms
[2022-05-15 17:34:48] [INFO ] Input system was already deterministic with 317 transitions.
Support contains 31 out of 270 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 27) seen :26
Finished Best-First random walk after 1504 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=250 )
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 538 edges and 270 vertex of which 267 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0 U (p1||G(p0)))))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 258 transition count 305
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 258 transition count 305
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 251 transition count 298
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 251 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 245 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 245 transition count 290
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 239 transition count 281
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 239 transition count 281
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 233 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 233 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 229 transition count 270
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 228 transition count 269
Applied a total of 84 rules in 43 ms. Remains 228 /270 variables (removed 42) and now considering 269/317 (removed 48) transitions.
// Phase 1: matrix 269 rows 228 cols
[2022-05-15 17:34:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:49] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 269 rows 228 cols
[2022-05-15 17:34:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:49] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 269 rows 228 cols
[2022-05-15 17:34:49] [INFO ] Computed 2 place invariants in 11 ms
[2022-05-15 17:34:49] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/270 places, 269/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/270 places, 269/317 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s222 1), p1:(NEQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 461 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-00 finished in 1551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0)||X((p0 U F(p1)))))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 257 transition count 304
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 257 transition count 304
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 249 transition count 296
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 249 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 243 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 243 transition count 288
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 237 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 237 transition count 279
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 231 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 231 transition count 272
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 227 transition count 268
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 227 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 226 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 226 transition count 267
Applied a total of 88 rules in 31 ms. Remains 226 /270 variables (removed 44) and now considering 267/317 (removed 50) transitions.
// Phase 1: matrix 267 rows 226 cols
[2022-05-15 17:34:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:34:50] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 267 rows 226 cols
[2022-05-15 17:34:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:50] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
// Phase 1: matrix 267 rows 226 cols
[2022-05-15 17:34:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:51] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/270 places, 267/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 226/270 places, 267/317 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2 1), p1:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 413 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-01 finished in 548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(X(p0))&&F(p1))))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 258 transition count 305
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 258 transition count 305
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 252 transition count 299
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 252 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 248 transition count 293
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 248 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 244 transition count 288
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 244 transition count 288
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 240 transition count 283
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 240 transition count 283
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 238 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 238 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 237 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 237 transition count 280
Applied a total of 66 rules in 24 ms. Remains 237 /270 variables (removed 33) and now considering 280/317 (removed 37) transitions.
// Phase 1: matrix 280 rows 237 cols
[2022-05-15 17:34:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:34:51] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 280 rows 237 cols
[2022-05-15 17:34:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:34:51] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
// Phase 1: matrix 280 rows 237 cols
[2022-05-15 17:34:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:34:51] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/270 places, 280/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 237/270 places, 280/317 transitions.
Stuttering acceptance computed with spot in 818 ms :[(NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s95 1) (EQ s233 1)), p1:(AND (EQ s171 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1798 steps with 3 reset in 9 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-02 finished in 1202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))&&X(p1))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 257 transition count 304
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 257 transition count 304
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 250 transition count 297
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 250 transition count 297
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 245 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 245 transition count 291
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 240 transition count 283
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 240 transition count 283
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 235 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 235 transition count 277
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 231 transition count 273
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 231 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 230 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 230 transition count 272
Applied a total of 80 rules in 21 ms. Remains 230 /270 variables (removed 40) and now considering 272/317 (removed 45) transitions.
// Phase 1: matrix 272 rows 230 cols
[2022-05-15 17:34:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:34:52] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 272 rows 230 cols
[2022-05-15 17:34:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:52] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 272 rows 230 cols
[2022-05-15 17:34:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:52] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/270 places, 272/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/270 places, 272/317 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s38 1), p1:(EQ s121 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 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-03 finished in 467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(X(F(p0)))))||p1)))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 256 transition count 303
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 256 transition count 303
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 248 transition count 295
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 248 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 242 transition count 287
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 242 transition count 287
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 236 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 236 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 230 transition count 271
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 230 transition count 271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 226 transition count 267
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 226 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 225 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 225 transition count 266
Applied a total of 90 rules in 23 ms. Remains 225 /270 variables (removed 45) and now considering 266/317 (removed 51) transitions.
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:34:52] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 17:34:52] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:34:52] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-15 17:34:53] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:34:53] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:34:53] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/270 places, 266/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/270 places, 266/317 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(EQ s206 1), p0:(EQ s206 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 107 ms.
Product exploration explored 100000 steps with 20000 reset in 111 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 458 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2916 steps, including 6 resets, run visited all 1 properties in 20 ms. (steps per millisecond=145 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 225 /225 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:34:54] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 17:34:54] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:34:54] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:34:54] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:34:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:34:54] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/225 places, 266/266 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 458 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2531 steps, including 5 resets, run visited all 1 properties in 14 ms. (steps per millisecond=180 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 108 ms.
Product exploration explored 100000 steps with 20000 reset in 108 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 266/266 transitions.
Graph (complete) has 458 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 224 transition count 265
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 44 Pre rules applied. Total rules applied 29 place count 224 transition count 265
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 73 place count 224 transition count 265
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 105 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 106 place count 224 transition count 279
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 221 transition count 276
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 221 transition count 276
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 140 place count 221 transition count 332
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 152 place count 209 transition count 308
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 164 place count 209 transition count 308
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 200 place count 173 transition count 248
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 236 place count 173 transition count 248
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 272 place count 137 transition count 188
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 308 place count 137 transition count 188
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 320 place count 125 transition count 176
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 332 place count 125 transition count 176
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 356 place count 101 transition count 140
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 380 place count 101 transition count 140
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 428 place count 53 transition count 68
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 476 place count 53 transition count 68
Deduced a syphon composed of 34 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 481 place count 53 transition count 63
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 483 place count 51 transition count 61
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 485 place count 51 transition count 61
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 485 rules in 80 ms. Remains 51 /225 variables (removed 174) and now considering 61/266 (removed 205) transitions.
[2022-05-15 17:34:56] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 17:34:56] [INFO ] Flow matrix only has 59 transitions (discarded 2 similar events)
// Phase 1: matrix 59 rows 51 cols
[2022-05-15 17:34:56] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:34:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/225 places, 61/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/225 places, 61/266 transitions.
Product exploration explored 100000 steps with 20000 reset in 258 ms.
Product exploration explored 100000 steps with 20000 reset in 232 ms.
Built C files in :
/tmp/ltsmin14145535041618765010
[2022-05-15 17:34:57] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14145535041618765010
Running compilation step : cd /tmp/ltsmin14145535041618765010;'/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 492 ms.
Running link step : cd /tmp/ltsmin14145535041618765010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14145535041618765010;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11181980886663227712.hoa' '--buchi-type=spotba'
LTSmin run took 164 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-04 finished in 4930 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Graph (complete) has 538 edges and 270 vertex of which 267 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 266 transition count 273
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 226 transition count 273
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 81 place count 226 transition count 229
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 169 place count 182 transition count 229
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 175 transition count 222
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 175 transition count 222
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 188 place count 170 transition count 217
Iterating global reduction 2 with 5 rules applied. Total rules applied 193 place count 170 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 165 transition count 207
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 165 transition count 207
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 208 place count 160 transition count 202
Iterating global reduction 2 with 5 rules applied. Total rules applied 213 place count 160 transition count 202
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 341 place count 96 transition count 138
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 353 place count 84 transition count 114
Iterating global reduction 2 with 12 rules applied. Total rules applied 365 place count 84 transition count 114
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 377 place count 72 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 389 place count 72 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 401 place count 60 transition count 78
Iterating global reduction 2 with 12 rules applied. Total rules applied 413 place count 60 transition count 78
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 425 place count 48 transition count 66
Iterating global reduction 2 with 12 rules applied. Total rules applied 437 place count 48 transition count 66
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 449 place count 36 transition count 42
Iterating global reduction 2 with 12 rules applied. Total rules applied 461 place count 36 transition count 42
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 473 place count 24 transition count 30
Iterating global reduction 2 with 12 rules applied. Total rules applied 485 place count 24 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 487 place count 24 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 489 place count 22 transition count 26
Reduce places removed 1 places and 0 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 2 with 3 rules applied. Total rules applied 492 place count 21 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 494 place count 19 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 494 place count 19 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 502 place count 15 transition count 20
Applied a total of 502 rules in 44 ms. Remains 15 /270 variables (removed 255) and now considering 20/317 (removed 297) transitions.
[2022-05-15 17:34:57] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2022-05-15 17:34:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:34:57] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-15 17:34:57] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2022-05-15 17:34:57] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 17:34:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:34:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-15 17:34:57] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:34:57] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2022-05-15 17:34:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:34:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/270 places, 20/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/270 places, 20/317 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-05 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(((p1 U p2)||p0) U p1)))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 257 transition count 304
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 257 transition count 304
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 249 transition count 296
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 249 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 243 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 243 transition count 288
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 237 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 237 transition count 279
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 232 transition count 273
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 232 transition count 273
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 228 transition count 269
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 228 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 227 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 227 transition count 268
Applied a total of 86 rules in 38 ms. Remains 227 /270 variables (removed 43) and now considering 268/317 (removed 49) transitions.
// Phase 1: matrix 268 rows 227 cols
[2022-05-15 17:34:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:58] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 268 rows 227 cols
[2022-05-15 17:34:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:58] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 227 cols
[2022-05-15 17:34:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:58] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/270 places, 268/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 227/270 places, 268/317 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, p1, p1]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s65 1), p0:(OR (EQ s187 1) (EQ s127 1) (EQ s38 1)), p2:(EQ s86 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 460 edges and 227 vertex of which 226 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 45 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT p1)), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 118 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-07 finished in 994 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))||G(F(p1))))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Graph (complete) has 538 edges and 270 vertex of which 268 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 267 transition count 274
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 227 transition count 274
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 81 place count 227 transition count 231
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 167 place count 184 transition count 231
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 178 transition count 225
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 178 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 179 place count 178 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 181 place count 177 transition count 224
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 172 transition count 219
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 172 transition count 219
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 196 place count 167 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 201 place count 167 transition count 209
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 162 transition count 204
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 162 transition count 204
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 337 place count 99 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 348 place count 88 transition count 119
Iterating global reduction 2 with 11 rules applied. Total rules applied 359 place count 88 transition count 119
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 370 place count 77 transition count 108
Iterating global reduction 2 with 11 rules applied. Total rules applied 381 place count 77 transition count 108
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 392 place count 66 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 403 place count 66 transition count 86
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 414 place count 55 transition count 75
Iterating global reduction 2 with 11 rules applied. Total rules applied 425 place count 55 transition count 75
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 436 place count 44 transition count 53
Iterating global reduction 2 with 11 rules applied. Total rules applied 447 place count 44 transition count 53
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 458 place count 33 transition count 42
Iterating global reduction 2 with 11 rules applied. Total rules applied 469 place count 33 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 471 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 473 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 51 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 2 with 5 rules applied. Total rules applied 478 place count 28 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 481 place count 25 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 487 place count 22 transition count 33
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 490 place count 19 transition count 30
Applied a total of 490 rules in 45 ms. Remains 19 /270 variables (removed 251) and now considering 30/317 (removed 287) transitions.
[2022-05-15 17:34:59] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2022-05-15 17:34:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:34:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 17:34:59] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2022-05-15 17:34:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:34:59] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-15 17:34:59] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:34:59] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2022-05-15 17:34:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:34:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/270 places, 30/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/270 places, 30/317 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s18 0)), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 185 steps with 2 reset in 3 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-08 finished in 223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(X((!(p0 U p1)||p1)))))))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Graph (complete) has 538 edges and 270 vertex of which 267 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 266 transition count 274
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 227 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 226 transition count 273
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 81 place count 226 transition count 230
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 167 place count 183 transition count 230
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 175 place count 175 transition count 222
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 175 transition count 222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 183 place count 175 transition count 221
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 185 place count 174 transition count 221
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 191 place count 168 transition count 215
Iterating global reduction 3 with 6 rules applied. Total rules applied 197 place count 168 transition count 215
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 203 place count 162 transition count 203
Iterating global reduction 3 with 6 rules applied. Total rules applied 209 place count 162 transition count 203
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 215 place count 156 transition count 197
Iterating global reduction 3 with 6 rules applied. Total rules applied 221 place count 156 transition count 197
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 345 place count 94 transition count 135
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 358 place count 81 transition count 109
Iterating global reduction 3 with 13 rules applied. Total rules applied 371 place count 81 transition count 109
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 384 place count 68 transition count 96
Iterating global reduction 3 with 13 rules applied. Total rules applied 397 place count 68 transition count 96
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 410 place count 55 transition count 70
Iterating global reduction 3 with 13 rules applied. Total rules applied 423 place count 55 transition count 70
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 435 place count 43 transition count 58
Iterating global reduction 3 with 12 rules applied. Total rules applied 447 place count 43 transition count 58
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 458 place count 32 transition count 36
Iterating global reduction 3 with 11 rules applied. Total rules applied 469 place count 32 transition count 36
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 480 place count 21 transition count 25
Iterating global reduction 3 with 11 rules applied. Total rules applied 491 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 493 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 29 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 496 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 497 place count 16 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 499 place count 15 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 502 place count 12 transition count 18
Applied a total of 502 rules in 38 ms. Remains 12 /270 variables (removed 258) and now considering 18/317 (removed 299) transitions.
[2022-05-15 17:34:59] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-15 17:34:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:34:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 17:34:59] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-15 17:34:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:34:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-15 17:34:59] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:34:59] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-15 17:34:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:34:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/270 places, 18/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/270 places, 18/317 transitions.
Stuttering acceptance computed with spot in 68 ms :[false, false]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s6 1), p0:(AND (EQ s7 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1093 reset in 129 ms.
Stack based approach found an accepted trace after 5507 steps with 61 reset with depth 23 and stack size 12 in 9 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-09 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(F(G(p0))) U p1)) U !X(p2)))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 256 transition count 303
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 256 transition count 303
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 248 transition count 295
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 248 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 242 transition count 287
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 242 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 237 transition count 280
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 237 transition count 280
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 232 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 232 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 229 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 229 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 228 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 228 transition count 270
Applied a total of 84 rules in 31 ms. Remains 228 /270 variables (removed 42) and now considering 270/317 (removed 47) transitions.
// Phase 1: matrix 270 rows 228 cols
[2022-05-15 17:34:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:59] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 270 rows 228 cols
[2022-05-15 17:34:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:34:59] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 270 rows 228 cols
[2022-05-15 17:34:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:34:59] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/270 places, 270/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/270 places, 270/317 transitions.
Stuttering acceptance computed with spot in 318 ms :[p2, (AND p1 p2 (NOT p0)), p2, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s84 1), p2:(NEQ s27 1), p0:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 410 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-10 finished in 703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p2))||p0)))'
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Graph (complete) has 538 edges and 270 vertex of which 267 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 266 transition count 275
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 228 transition count 275
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 77 place count 228 transition count 232
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 163 place count 185 transition count 232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 171 place count 177 transition count 224
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 177 transition count 224
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 185 place count 171 transition count 218
Iterating global reduction 2 with 6 rules applied. Total rules applied 191 place count 171 transition count 218
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 165 transition count 206
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 165 transition count 206
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 207 place count 161 transition count 202
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 161 transition count 202
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 333 place count 100 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 342 place count 91 transition count 123
Iterating global reduction 2 with 9 rules applied. Total rules applied 351 place count 91 transition count 123
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 360 place count 82 transition count 114
Iterating global reduction 2 with 9 rules applied. Total rules applied 369 place count 82 transition count 114
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 378 place count 73 transition count 96
Iterating global reduction 2 with 9 rules applied. Total rules applied 387 place count 73 transition count 96
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 396 place count 64 transition count 87
Iterating global reduction 2 with 9 rules applied. Total rules applied 405 place count 64 transition count 87
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 414 place count 55 transition count 69
Iterating global reduction 2 with 9 rules applied. Total rules applied 423 place count 55 transition count 69
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 432 place count 46 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 441 place count 46 transition count 60
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 2 with 2 rules applied. Total rules applied 443 place count 45 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 445 place count 43 transition count 59
Applied a total of 445 rules in 33 ms. Remains 43 /270 variables (removed 227) and now considering 59/317 (removed 258) transitions.
[2022-05-15 17:35:00] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
// Phase 1: matrix 52 rows 43 cols
[2022-05-15 17:35:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:35:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 17:35:00] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
// Phase 1: matrix 52 rows 43 cols
[2022-05-15 17:35:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:35:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:35:00] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-15 17:35:00] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:35:00] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
// Phase 1: matrix 52 rows 43 cols
[2022-05-15 17:35:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:35:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/270 places, 59/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/270 places, 59/317 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s34 1) (EQ s42 1)) (AND (EQ s12 1) (EQ s42 1))), p2:(EQ s20 0), p1:(OR (EQ s27 0) (EQ s40 0))], 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 644 reset in 152 ms.
Product exploration explored 100000 steps with 626 reset in 260 ms.
Computed a total of 32 stabilizing places and 39 stable transitions
Computed a total of 32 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Finished Best-First random walk after 1123 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=561 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2022-05-15 17:35:01] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
// Phase 1: matrix 52 rows 43 cols
[2022-05-15 17:35:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:35:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-15 17:35:01] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
// Phase 1: matrix 52 rows 43 cols
[2022-05-15 17:35:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:35:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:35:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-15 17:35:01] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:35:01] [INFO ] Flow matrix only has 52 transitions (discarded 7 similar events)
// Phase 1: matrix 52 rows 43 cols
[2022-05-15 17:35:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:35:01] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/43 places, 59/59 transitions.
Computed a total of 32 stabilizing places and 39 stable transitions
Computed a total of 32 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Finished Best-First random walk after 2249 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=749 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 617 reset in 148 ms.
Stack based approach found an accepted trace after 90215 steps with 558 reset with depth 97 and stack size 89 in 141 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-12 finished in 2526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1)||G(p0)))))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Graph (complete) has 538 edges and 270 vertex of which 267 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 266 transition count 274
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 227 transition count 274
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 79 place count 227 transition count 229
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 169 place count 182 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 177 place count 174 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 185 place count 174 transition count 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 191 place count 168 transition count 215
Iterating global reduction 2 with 6 rules applied. Total rules applied 197 place count 168 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 162 transition count 203
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 162 transition count 203
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 215 place count 156 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 156 transition count 197
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 345 place count 94 transition count 135
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 358 place count 81 transition count 109
Iterating global reduction 2 with 13 rules applied. Total rules applied 371 place count 81 transition count 109
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 382 place count 70 transition count 98
Iterating global reduction 2 with 11 rules applied. Total rules applied 393 place count 70 transition count 98
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 404 place count 59 transition count 76
Iterating global reduction 2 with 11 rules applied. Total rules applied 415 place count 59 transition count 76
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 426 place count 48 transition count 65
Iterating global reduction 2 with 11 rules applied. Total rules applied 437 place count 48 transition count 65
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 448 place count 37 transition count 43
Iterating global reduction 2 with 11 rules applied. Total rules applied 459 place count 37 transition count 43
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 470 place count 26 transition count 32
Iterating global reduction 2 with 11 rules applied. Total rules applied 481 place count 26 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 482 place count 26 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 484 place count 24 transition count 29
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 486 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 487 place count 22 transition count 28
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 487 place count 22 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 495 place count 18 transition count 24
Applied a total of 495 rules in 21 ms. Remains 18 /270 variables (removed 252) and now considering 24/317 (removed 293) transitions.
[2022-05-15 17:35:02] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2022-05-15 17:35:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:35:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-15 17:35:02] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2022-05-15 17:35:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:35:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:35:02] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-15 17:35:02] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:35:02] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2022-05-15 17:35:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:35:02] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/270 places, 24/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/270 places, 24/317 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s13 1), p1:(AND (EQ s8 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-13 finished in 172 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((X(!X(p0)) U p0)) U !p0))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 256 transition count 303
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 256 transition count 303
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 248 transition count 295
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 248 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 242 transition count 287
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 242 transition count 287
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 236 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 236 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 230 transition count 271
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 230 transition count 271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 226 transition count 267
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 226 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 225 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 225 transition count 266
Applied a total of 90 rules in 24 ms. Remains 225 /270 variables (removed 45) and now considering 266/317 (removed 51) transitions.
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:35:02] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:35:03] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:35:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:35:03] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 225 cols
[2022-05-15 17:35:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:35:03] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/270 places, 266/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/270 places, 266/317 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, p0, p0, true, true, true]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(AND (EQ s34 1) (EQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-14 finished in 560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 317/317 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 257 transition count 304
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 257 transition count 304
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 249 transition count 296
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 249 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 243 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 243 transition count 288
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 237 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 237 transition count 279
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 231 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 231 transition count 272
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 227 transition count 268
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 227 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 226 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 226 transition count 267
Applied a total of 88 rules in 24 ms. Remains 226 /270 variables (removed 44) and now considering 267/317 (removed 50) transitions.
// Phase 1: matrix 267 rows 226 cols
[2022-05-15 17:35:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:35:03] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 267 rows 226 cols
[2022-05-15 17:35:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:35:03] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 267 rows 226 cols
[2022-05-15 17:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:35:03] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/270 places, 267/317 transitions.
Finished structural reductions, in 1 iterations. Remains : 226/270 places, 267/317 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s64 1), p0:(AND (EQ s160 1) (EQ s222 1) (EQ s85 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 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-15 finished in 490 ms.
All properties solved by simple procedures.
Total runtime 16915 ms.

BK_STOP 1652636104046

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="DiscoveryGPU-PT-14b"
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 DiscoveryGPU-PT-14b, 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 r078-tall-165260109900140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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