Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875300373.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
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 r083-tall-162048875300373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 18:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 104K May 5 16:51 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-00
FORMULA_NAME DiscoveryGPU-PT-14b-01
FORMULA_NAME DiscoveryGPU-PT-14b-02
FORMULA_NAME DiscoveryGPU-PT-14b-03
FORMULA_NAME DiscoveryGPU-PT-14b-04
FORMULA_NAME DiscoveryGPU-PT-14b-05
FORMULA_NAME DiscoveryGPU-PT-14b-06
FORMULA_NAME DiscoveryGPU-PT-14b-07
FORMULA_NAME DiscoveryGPU-PT-14b-08
FORMULA_NAME DiscoveryGPU-PT-14b-09
FORMULA_NAME DiscoveryGPU-PT-14b-10
FORMULA_NAME DiscoveryGPU-PT-14b-11
FORMULA_NAME DiscoveryGPU-PT-14b-12
FORMULA_NAME DiscoveryGPU-PT-14b-13
FORMULA_NAME DiscoveryGPU-PT-14b-14
FORMULA_NAME DiscoveryGPU-PT-14b-15

=== Now, execution of the tool begins

BK_START 1620581493188

Running Version 0
[2021-05-09 17:31:34] [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]
[2021-05-09 17:31:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:31:34] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-09 17:31:34] [INFO ] Transformed 408 places.
[2021-05-09 17:31:34] [INFO ] Transformed 434 transitions.
[2021-05-09 17:31:34] [INFO ] Found NUPN structural information;
[2021-05-09 17:31:34] [INFO ] Parsed PT model containing 408 places and 434 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 17:31:34] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-14b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 408 places. Attempting structural reductions.
Starting structural reductions, 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 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 98 place count 310 transition count 364
Iterating global reduction 1 with 70 rules applied. Total rules applied 168 place count 310 transition count 364
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 179 place count 299 transition count 353
Iterating global reduction 1 with 11 rules applied. Total rules applied 190 place count 299 transition count 353
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 200 place count 289 transition count 343
Iterating global reduction 1 with 10 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 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 224 place count 282 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 230 place count 276 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 236 place count 276 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 241 place count 271 transition count 319
Iterating global reduction 1 with 5 rules applied. Total rules applied 246 place count 271 transition count 319
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 251 place count 266 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 256 place count 266 transition count 314
Applied a total of 256 rules in 117 ms. Remains 266 /408 variables (removed 142) and now considering 314/434 (removed 120) transitions.
// Phase 1: matrix 314 rows 266 cols
[2021-05-09 17:31:35] [INFO ] Computed 2 place invariants in 19 ms
[2021-05-09 17:31:35] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 314 rows 266 cols
[2021-05-09 17:31:35] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 17:31:35] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
// Phase 1: matrix 314 rows 266 cols
[2021-05-09 17:31:35] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:31:35] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 266/408 places, 314/434 transitions.
[2021-05-09 17:31:35] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 17:31:35] [INFO ] Flatten gal took : 48 ms
FORMULA DiscoveryGPU-PT-14b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 17:31:35] [INFO ] Flatten gal took : 19 ms
[2021-05-09 17:31:35] [INFO ] Input system was already deterministic with 314 transitions.
Finished random walk after 7182 steps, including 15 resets, run visited all 20 properties in 50 ms. (steps per millisecond=143 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 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 40 place count 265 transition count 273
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 225 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 224 transition count 272
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 82 place count 224 transition count 227
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 172 place count 179 transition count 227
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 181 place count 170 transition count 218
Iterating global reduction 3 with 9 rules applied. Total rules applied 190 place count 170 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 190 place count 170 transition count 217
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 192 place count 169 transition count 217
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 197 place count 164 transition count 209
Iterating global reduction 3 with 5 rules applied. Total rules applied 202 place count 164 transition count 209
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 207 place count 159 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 212 place count 159 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 157 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 157 transition count 200
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 340 place count 95 transition count 138
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 353 place count 82 transition count 113
Iterating global reduction 3 with 13 rules applied. Total rules applied 366 place count 82 transition count 113
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 379 place count 69 transition count 98
Iterating global reduction 3 with 13 rules applied. Total rules applied 392 place count 69 transition count 98
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 405 place count 56 transition count 73
Iterating global reduction 3 with 13 rules applied. Total rules applied 418 place count 56 transition count 73
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 431 place count 43 transition count 59
Iterating global reduction 3 with 13 rules applied. Total rules applied 444 place count 43 transition count 59
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 456 place count 31 transition count 36
Iterating global reduction 3 with 12 rules applied. Total rules applied 468 place count 31 transition count 36
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 480 place count 19 transition count 23
Iterating global reduction 3 with 12 rules applied. Total rules applied 492 place count 19 transition count 23
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 494 place count 17 transition count 20
Iterating global reduction 3 with 2 rules applied. Total rules applied 496 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 497 place count 16 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 498 place count 16 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 499 place count 16 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 506 place count 13 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 510 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 510 place count 9 transition count 12
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 512 place count 8 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 516 place count 6 transition count 10
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 518 place count 5 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 519 place count 5 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 520 place count 4 transition count 8
Applied a total of 520 rules in 77 ms. Remains 4 /266 variables (removed 262) and now considering 8/314 (removed 306) transitions.
[2021-05-09 17:31:35] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:31:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:31:35] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 17:31:35] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:31:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:31:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:31:36] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-09 17:31:36] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:31:36] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:31:36] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:31:36] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/266 places, 8/314 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-00 finished in 259 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U p1)&&(G((p2 U p3))||G(p4)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 265 transition count 276
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 228 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 227 transition count 275
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 76 place count 227 transition count 230
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 166 place count 182 transition count 230
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 172 place count 176 transition count 224
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 176 transition count 224
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 182 place count 172 transition count 218
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 172 transition count 218
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 189 place count 169 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 192 place count 169 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 193 place count 168 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 168 transition count 213
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 318 place count 106 transition count 151
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 326 place count 98 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 334 place count 98 transition count 136
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 342 place count 90 transition count 127
Iterating global reduction 3 with 8 rules applied. Total rules applied 350 place count 90 transition count 127
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 358 place count 82 transition count 111
Iterating global reduction 3 with 8 rules applied. Total rules applied 366 place count 82 transition count 111
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 374 place count 74 transition count 103
Iterating global reduction 3 with 8 rules applied. Total rules applied 382 place count 74 transition count 103
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 390 place count 66 transition count 87
Iterating global reduction 3 with 8 rules applied. Total rules applied 398 place count 66 transition count 87
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 406 place count 58 transition count 79
Iterating global reduction 3 with 8 rules applied. Total rules applied 414 place count 58 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 415 place count 57 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 416 place count 57 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 417 place count 56 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 418 place count 56 transition count 76
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 3 with 2 rules applied. Total rules applied 420 place count 55 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 421 place count 54 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 422 place count 54 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 423 place count 53 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 424 place count 53 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 425 place count 52 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 426 place count 52 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 427 place count 51 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 428 place count 51 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 429 place count 50 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 430 place count 50 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 431 place count 49 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 432 place count 49 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 433 place count 48 transition count 65
Iterating global reduction 3 with 1 rules applied. Total rules applied 434 place count 48 transition count 65
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 48 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 47 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 437 place count 46 transition count 63
Applied a total of 437 rules in 80 ms. Remains 46 /266 variables (removed 220) and now considering 63/314 (removed 251) transitions.
[2021-05-09 17:31:36] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
// Phase 1: matrix 55 rows 46 cols
[2021-05-09 17:31:36] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:31:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-09 17:31:36] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
// Phase 1: matrix 55 rows 46 cols
[2021-05-09 17:31:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2021-05-09 17:31:36] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2021-05-09 17:31:36] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 17:31:36] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
// Phase 1: matrix 55 rows 46 cols
[2021-05-09 17:31:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/266 places, 63/314 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p1) (AND (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4)), (NOT p1), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-14b-01 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p4))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p1 p3 p4) (AND p1 p2 p4) (AND p0 p3 p4) (AND p0 p2 p4)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p4)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p3) p2 p4) (AND p0 (NOT p3) p2 p4)), acceptance={0} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3) (NOT p2) p4) (AND p0 (NOT p3) (NOT p2) p4)), acceptance={0} source=0 dest: 4}, { cond=(OR (AND p1 p3 (NOT p4)) (AND p1 p2 (NOT p4)) (AND p0 p3 (NOT p4)) (AND p0 p2 (NOT p4))), acceptance={1} source=0 dest: 5}, { cond=(OR (AND p1 (NOT p3) p2 (NOT p4)) (AND p0 (NOT p3) p2 (NOT p4))), acceptance={0, 1} source=0 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p3 p4) (AND p2 p4)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2 p4), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p4), acceptance={0} source=1 dest: 4}, { cond=(OR (AND p3 (NOT p4)) (AND p2 (NOT p4))), acceptance={1} source=1 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={0, 1} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p3) p2 p4), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p4), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={0, 1} source=3 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p2) (NOT p4))), acceptance={0, 1} source=4 dest: 0}, { cond=(OR (AND p1 p3 p4) (AND p1 p2 p4) (AND p0 p3 p4) (AND p0 p2 p4)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p1) p0 p3 (NOT p4)) (AND (NOT p1) p0 p2 (NOT p4))), acceptance={0, 1} source=4 dest: 2}, { cond=(OR (AND p1 (NOT p3) p2 p4) (AND p0 (NOT p3) p2 p4)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p3) (NOT p2) p4)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p1 p3 (NOT p4)) (AND p1 p2 (NOT p4)) (AND p0 p3 (NOT p4)) (AND p0 p2 (NOT p4))), acceptance={1} source=4 dest: 5}, { cond=(OR (AND p1 (NOT p3) p2 (NOT p4)) (AND p0 (NOT p3) p2 (NOT p4))), acceptance={0, 1} source=4 dest: 6}, { cond=(OR (AND (NOT p1) p0 p3 p4) (AND (NOT p1) p0 p2 p4)), acceptance={0} source=4 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) (NOT p4))), acceptance={0, 1} source=5 dest: 0}, { cond=(OR (AND p1 p3 p4) (AND p1 p2 p4) (AND p0 p3 p4) (AND p0 p2 p4)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2) p4), acceptance={0, 1} source=5 dest: 2}, { cond=(OR (AND p1 (NOT p3) p2 p4) (AND p0 (NOT p3) p2 p4)), acceptance={0} source=5 dest: 3}, { cond=(OR (AND p1 (NOT p3) (NOT p2) p4) (AND p0 (NOT p3) (NOT p2) p4)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2) (AND p3 (NOT p4)) (AND p2 (NOT p4))), acceptance={1} source=5 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3) p2) (AND (NOT p3) p2 (NOT p4))), acceptance={0, 1} source=5 dest: 6}, { cond=(OR (AND (NOT p1) p0 p3 p4) (AND (NOT p1) p0 p2 p4)), acceptance={1} source=5 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p3) p2 p4), acceptance={0, 1} source=5 dest: 9}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) (NOT p4))), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2) p4), acceptance={0, 1} source=6 dest: 2}, { cond=(OR (AND p1 (NOT p3) p2 p4) (AND p0 (NOT p3) p2 p4)), acceptance={0} source=6 dest: 3}, { cond=(OR (AND p1 (NOT p3) (NOT p2) p4) (AND p0 (NOT p3) (NOT p2) p4)), acceptance={0} source=6 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3) p2) (AND (NOT p3) p2 (NOT p4))), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2 p4), acceptance={0, 1} source=6 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p0 p4), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=8 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)), acceptance={1} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0, 1} source=8 dest: 6}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={1} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0, 1} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0, 1} source=9 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0, 1} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s43 1), p0:(EQ s21 1), p3:(AND (EQ s36 1) (EQ s45 1)), p2:(AND (EQ s4 1) (EQ s45 1)), p4:(EQ s29 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-01 finished in 653 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((F(p1)||p0))||G(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 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 39 place count 265 transition count 274
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 226 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 78 place count 226 transition count 229
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 168 place count 181 transition count 229
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 177 place count 172 transition count 220
Iterating global reduction 2 with 9 rules applied. Total rules applied 186 place count 172 transition count 220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 190 place count 168 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 194 place count 168 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 198 place count 164 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 202 place count 164 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 204 place count 162 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 206 place count 162 transition count 206
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 332 place count 99 transition count 143
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 344 place count 87 transition count 120
Iterating global reduction 2 with 12 rules applied. Total rules applied 356 place count 87 transition count 120
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 368 place count 75 transition count 106
Iterating global reduction 2 with 12 rules applied. Total rules applied 380 place count 75 transition count 106
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 391 place count 64 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 402 place count 64 transition count 85
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 412 place count 54 transition count 74
Iterating global reduction 2 with 10 rules applied. Total rules applied 422 place count 54 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 432 place count 44 transition count 55
Iterating global reduction 2 with 10 rules applied. Total rules applied 442 place count 44 transition count 55
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 452 place count 34 transition count 44
Iterating global reduction 2 with 10 rules applied. Total rules applied 462 place count 34 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 464 place count 32 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 466 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 467 place count 31 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 468 place count 31 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 469 place count 30 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 470 place count 29 transition count 38
Applied a total of 470 rules in 56 ms. Remains 29 /266 variables (removed 237) and now considering 38/314 (removed 276) transitions.
[2021-05-09 17:31:36] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 29 cols
[2021-05-09 17:31:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:36] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-09 17:31:36] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 29 cols
[2021-05-09 17:31:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:31:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:31:36] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-09 17:31:36] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 17:31:36] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 29 cols
[2021-05-09 17:31:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:31:36] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/266 places, 38/314 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s26 0)), p2:(EQ s16 1), p1:(AND (EQ s23 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 807 reset in 271 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA DiscoveryGPU-PT-14b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-03 finished in 455 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 254 transition count 302
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 254 transition count 302
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 245 transition count 289
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 245 transition count 289
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 238 transition count 282
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 238 transition count 282
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 231 transition count 272
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 231 transition count 272
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 228 transition count 269
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 228 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 226 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 226 transition count 267
Applied a total of 80 rules in 22 ms. Remains 226 /266 variables (removed 40) and now considering 267/314 (removed 47) transitions.
// Phase 1: matrix 267 rows 226 cols
[2021-05-09 17:31:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:37] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 267 rows 226 cols
[2021-05-09 17:31:37] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 17:31:37] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 267 rows 226 cols
[2021-05-09 17:31:37] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:31:37] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Finished structural reductions, in 1 iterations. Remains : 226/266 places, 267/314 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 692 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-14b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-05 finished in 379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 256 transition count 304
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 256 transition count 304
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 249 transition count 294
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 249 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 244 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 244 transition count 289
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 239 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 239 transition count 282
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 237 transition count 280
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 237 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 235 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 235 transition count 278
Applied a total of 62 rules in 22 ms. Remains 235 /266 variables (removed 31) and now considering 278/314 (removed 36) transitions.
// Phase 1: matrix 278 rows 235 cols
[2021-05-09 17:31:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:37] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 278 rows 235 cols
[2021-05-09 17:31:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:37] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 278 rows 235 cols
[2021-05-09 17:31:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:37] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/266 places, 278/314 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s142 1), p0:(AND (EQ s95 1) (EQ s231 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 412 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-06 finished in 380 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0) U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 255 transition count 303
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 255 transition count 303
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 247 transition count 292
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 247 transition count 292
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 242 transition count 287
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 242 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 237 transition count 280
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 237 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 235 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 235 transition count 278
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 233 transition count 276
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 233 transition count 276
Applied a total of 66 rules in 19 ms. Remains 233 /266 variables (removed 33) and now considering 276/314 (removed 38) transitions.
// Phase 1: matrix 276 rows 233 cols
[2021-05-09 17:31:38] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:31:38] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 276 rows 233 cols
[2021-05-09 17:31:38] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 17:31:38] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 276 rows 233 cols
[2021-05-09 17:31:38] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:38] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 233/266 places, 276/314 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s150 1) (EQ s232 1)), p1:(AND (EQ s196 1) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 473 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-07 finished in 449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 254 transition count 302
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 254 transition count 302
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 245 transition count 289
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 245 transition count 289
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 238 transition count 282
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 238 transition count 282
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 231 transition count 272
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 231 transition count 272
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 228 transition count 269
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 228 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 225 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 225 transition count 266
Applied a total of 82 rules in 21 ms. Remains 225 /266 variables (removed 41) and now considering 266/314 (removed 48) transitions.
// Phase 1: matrix 266 rows 225 cols
[2021-05-09 17:31:38] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:31:38] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 266 rows 225 cols
[2021-05-09 17:31:38] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:31:38] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 225 cols
[2021-05-09 17:31:38] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:38] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 225/266 places, 266/314 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, p0, (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-14b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s122 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 431 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-09 finished in 381 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 255 transition count 303
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 255 transition count 303
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 246 transition count 290
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 246 transition count 290
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 239 transition count 283
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 239 transition count 283
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 233 transition count 274
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 233 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 230 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 230 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 227 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 227 transition count 268
Applied a total of 78 rules in 20 ms. Remains 227 /266 variables (removed 39) and now considering 268/314 (removed 46) transitions.
// Phase 1: matrix 268 rows 227 cols
[2021-05-09 17:31:38] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:31:38] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 268 rows 227 cols
[2021-05-09 17:31:38] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 17:31:39] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 227 cols
[2021-05-09 17:31:39] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:31:39] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 227/266 places, 268/314 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s64 1), p0:(NEQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Graph (complete) has 460 edges and 227 vertex of which 226 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 227 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 227/227 places, 268/268 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 227 transition count 268
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 44 Pre rules applied. Total rules applied 28 place count 227 transition count 395
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 72 place count 227 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 227 transition count 395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 226 transition count 394
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 226 transition count 394
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -134
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 135 place count 226 transition count 528
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 147 place count 214 transition count 480
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 159 place count 214 transition count 480
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 195 place count 178 transition count 384
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 231 place count 178 transition count 384
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 267 place count 142 transition count 300
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 303 place count 142 transition count 300
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 315 place count 130 transition count 276
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 327 place count 130 transition count 276
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 350 place count 107 transition count 220
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 373 place count 107 transition count 220
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 417 place count 63 transition count 110
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 461 place count 63 transition count 110
Deduced a syphon composed of 39 places in 0 ms
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 472 place count 63 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 474 place count 61 transition count 95
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 476 place count 61 transition count 95
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 476 rules in 41 ms. Remains 61 /227 variables (removed 166) and now considering 95/268 (removed 173) transitions.
[2021-05-09 17:31:40] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-09 17:31:40] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 61 cols
[2021-05-09 17:31:40] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:31:40] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/227 places, 95/268 transitions.
Product exploration explored 100000 steps with 50000 reset in 629 ms.
Product exploration explored 100000 steps with 50000 reset in 543 ms.
[2021-05-09 17:31:41] [INFO ] Flatten gal took : 13 ms
[2021-05-09 17:31:41] [INFO ] Flatten gal took : 13 ms
[2021-05-09 17:31:41] [INFO ] Time to serialize gal into /tmp/LTL8448195398370568899.gal : 6 ms
[2021-05-09 17:31:41] [INFO ] Time to serialize properties into /tmp/LTL10518472782450761099.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8448195398370568899.gal, -t, CGAL, -LTL, /tmp/LTL10518472782450761099.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8448195398370568899.gal -t CGAL -LTL /tmp/LTL10518472782450761099.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p268!=1)")))U("(p96!=1)"))))
Formula 0 simplified : !X(FG"(p268!=1)" U "(p96!=1)")
Detected timeout of ITS tools.
[2021-05-09 17:31:57] [INFO ] Flatten gal took : 14 ms
[2021-05-09 17:31:57] [INFO ] Applying decomposition
[2021-05-09 17:31:57] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4439754518178655405.txt, -o, /tmp/graph4439754518178655405.bin, -w, /tmp/graph4439754518178655405.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4439754518178655405.bin, -l, -1, -v, -w, /tmp/graph4439754518178655405.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 17:31:57] [INFO ] Decomposing Gal with order
[2021-05-09 17:31:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 17:31:57] [INFO ] Removed a total of 108 redundant transitions.
[2021-05-09 17:31:57] [INFO ] Flatten gal took : 56 ms
[2021-05-09 17:31:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2021-05-09 17:31:57] [INFO ] Time to serialize gal into /tmp/LTL8354472222861933675.gal : 5 ms
[2021-05-09 17:31:57] [INFO ] Time to serialize properties into /tmp/LTL11324981066424194745.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8354472222861933675.gal, -t, CGAL, -LTL, /tmp/LTL11324981066424194745.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8354472222861933675.gal -t CGAL -LTL /tmp/LTL11324981066424194745.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(u54.p268!=1)")))U("(i9.u27.p96!=1)"))))
Formula 0 simplified : !X(FG"(u54.p268!=1)" U "(i9.u27.p96!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5780375694982369018
[2021-05-09 17:32:12] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5780375694982369018
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5780375694982369018]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5780375694982369018] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5780375694982369018] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DiscoveryGPU-PT-14b-10 finished in 34457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 265 transition count 272
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 224 transition count 272
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 82 place count 224 transition count 227
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 172 place count 179 transition count 227
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 180 place count 171 transition count 219
Iterating global reduction 2 with 8 rules applied. Total rules applied 188 place count 171 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 188 place count 171 transition count 218
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 190 place count 170 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 195 place count 165 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 200 place count 165 transition count 210
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 160 transition count 203
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 160 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 212 place count 158 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 214 place count 158 transition count 201
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 340 place count 95 transition count 138
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 353 place count 82 transition count 113
Iterating global reduction 2 with 13 rules applied. Total rules applied 366 place count 82 transition count 113
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 379 place count 69 transition count 98
Iterating global reduction 2 with 13 rules applied. Total rules applied 392 place count 69 transition count 98
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 405 place count 56 transition count 73
Iterating global reduction 2 with 13 rules applied. Total rules applied 418 place count 56 transition count 73
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 431 place count 43 transition count 59
Iterating global reduction 2 with 13 rules applied. Total rules applied 444 place count 43 transition count 59
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 457 place count 30 transition count 34
Iterating global reduction 2 with 13 rules applied. Total rules applied 470 place count 30 transition count 34
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 483 place count 17 transition count 20
Iterating global reduction 2 with 13 rules applied. Total rules applied 496 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 498 place count 15 transition count 17
Iterating global reduction 2 with 2 rules applied. Total rules applied 500 place count 15 transition count 17
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 501 place count 14 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 502 place count 14 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 503 place count 13 transition count 15
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 505 place count 12 transition count 14
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 507 place count 11 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 508 place count 10 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 512 place count 8 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 513 place count 7 transition count 10
Applied a total of 513 rules in 28 ms. Remains 7 /266 variables (removed 259) and now considering 10/314 (removed 304) transitions.
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 7 cols
[2021-05-09 17:32:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:32:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 7 cols
[2021-05-09 17:32:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:32:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:32:13] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-09 17:32:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 7 cols
[2021-05-09 17:32:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:32:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/266 places, 10/314 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-12 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 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 40 place count 265 transition count 273
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 225 transition count 273
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 80 place count 225 transition count 228
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 170 place count 180 transition count 228
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 178 place count 172 transition count 220
Iterating global reduction 2 with 8 rules applied. Total rules applied 186 place count 172 transition count 220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 190 place count 168 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 194 place count 168 transition count 213
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 198 place count 164 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 202 place count 164 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 203 place count 163 transition count 207
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 163 transition count 207
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 332 place count 99 transition count 143
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 344 place count 87 transition count 120
Iterating global reduction 2 with 12 rules applied. Total rules applied 356 place count 87 transition count 120
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 368 place count 75 transition count 106
Iterating global reduction 2 with 12 rules applied. Total rules applied 380 place count 75 transition count 106
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 392 place count 63 transition count 83
Iterating global reduction 2 with 12 rules applied. Total rules applied 404 place count 63 transition count 83
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 416 place count 51 transition count 70
Iterating global reduction 2 with 12 rules applied. Total rules applied 428 place count 51 transition count 70
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 440 place count 39 transition count 47
Iterating global reduction 2 with 12 rules applied. Total rules applied 452 place count 39 transition count 47
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 464 place count 27 transition count 34
Iterating global reduction 2 with 12 rules applied. Total rules applied 476 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 478 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 481 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 482 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 484 place count 24 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 485 place count 23 transition count 27
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 488 place count 22 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 490 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 490 place count 20 transition count 21
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 498 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 499 place count 15 transition count 20
Applied a total of 499 rules in 29 ms. Remains 15 /266 variables (removed 251) and now considering 20/314 (removed 294) transitions.
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 17:32:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:32:13] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 17:32:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:32:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:32:13] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-09 17:32:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 17:32:13] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-09 17:32:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/266 places, 20/314 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s9 1) (NEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 619 reset in 117 ms.
Stack based approach found an accepted trace after 1992 steps with 12 reset with depth 37 and stack size 33 in 4 ms.
FORMULA DiscoveryGPU-PT-14b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-14 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 314/314 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 40 place count 265 transition count 273
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 225 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 224 transition count 272
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 82 place count 224 transition count 227
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 172 place count 179 transition count 227
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 181 place count 170 transition count 218
Iterating global reduction 3 with 9 rules applied. Total rules applied 190 place count 170 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 190 place count 170 transition count 217
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 192 place count 169 transition count 217
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 197 place count 164 transition count 209
Iterating global reduction 3 with 5 rules applied. Total rules applied 202 place count 164 transition count 209
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 207 place count 159 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 212 place count 159 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 157 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 157 transition count 200
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 340 place count 95 transition count 138
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 353 place count 82 transition count 113
Iterating global reduction 3 with 13 rules applied. Total rules applied 366 place count 82 transition count 113
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 379 place count 69 transition count 98
Iterating global reduction 3 with 13 rules applied. Total rules applied 392 place count 69 transition count 98
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 405 place count 56 transition count 73
Iterating global reduction 3 with 13 rules applied. Total rules applied 418 place count 56 transition count 73
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 431 place count 43 transition count 59
Iterating global reduction 3 with 13 rules applied. Total rules applied 444 place count 43 transition count 59
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 456 place count 31 transition count 36
Iterating global reduction 3 with 12 rules applied. Total rules applied 468 place count 31 transition count 36
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 480 place count 19 transition count 23
Iterating global reduction 3 with 12 rules applied. Total rules applied 492 place count 19 transition count 23
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 494 place count 17 transition count 20
Iterating global reduction 3 with 2 rules applied. Total rules applied 496 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 497 place count 16 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 498 place count 16 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 499 place count 16 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 506 place count 13 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 510 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 510 place count 9 transition count 12
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 512 place count 8 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 516 place count 6 transition count 10
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 518 place count 5 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 519 place count 5 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 520 place count 4 transition count 8
Applied a total of 520 rules in 34 ms. Remains 4 /266 variables (removed 262) and now considering 8/314 (removed 306) transitions.
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:32:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:32:13] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:32:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:32:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:32:13] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-09 17:32:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:32:13] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 17:32:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:32:13] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/266 places, 8/314 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-15 finished in 126 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18031047700000789524
[2021-05-09 17:32:13] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2021-05-09 17:32:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 17:32:13] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2021-05-09 17:32:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 17:32:13] [INFO ] Applying decomposition
[2021-05-09 17:32:13] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2021-05-09 17:32:13] [INFO ] Flatten gal took : 16 ms
[2021-05-09 17:32:13] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 17:32:13] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18031047700000789524
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18031047700000789524]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12588703165356365616.txt, -o, /tmp/graph12588703165356365616.bin, -w, /tmp/graph12588703165356365616.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12588703165356365616.bin, -l, -1, -v, -w, /tmp/graph12588703165356365616.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 17:32:13] [INFO ] Decomposing Gal with order
[2021-05-09 17:32:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 17:32:13] [INFO ] Removed a total of 127 redundant transitions.
[2021-05-09 17:32:13] [INFO ] Flatten gal took : 23 ms
[2021-05-09 17:32:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2021-05-09 17:32:13] [INFO ] Time to serialize gal into /tmp/LTLFireability8528940254854325521.gal : 3 ms
[2021-05-09 17:32:13] [INFO ] Time to serialize properties into /tmp/LTLFireability16783746467847494299.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8528940254854325521.gal, -t, CGAL, -LTL, /tmp/LTLFireability16783746467847494299.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8528940254854325521.gal -t CGAL -LTL /tmp/LTLFireability16783746467847494299.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i21.u67.p268!=1)")))U("(i10.u25.p96!=1)"))))
Formula 0 simplified : !X(FG"(i21.u67.p268!=1)" U "(i10.u25.p96!=1)")
Compilation finished in 1566 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin18031047700000789524]
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>([]((LTLAPp0==true))) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin18031047700000789524]
LTSmin run took 221 ms.
FORMULA DiscoveryGPU-PT-14b-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620581536510

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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 r083-tall-162048875300373"
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 ;