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-162048875300341.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-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875300341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K 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.6K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 89K 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-12b-00
FORMULA_NAME DiscoveryGPU-PT-12b-01
FORMULA_NAME DiscoveryGPU-PT-12b-02
FORMULA_NAME DiscoveryGPU-PT-12b-03
FORMULA_NAME DiscoveryGPU-PT-12b-04
FORMULA_NAME DiscoveryGPU-PT-12b-05
FORMULA_NAME DiscoveryGPU-PT-12b-06
FORMULA_NAME DiscoveryGPU-PT-12b-07
FORMULA_NAME DiscoveryGPU-PT-12b-08
FORMULA_NAME DiscoveryGPU-PT-12b-09
FORMULA_NAME DiscoveryGPU-PT-12b-10
FORMULA_NAME DiscoveryGPU-PT-12b-11
FORMULA_NAME DiscoveryGPU-PT-12b-12
FORMULA_NAME DiscoveryGPU-PT-12b-13
FORMULA_NAME DiscoveryGPU-PT-12b-14
FORMULA_NAME DiscoveryGPU-PT-12b-15

=== Now, execution of the tool begins

BK_START 1620579090131

Running Version 0
[2021-05-09 16:51:31] [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 16:51:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:51:31] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-09 16:51:31] [INFO ] Transformed 352 places.
[2021-05-09 16:51:31] [INFO ] Transformed 374 transitions.
[2021-05-09 16:51:31] [INFO ] Found NUPN structural information;
[2021-05-09 16:51:31] [INFO ] Parsed PT model containing 352 places and 374 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 16:51:31] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-12b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 328 transition count 374
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 79 place count 273 transition count 319
Iterating global reduction 1 with 55 rules applied. Total rules applied 134 place count 273 transition count 319
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 144 place count 263 transition count 309
Iterating global reduction 1 with 10 rules applied. Total rules applied 154 place count 263 transition count 309
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 162 place count 255 transition count 301
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 255 transition count 301
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 247 transition count 293
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 247 transition count 293
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 192 place count 241 transition count 281
Iterating global reduction 1 with 6 rules applied. Total rules applied 198 place count 241 transition count 281
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 204 place count 235 transition count 275
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 235 transition count 275
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 215 place count 230 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 220 place count 230 transition count 270
Applied a total of 220 rules in 98 ms. Remains 230 /352 variables (removed 122) and now considering 270/374 (removed 104) transitions.
// Phase 1: matrix 270 rows 230 cols
[2021-05-09 16:51:32] [INFO ] Computed 2 place invariants in 20 ms
[2021-05-09 16:51:32] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 270 rows 230 cols
[2021-05-09 16:51:32] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 16:51:32] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
// Phase 1: matrix 270 rows 230 cols
[2021-05-09 16:51:32] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:51:32] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 1 iterations. Remains : 230/352 places, 270/374 transitions.
[2021-05-09 16:51:32] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 16:51:32] [INFO ] Flatten gal took : 50 ms
FORMULA DiscoveryGPU-PT-12b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:51:32] [INFO ] Flatten gal took : 20 ms
[2021-05-09 16:51:32] [INFO ] Input system was already deterministic with 270 transitions.
Incomplete random walk after 100000 steps, including 257 resets, run finished after 355 ms. (steps per millisecond=281 ) properties (out of 27) seen :24
Running SMT prover for 3 properties.
// Phase 1: matrix 270 rows 230 cols
[2021-05-09 16:51:33] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:51:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 16:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:51:33] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2021-05-09 16:51:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 16:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:51:33] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
[2021-05-09 16:51:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 16:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:51:33] [INFO ] [Real]Absence check using state equation in 127 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X((p1||X(p2))))) U (p3 U p4)))], workingDir=/home/mcc/execution]
Support contains 6 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 256
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 212 transition count 250
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 212 transition count 250
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 207 transition count 245
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 207 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 203 transition count 239
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 203 transition count 239
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 200 transition count 235
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 200 transition count 235
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 197 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 197 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 196 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 196 transition count 231
Applied a total of 68 rules in 73 ms. Remains 196 /230 variables (removed 34) and now considering 231/270 (removed 39) transitions.
// Phase 1: matrix 231 rows 196 cols
[2021-05-09 16:51:33] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:51:33] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 231 rows 196 cols
[2021-05-09 16:51:34] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:51:34] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 231 rows 196 cols
[2021-05-09 16:51:34] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:51:34] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 196/230 places, 231/270 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p4), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p2), true, (AND (NOT p2) (NOT p4)), (NOT p4)]
Running random walk in product with property : DiscoveryGPU-PT-12b-00 automaton TGBA [mat=[[{ cond=(NOT p4), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p4) p3 (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p4) p3 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p4) p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p4:(EQ s45 1), p3:(EQ s12 1), p0:(EQ s14 0), p1:(AND (EQ s28 1) (EQ s192 1)), p2:(AND (EQ s140 1) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 947 steps with 2 reset in 21 ms.
FORMULA DiscoveryGPU-PT-12b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-00 finished in 876 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 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 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 229 transition count 232
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 192 transition count 232
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 74 place count 192 transition count 196
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 146 place count 156 transition count 196
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 151 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 151 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 159 place count 148 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 148 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 146 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 146 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 144 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 144 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 143 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 143 transition count 180
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 290 place count 84 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 300 place count 74 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 310 place count 74 transition count 102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 320 place count 64 transition count 91
Iterating global reduction 2 with 10 rules applied. Total rules applied 330 place count 64 transition count 91
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 340 place count 54 transition count 71
Iterating global reduction 2 with 10 rules applied. Total rules applied 350 place count 54 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 360 place count 44 transition count 61
Iterating global reduction 2 with 10 rules applied. Total rules applied 370 place count 44 transition count 61
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 380 place count 34 transition count 41
Iterating global reduction 2 with 10 rules applied. Total rules applied 390 place count 34 transition count 41
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 400 place count 24 transition count 31
Iterating global reduction 2 with 10 rules applied. Total rules applied 410 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 411 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 413 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 414 place count 22 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 415 place count 22 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 417 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 424 place count 19 transition count 21
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 429 place count 14 transition count 21
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 443 place count 7 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 445 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 446 place count 6 transition count 11
Applied a total of 446 rules in 83 ms. Remains 6 /230 variables (removed 224) and now considering 11/270 (removed 259) transitions.
[2021-05-09 16:51:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:51:34] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:51:34] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 16:51:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:51:34] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:51:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:51:34] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-09 16:51:34] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:51:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:51:34] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:51:34] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/230 places, 11/270 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-01 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 s4 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 1 ms.
FORMULA DiscoveryGPU-PT-12b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-01 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(X((p0 U p1))))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 256
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 212 transition count 250
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 212 transition count 250
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 207 transition count 245
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 207 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 203 transition count 239
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 203 transition count 239
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 200 transition count 235
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 200 transition count 235
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 197 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 197 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 196 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 196 transition count 231
Applied a total of 68 rules in 49 ms. Remains 196 /230 variables (removed 34) and now considering 231/270 (removed 39) transitions.
// Phase 1: matrix 231 rows 196 cols
[2021-05-09 16:51:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:34] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 231 rows 196 cols
[2021-05-09 16:51:34] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:51:35] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 231 rows 196 cols
[2021-05-09 16:51:35] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:51:35] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 196/230 places, 231/270 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-12b-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p2, acceptance={} source=7 dest: 4}, { cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(EQ s63 1), p0:(AND (EQ s46 1) (EQ s192 1)), p2:(AND (EQ s67 1) (EQ s192 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-02 finished in 576 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 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 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 229 transition count 232
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 192 transition count 232
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 74 place count 192 transition count 196
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 146 place count 156 transition count 196
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 151 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 151 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 159 place count 148 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 148 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 146 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 146 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 144 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 144 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 143 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 143 transition count 180
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 290 place count 84 transition count 121
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 301 place count 73 transition count 100
Iterating global reduction 2 with 11 rules applied. Total rules applied 312 place count 73 transition count 100
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 323 place count 62 transition count 87
Iterating global reduction 2 with 11 rules applied. Total rules applied 334 place count 62 transition count 87
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 344 place count 52 transition count 68
Iterating global reduction 2 with 10 rules applied. Total rules applied 354 place count 52 transition count 68
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 364 place count 42 transition count 57
Iterating global reduction 2 with 10 rules applied. Total rules applied 374 place count 42 transition count 57
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 384 place count 32 transition count 38
Iterating global reduction 2 with 10 rules applied. Total rules applied 394 place count 32 transition count 38
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 404 place count 22 transition count 27
Iterating global reduction 2 with 10 rules applied. Total rules applied 414 place count 22 transition count 27
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 20 transition count 24
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 419 place count 19 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 19 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 19 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 19 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 423 place count 18 transition count 21
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 430 place count 16 transition count 16
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 435 place count 11 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 445 place count 6 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 446 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 5 transition count 9
Applied a total of 447 rules in 52 ms. Remains 5 /230 variables (removed 225) and now considering 9/270 (removed 261) transitions.
[2021-05-09 16:51:35] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:51:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:51:35] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 16:51:35] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:51:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:51:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:51:35] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 16:51:35] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:51:35] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:51:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:51:35] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/230 places, 9/270 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-03 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:(NEQ s2 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 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-03 finished in 143 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X(G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 256
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 213 transition count 251
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 213 transition count 251
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 209 transition count 247
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 209 transition count 247
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 206 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 206 transition count 243
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 204 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 204 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 202 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 202 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 201 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 201 transition count 237
Applied a total of 58 rules in 40 ms. Remains 201 /230 variables (removed 29) and now considering 237/270 (removed 33) transitions.
// Phase 1: matrix 237 rows 201 cols
[2021-05-09 16:51:35] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:35] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 237 rows 201 cols
[2021-05-09 16:51:35] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:35] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 237 rows 201 cols
[2021-05-09 16:51:35] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:35] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 201/230 places, 237/270 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12b-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s80 1) (EQ s197 1)), p0:(AND (EQ s149 1) (EQ s197 1)), p2:(EQ s26 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-04 finished in 413 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 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 229 transition count 231
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 191 transition count 231
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 76 place count 191 transition count 197
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 144 place count 157 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 153 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 153 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 151 transition count 190
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 151 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 150 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 150 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 149 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 149 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 148 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 148 transition count 186
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 284 place count 87 transition count 125
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 294 place count 77 transition count 106
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 77 transition count 106
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 314 place count 67 transition count 94
Iterating global reduction 2 with 10 rules applied. Total rules applied 324 place count 67 transition count 94
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 334 place count 57 transition count 75
Iterating global reduction 2 with 10 rules applied. Total rules applied 344 place count 57 transition count 75
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 354 place count 47 transition count 64
Iterating global reduction 2 with 10 rules applied. Total rules applied 364 place count 47 transition count 64
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 374 place count 37 transition count 45
Iterating global reduction 2 with 10 rules applied. Total rules applied 384 place count 37 transition count 45
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 394 place count 27 transition count 34
Iterating global reduction 2 with 10 rules applied. Total rules applied 404 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 406 place count 25 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 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 412 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 413 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 416 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 418 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 418 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 426 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 427 place count 15 transition count 20
Applied a total of 427 rules in 38 ms. Remains 15 /230 variables (removed 215) and now considering 20/270 (removed 250) transitions.
[2021-05-09 16:51:36] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 16:51:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:51:36] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-09 16:51:36] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 16:51:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:51:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:51:36] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-09 16:51:36] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:51:36] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 16:51:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:51:36] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/230 places, 20/270 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s14 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 145 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-05 finished in 117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(p1))) U X(G(p2))))], workingDir=/home/mcc/execution]
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 218 transition count 258
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 218 transition count 258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 214 transition count 253
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 214 transition count 253
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 210 transition count 249
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 210 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 206 transition count 243
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 206 transition count 243
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 203 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 203 transition count 239
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 200 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 200 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 199 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 199 transition count 235
Applied a total of 62 rules in 26 ms. Remains 199 /230 variables (removed 31) and now considering 235/270 (removed 35) transitions.
// Phase 1: matrix 235 rows 199 cols
[2021-05-09 16:51:36] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 16:51:36] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 235 rows 199 cols
[2021-05-09 16:51:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:36] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 235 rows 199 cols
[2021-05-09 16:51:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:36] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 1 iterations. Remains : 199/230 places, 235/270 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), true, (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
Running random walk in product with property : DiscoveryGPU-PT-12b-06 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(NEQ s64 0), p0:(EQ s64 1), p1:(EQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-06 finished in 442 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F((p0&&F((p1||(X(G((p0&&X(p3))))&&p2)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 218 transition count 257
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 218 transition count 257
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 213 transition count 251
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 213 transition count 251
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 208 transition count 246
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 208 transition count 246
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 204 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 204 transition count 240
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 201 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 201 transition count 236
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 198 transition count 233
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 198 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 197 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 197 transition count 232
Applied a total of 66 rules in 21 ms. Remains 197 /230 variables (removed 33) and now considering 232/270 (removed 38) transitions.
// Phase 1: matrix 232 rows 197 cols
[2021-05-09 16:51:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:36] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 232 rows 197 cols
[2021-05-09 16:51:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:36] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 197 cols
[2021-05-09 16:51:36] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:36] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/230 places, 232/270 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-12b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 4}]], initial=0, aps=[p0:(EQ s76 1), p1:(EQ s82 1), p2:(AND (EQ s27 1) (EQ s193 1)), p3:(AND (EQ s27 1) (EQ s193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 506 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-12b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-07 finished in 548 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 216 transition count 255
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 216 transition count 255
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 211 transition count 249
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 211 transition count 249
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 206 transition count 244
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 206 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 202 transition count 238
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 202 transition count 238
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 199 transition count 234
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 199 transition count 234
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 196 transition count 231
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 195 transition count 230
Applied a total of 70 rules in 15 ms. Remains 195 /230 variables (removed 35) and now considering 230/270 (removed 40) transitions.
// Phase 1: matrix 230 rows 195 cols
[2021-05-09 16:51:37] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:51:37] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 230 rows 195 cols
[2021-05-09 16:51:37] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 16:51:37] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 195 cols
[2021-05-09 16:51:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:37] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 195/230 places, 230/270 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s96 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 380 ms.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Graph (complete) has 396 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 195 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 195/195 places, 230/230 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 195 transition count 230
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 24 place count 195 transition count 341
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 64 place count 195 transition count 341
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 195 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 194 transition count 340
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 194 transition count 340
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -122
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 118 place count 194 transition count 462
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 129 place count 183 transition count 418
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 140 place count 183 transition count 418
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 173 place count 150 transition count 330
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 206 place count 150 transition count 330
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 237 place count 119 transition count 259
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 268 place count 119 transition count 259
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 278 place count 109 transition count 239
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 288 place count 109 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 308 place count 89 transition count 189
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 328 place count 89 transition count 189
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 368 place count 49 transition count 89
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 408 place count 49 transition count 89
Deduced a syphon composed of 32 places in 0 ms
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 421 place count 49 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 423 place count 47 transition count 72
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 425 place count 47 transition count 72
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 425 rules in 34 ms. Remains 47 /195 variables (removed 148) and now considering 72/230 (removed 158) transitions.
[2021-05-09 16:51:38] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 16:51:38] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
// Phase 1: matrix 68 rows 47 cols
[2021-05-09 16:51:38] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:51:38] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 47/195 places, 72/230 transitions.
Product exploration explored 100000 steps with 50000 reset in 502 ms.
Product exploration explored 100000 steps with 50000 reset in 487 ms.
[2021-05-09 16:51:39] [INFO ] Flatten gal took : 11 ms
[2021-05-09 16:51:39] [INFO ] Flatten gal took : 11 ms
[2021-05-09 16:51:39] [INFO ] Time to serialize gal into /tmp/LTL17048931830408261746.gal : 6 ms
[2021-05-09 16:51:39] [INFO ] Time to serialize properties into /tmp/LTL11128965874060865934.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/LTL17048931830408261746.gal, -t, CGAL, -LTL, /tmp/LTL11128965874060865934.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/LTL17048931830408261746.gal -t CGAL -LTL /tmp/LTL11128965874060865934.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p166!=1)"))))
Formula 0 simplified : !XF"(p166!=1)"
Detected timeout of ITS tools.
[2021-05-09 16:51:54] [INFO ] Flatten gal took : 16 ms
[2021-05-09 16:51:54] [INFO ] Applying decomposition
[2021-05-09 16:51:54] [INFO ] Flatten gal took : 14 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/graph1664462555811761577.txt, -o, /tmp/graph1664462555811761577.bin, -w, /tmp/graph1664462555811761577.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/graph1664462555811761577.bin, -l, -1, -v, -w, /tmp/graph1664462555811761577.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:51:54] [INFO ] Decomposing Gal with order
[2021-05-09 16:51:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:51:55] [INFO ] Removed a total of 93 redundant transitions.
[2021-05-09 16:51:55] [INFO ] Flatten gal took : 46 ms
[2021-05-09 16:51:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 6 ms.
[2021-05-09 16:51:55] [INFO ] Time to serialize gal into /tmp/LTL7193577502341376754.gal : 4 ms
[2021-05-09 16:51:55] [INFO ] Time to serialize properties into /tmp/LTL6542009809364677570.ltl : 9 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/LTL7193577502341376754.gal, -t, CGAL, -LTL, /tmp/LTL6542009809364677570.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/LTL7193577502341376754.gal -t CGAL -LTL /tmp/LTL6542009809364677570.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i11.u33.p166!=1)"))))
Formula 0 simplified : !XF"(i11.u33.p166!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15049731854708332547
[2021-05-09 16:52:10] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15049731854708332547
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/ltsmin15049731854708332547]
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/ltsmin15049731854708332547] 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/ltsmin15049731854708332547] 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-12b-09 finished in 34075 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 229 transition count 231
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 191 transition count 231
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 76 place count 191 transition count 196
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 146 place count 156 transition count 196
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 151 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 151 transition count 190
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 149 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 149 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 148 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 148 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 147 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 147 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 146 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 146 transition count 184
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 286 place count 86 transition count 124
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 296 place count 76 transition count 105
Iterating global reduction 2 with 10 rules applied. Total rules applied 306 place count 76 transition count 105
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 316 place count 66 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 326 place count 66 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 336 place count 56 transition count 74
Iterating global reduction 2 with 10 rules applied. Total rules applied 346 place count 56 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 356 place count 46 transition count 63
Iterating global reduction 2 with 10 rules applied. Total rules applied 366 place count 46 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 376 place count 36 transition count 44
Iterating global reduction 2 with 10 rules applied. Total rules applied 386 place count 36 transition count 44
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 396 place count 26 transition count 33
Iterating global reduction 2 with 10 rules applied. Total rules applied 406 place count 26 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 408 place count 24 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 410 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 411 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 23 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 413 place count 23 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 414 place count 22 transition count 28
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 417 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 419 place count 19 transition count 26
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 429 place count 14 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 430 place count 13 transition count 20
Applied a total of 430 rules in 43 ms. Remains 13 /230 variables (removed 217) and now considering 20/270 (removed 250) transitions.
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 13 cols
[2021-05-09 16:52:11] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:52:11] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 13 cols
[2021-05-09 16:52:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:52:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:52:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-09 16:52:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 13 cols
[2021-05-09 16:52:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:52:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/230 places, 20/270 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s12 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-12b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-12 finished in 140 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 229 transition count 231
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 191 transition count 231
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 76 place count 191 transition count 195
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 148 place count 155 transition count 195
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 152 place count 151 transition count 190
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 151 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 159 place count 148 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 148 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 146 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 146 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 144 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 144 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 143 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 143 transition count 180
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 292 place count 83 transition count 120
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 303 place count 72 transition count 99
Iterating global reduction 2 with 11 rules applied. Total rules applied 314 place count 72 transition count 99
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 325 place count 61 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 336 place count 61 transition count 86
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 347 place count 50 transition count 65
Iterating global reduction 2 with 11 rules applied. Total rules applied 358 place count 50 transition count 65
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 369 place count 39 transition count 53
Iterating global reduction 2 with 11 rules applied. Total rules applied 380 place count 39 transition count 53
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 391 place count 28 transition count 32
Iterating global reduction 2 with 11 rules applied. Total rules applied 402 place count 28 transition count 32
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 413 place count 17 transition count 20
Iterating global reduction 2 with 11 rules applied. Total rules applied 424 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 426 place count 15 transition count 17
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 15 transition count 17
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 429 place count 14 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 430 place count 14 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 14 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 13 transition count 14
Applied a total of 432 rules in 24 ms. Remains 13 /230 variables (removed 217) and now considering 14/270 (removed 256) transitions.
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2021-05-09 16:52:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:52:11] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2021-05-09 16:52:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:52:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-09 16:52:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-09 16:52:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2021-05-09 16:52:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:52:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/230 places, 14/270 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s11 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 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-14 finished in 108 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 230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 230/230 places, 270/270 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 229 transition count 231
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 191 transition count 231
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 76 place count 191 transition count 195
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 148 place count 155 transition count 195
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 153 place count 150 transition count 189
Iterating global reduction 2 with 5 rules applied. Total rules applied 158 place count 150 transition count 189
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 147 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 147 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 166 place count 145 transition count 183
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 145 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 170 place count 143 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 143 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 142 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 142 transition count 179
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 290 place count 84 transition count 121
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 301 place count 73 transition count 100
Iterating global reduction 2 with 11 rules applied. Total rules applied 312 place count 73 transition count 100
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 323 place count 62 transition count 87
Iterating global reduction 2 with 11 rules applied. Total rules applied 334 place count 62 transition count 87
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 345 place count 51 transition count 66
Iterating global reduction 2 with 11 rules applied. Total rules applied 356 place count 51 transition count 66
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 367 place count 40 transition count 54
Iterating global reduction 2 with 11 rules applied. Total rules applied 378 place count 40 transition count 54
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 389 place count 29 transition count 33
Iterating global reduction 2 with 11 rules applied. Total rules applied 400 place count 29 transition count 33
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 411 place count 18 transition count 21
Iterating global reduction 2 with 11 rules applied. Total rules applied 422 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 424 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 426 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 427 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 15 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 430 place count 14 transition count 15
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 437 place count 12 transition count 10
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 442 place count 7 transition count 10
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 4 with 4 rules applied. Total rules applied 446 place count 5 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 5 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 448 place count 4 transition count 6
Applied a total of 448 rules in 25 ms. Remains 4 /230 variables (removed 226) and now considering 6/270 (removed 264) transitions.
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-09 16:52:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:52:11] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-09 16:52:11] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:52:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:52:11] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-09 16:52:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:52:11] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-09 16:52:11] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:52:11] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/230 places, 6/270 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-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 s1 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-12b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-15 finished in 128 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13154416703183484493
[2021-05-09 16:52:11] [INFO ] Applying decomposition
[2021-05-09 16:52:11] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2021-05-09 16:52:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 16:52:11] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2021-05-09 16:52:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 16:52:11] [INFO ] Flatten gal took : 12 ms
[2021-05-09 16:52:11] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2021-05-09 16:52:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph10863861425407527272.txt, -o, /tmp/graph10863861425407527272.bin, -w, /tmp/graph10863861425407527272.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/graph10863861425407527272.bin, -l, -1, -v, -w, /tmp/graph10863861425407527272.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:52:11] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13154416703183484493
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/ltsmin13154416703183484493]
[2021-05-09 16:52:11] [INFO ] Decomposing Gal with order
[2021-05-09 16:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:52:11] [INFO ] Removed a total of 98 redundant transitions.
[2021-05-09 16:52:11] [INFO ] Flatten gal took : 39 ms
[2021-05-09 16:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2021-05-09 16:52:11] [INFO ] Time to serialize gal into /tmp/LTLFireability1591310204390218437.gal : 4 ms
[2021-05-09 16:52:11] [INFO ] Time to serialize properties into /tmp/LTLFireability2170743510171813844.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/LTLFireability1591310204390218437.gal, -t, CGAL, -LTL, /tmp/LTLFireability2170743510171813844.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/LTLFireability1591310204390218437.gal -t CGAL -LTL /tmp/LTLFireability2170743510171813844.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i13.i0.u39.p166!=1)"))))
Formula 0 simplified : !XF"(i13.i0.u39.p166!=1)"
Compilation finished in 1248 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13154416703183484493]
Link finished in 51 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin13154416703183484493]
LTSmin run took 412 ms.
FORMULA DiscoveryGPU-PT-12b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620579134060

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

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