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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K 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.3K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 39K 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-11a-00
FORMULA_NAME DiscoveryGPU-PT-11a-01
FORMULA_NAME DiscoveryGPU-PT-11a-02
FORMULA_NAME DiscoveryGPU-PT-11a-03
FORMULA_NAME DiscoveryGPU-PT-11a-04
FORMULA_NAME DiscoveryGPU-PT-11a-05
FORMULA_NAME DiscoveryGPU-PT-11a-06
FORMULA_NAME DiscoveryGPU-PT-11a-07
FORMULA_NAME DiscoveryGPU-PT-11a-08
FORMULA_NAME DiscoveryGPU-PT-11a-09
FORMULA_NAME DiscoveryGPU-PT-11a-10
FORMULA_NAME DiscoveryGPU-PT-11a-11
FORMULA_NAME DiscoveryGPU-PT-11a-12
FORMULA_NAME DiscoveryGPU-PT-11a-13
FORMULA_NAME DiscoveryGPU-PT-11a-14
FORMULA_NAME DiscoveryGPU-PT-11a-15

=== Now, execution of the tool begins

BK_START 1620576351191

Running Version 0
[2021-05-09 16:05:52] [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:05:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:05:52] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-09 16:05:52] [INFO ] Transformed 113 places.
[2021-05-09 16:05:52] [INFO ] Transformed 155 transitions.
[2021-05-09 16:05:52] [INFO ] Found NUPN structural information;
[2021-05-09 16:05:52] [INFO ] Parsed PT model containing 113 places and 155 transitions in 80 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:05:52] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-11a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 107 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 107 transition count 149
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 101 transition count 143
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 101 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 98 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 98 transition count 137
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 98 transition count 129
Applied a total of 38 rules in 32 ms. Remains 98 /113 variables (removed 15) and now considering 129/155 (removed 26) transitions.
// Phase 1: matrix 129 rows 98 cols
[2021-05-09 16:05:52] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 16:05:52] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 129 rows 98 cols
[2021-05-09 16:05:52] [INFO ] Computed 2 place invariants in 8 ms
[2021-05-09 16:05:52] [INFO ] State equation strengthened by 82 read => feed constraints.
[2021-05-09 16:05:53] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 98 cols
[2021-05-09 16:05:53] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:05:53] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/113 places, 129/155 transitions.
[2021-05-09 16:05:53] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 16:05:53] [INFO ] Flatten gal took : 32 ms
FORMULA DiscoveryGPU-PT-11a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:05:53] [INFO ] Flatten gal took : 12 ms
[2021-05-09 16:05:53] [INFO ] Input system was already deterministic with 129 transitions.
Finished random walk after 1483 steps, including 13 resets, run visited all 29 properties in 14 ms. (steps per millisecond=105 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p1)||F(p2))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 87 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 83 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 83 transition count 114
Applied a total of 30 rules in 11 ms. Remains 83 /98 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 83 cols
[2021-05-09 16:05:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:05:53] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 114 rows 83 cols
[2021-05-09 16:05:53] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:05:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-09 16:05:53] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 125 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:05:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:53] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 82/98 places, 114/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:05:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/98 places, 114/129 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-11a-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}]], initial=2, aps=[p2:(NEQ s27 1), p1:(OR (NEQ s73 1) (NEQ s81 1) (NEQ s34 1) (NEQ s81 1)), p0:(AND (EQ s34 1) (EQ s81 1) (EQ s65 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 1 ms.
FORMULA DiscoveryGPU-PT-11a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-00 finished in 492 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G((F(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 98 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 12 place count 89 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 89 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 86 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 86 transition count 117
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 0 with 4 rules applied. Total rules applied 28 place count 84 transition count 115
Applied a total of 28 rules in 27 ms. Remains 84 /98 variables (removed 14) and now considering 115/129 (removed 14) transitions.
// Phase 1: matrix 115 rows 84 cols
[2021-05-09 16:05:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:05:53] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 115 rows 84 cols
[2021-05-09 16:05:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:05:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 122 ms to find 1 implicit places.
[2021-05-09 16:05:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 115 rows 83 cols
[2021-05-09 16:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 83/98 places, 115/129 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 62 transition count 94
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 54 transition count 78
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 54 transition count 78
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 46 transition count 62
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 46 transition count 62
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 38 transition count 54
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 38 transition count 54
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 30 transition count 38
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 30 transition count 38
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 114 place count 22 transition count 30
Iterating global reduction 0 with 8 rules applied. Total rules applied 122 place count 22 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 123 place count 22 transition count 30
Applied a total of 123 rules in 18 ms. Remains 22 /83 variables (removed 61) and now considering 30/115 (removed 85) transitions.
[2021-05-09 16:05:54] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 22 cols
[2021-05-09 16:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 16:05:54] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 22 cols
[2021-05-09 16:05:54] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:54] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/98 places, 30/129 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s13 1) (EQ s21 1)) (AND (EQ s7 1) (EQ s21 1))), p2:(AND (EQ s13 1) (EQ s21 1)), p0:(OR (EQ s14 1) (AND (EQ s7 1) (EQ s21 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 3 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-01 finished in 328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 89 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 89 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 86 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 86 transition count 117
Applied a total of 24 rules in 6 ms. Remains 86 /98 variables (removed 12) and now considering 117/129 (removed 12) transitions.
// Phase 1: matrix 117 rows 86 cols
[2021-05-09 16:05:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 117 rows 86 cols
[2021-05-09 16:05:54] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 16:05:54] [INFO ] State equation strengthened by 79 read => feed constraints.
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 115 ms to find 1 implicit places.
// Phase 1: matrix 117 rows 85 cols
[2021-05-09 16:05:54] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:54] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 85/98 places, 117/129 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 85 cols
[2021-05-09 16:05:54] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:54] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 85/98 places, 117/129 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s60 0), p1:(OR (NEQ s49 1) (NEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 248 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-02 finished in 310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 98 transition count 124
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 17 place count 86 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 86 transition count 117
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 82 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 82 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 81 transition count 112
Applied a total of 34 rules in 14 ms. Remains 81 /98 variables (removed 17) and now considering 112/129 (removed 17) transitions.
// Phase 1: matrix 112 rows 81 cols
[2021-05-09 16:05:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 112 rows 81 cols
[2021-05-09 16:05:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:05:54] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 94 ms to find 1 implicit places.
[2021-05-09 16:05:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 80 cols
[2021-05-09 16:05:54] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 80/98 places, 112/129 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 59 transition count 91
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 49 transition count 71
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 49 transition count 71
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 39 transition count 51
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 39 transition count 51
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 29 transition count 41
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 29 transition count 41
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 20 transition count 23
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 20 transition count 23
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 129 place count 11 transition count 14
Iterating global reduction 0 with 9 rules applied. Total rules applied 138 place count 11 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 11 transition count 14
Applied a total of 139 rules in 13 ms. Remains 11 /80 variables (removed 69) and now considering 14/112 (removed 98) transitions.
[2021-05-09 16:05:54] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2021-05-09 16:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 16:05:54] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2021-05-09 16:05:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/98 places, 14/129 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-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:(AND (EQ s8 1) (EQ s10 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-03 finished in 244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1&&G(p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 89 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 89 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 86 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 86 transition count 117
Applied a total of 24 rules in 5 ms. Remains 86 /98 variables (removed 12) and now considering 117/129 (removed 12) transitions.
// Phase 1: matrix 117 rows 86 cols
[2021-05-09 16:05:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 117 rows 86 cols
[2021-05-09 16:05:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:05:54] [INFO ] State equation strengthened by 79 read => feed constraints.
[2021-05-09 16:05:54] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 86 cols
[2021-05-09 16:05:54] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:05:54] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/98 places, 117/129 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s18 1) (OR (EQ s55 0) (EQ s84 0))), p1:(OR (EQ s18 1) (AND (EQ s42 1) (EQ s85 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-04 finished in 242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 87 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 83 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 83 transition count 114
Applied a total of 30 rules in 3 ms. Remains 83 /98 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 83 cols
[2021-05-09 16:05:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:05:55] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 114 rows 83 cols
[2021-05-09 16:05:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:05:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-09 16:05:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:05:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 82/98 places, 114/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:05:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/98 places, 114/129 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-06 finished in 256 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)||F(G(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 98 transition count 124
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 17 place count 86 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 86 transition count 117
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 82 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 82 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 81 transition count 112
Applied a total of 34 rules in 11 ms. Remains 81 /98 variables (removed 17) and now considering 112/129 (removed 17) transitions.
// Phase 1: matrix 112 rows 81 cols
[2021-05-09 16:05:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:05:55] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 112 rows 81 cols
[2021-05-09 16:05:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:05:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-09 16:05:55] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2021-05-09 16:05:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 81 cols
[2021-05-09 16:05:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:05:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/98 places, 112/129 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s34 1) (EQ s80 1)) (EQ s58 1)), p0:(AND (EQ s74 1) (EQ s79 1)), p2:(OR (NEQ s71 1) (NEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 942 reset in 260 ms.
Stack based approach found an accepted trace after 807 steps with 7 reset with depth 19 and stack size 19 in 3 ms.
FORMULA DiscoveryGPU-PT-11a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-07 finished in 504 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 87 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 83 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 83 transition count 114
Applied a total of 30 rules in 2 ms. Remains 83 /98 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 83 cols
[2021-05-09 16:05:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:05:55] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 114 rows 83 cols
[2021-05-09 16:05:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:05:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-09 16:05:55] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 106 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:05:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:05:55] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 82/98 places, 114/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:05:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:55] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/98 places, 114/129 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 205 ms.
Product exploration explored 100000 steps with 33333 reset in 206 ms.
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 175 ms.
Product exploration explored 100000 steps with 33333 reset in 236 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 82/82 places, 114/114 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 82 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 114
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 24 place count 82 transition count 136
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 72 transition count 116
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 72 transition count 116
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 63 place count 53 transition count 78
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 19 rules applied. Total rules applied 82 place count 53 transition count 78
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 44 transition count 69
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 44 transition count 69
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 35 transition count 51
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 35 transition count 51
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 136 place count 17 transition count 24
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 154 place count 17 transition count 24
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 154 rules in 12 ms. Remains 17 /82 variables (removed 65) and now considering 24/114 (removed 90) transitions.
[2021-05-09 16:05:57] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:05:57] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 17 cols
[2021-05-09 16:05:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:05:57] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/82 places, 24/114 transitions.
Product exploration explored 100000 steps with 33333 reset in 364 ms.
Product exploration explored 100000 steps with 33333 reset in 338 ms.
[2021-05-09 16:05:57] [INFO ] Flatten gal took : 18 ms
[2021-05-09 16:05:57] [INFO ] Flatten gal took : 9 ms
[2021-05-09 16:05:57] [INFO ] Time to serialize gal into /tmp/LTL4460656613254417019.gal : 2 ms
[2021-05-09 16:05:57] [INFO ] Time to serialize properties into /tmp/LTL2666594756644022930.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/LTL4460656613254417019.gal, -t, CGAL, -LTL, /tmp/LTL2666594756644022930.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/LTL4460656613254417019.gal -t CGAL -LTL /tmp/LTL2666594756644022930.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p46!=1)")))))
Formula 0 simplified : !XXF"(p46!=1)"
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t41, t43, t45, t47, t49, t51, t113, t114, t116, t117, t118, t120, t121, t123, t124, t125, t126, t128, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/91/23/114
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
888 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.89433,232584,1,0,163,1.06029e+06,254,109,2536,1.37684e+06,244
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-11a-09 finished in 12530 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(((p0 U p1)&&G(p2)))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 98 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 12 place count 89 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 89 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 86 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 86 transition count 117
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 0 with 4 rules applied. Total rules applied 28 place count 84 transition count 115
Applied a total of 28 rules in 10 ms. Remains 84 /98 variables (removed 14) and now considering 115/129 (removed 14) transitions.
// Phase 1: matrix 115 rows 84 cols
[2021-05-09 16:06:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:06:08] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 115 rows 84 cols
[2021-05-09 16:06:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:06:08] [INFO ] State equation strengthened by 79 read => feed constraints.
[2021-05-09 16:06:08] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2021-05-09 16:06:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 115 rows 84 cols
[2021-05-09 16:06:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:06:08] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/98 places, 115/129 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s82 1)), p2:(AND (EQ s61 1) (EQ s83 1)), p0:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-10 finished in 301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 111 edges and 95 vertex of which 44 / 95 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 73 transition count 103
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 75 place count 48 transition count 81
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 82 place count 41 transition count 67
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 41 transition count 67
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 41 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 40 transition count 66
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 99 place count 32 transition count 50
Iterating global reduction 4 with 8 rules applied. Total rules applied 107 place count 32 transition count 50
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 32 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 109 place count 31 transition count 49
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 118 place count 22 transition count 31
Iterating global reduction 6 with 9 rules applied. Total rules applied 127 place count 22 transition count 31
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 136 place count 13 transition count 20
Iterating global reduction 6 with 9 rules applied. Total rules applied 145 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 147 place count 11 transition count 17
Iterating global reduction 6 with 2 rules applied. Total rules applied 149 place count 11 transition count 17
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 10 transition count 16
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 10 transition count 16
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 6 with 4 rules applied. Total rules applied 155 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 8 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 6 transition count 11
Applied a total of 158 rules in 11 ms. Remains 6 /98 variables (removed 92) and now considering 11/129 (removed 118) transitions.
[2021-05-09 16:06:08] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:06:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:06:08] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 16:06:08] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:06:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:06:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:06:08] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-09 16:06:08] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:06:08] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:06:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:06:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/98 places, 11/129 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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-11a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-11 finished in 71 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U (p1&&G(p2)))||X(p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 87 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 83 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 83 transition count 114
Applied a total of 30 rules in 3 ms. Remains 83 /98 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 83 cols
[2021-05-09 16:06:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:06:08] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 114 rows 83 cols
[2021-05-09 16:06:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:06:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-09 16:06:08] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:06:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:06:08] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 82/98 places, 114/129 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 82 cols
[2021-05-09 16:06:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:06:08] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/98 places, 114/129 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={} source=3 dest: 7}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=7 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 7}, { cond=(AND p2 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s66 0) (EQ s81 0)), p0:(AND (EQ s55 1) (EQ s81 1)), p2:(AND (EQ s66 1) (EQ s81 1)), p3:(OR (NEQ s75 1) (NEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33415 reset in 191 ms.
Product exploration explored 100000 steps with 33434 reset in 206 ms.
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, (NOT p0), (NOT p2), p3]
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33421 reset in 194 ms.
Product exploration explored 100000 steps with 33449 reset in 205 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 82/82 places, 114/114 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 82 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 114
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 82 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 32 place count 73 transition count 117
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 73 transition count 117
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 58 place count 56 transition count 83
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 75 place count 56 transition count 83
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 83 place count 48 transition count 75
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 48 transition count 75
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 99 place count 40 transition count 59
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 107 place count 40 transition count 59
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 122 place count 25 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 15 rules applied. Total rules applied 137 place count 25 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 137 rules in 8 ms. Remains 25 /82 variables (removed 57) and now considering 36/114 (removed 78) transitions.
[2021-05-09 16:06:10] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 16:06:10] [INFO ] Flow matrix only has 33 transitions (discarded 3 similar events)
// Phase 1: matrix 33 rows 25 cols
[2021-05-09 16:06:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:06:10] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/82 places, 36/114 transitions.
Product exploration explored 100000 steps with 33290 reset in 309 ms.
Product exploration explored 100000 steps with 33375 reset in 297 ms.
[2021-05-09 16:06:11] [INFO ] Flatten gal took : 7 ms
[2021-05-09 16:06:11] [INFO ] Flatten gal took : 5 ms
[2021-05-09 16:06:11] [INFO ] Time to serialize gal into /tmp/LTL837456680375041889.gal : 1 ms
[2021-05-09 16:06:11] [INFO ] Time to serialize properties into /tmp/LTL12168172356656688937.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/LTL837456680375041889.gal, -t, CGAL, -LTL, /tmp/LTL12168172356656688937.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/LTL837456680375041889.gal -t CGAL -LTL /tmp/LTL12168172356656688937.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("((p76==1)&&(p111==1))")U(("((p90==0)||(p111==0))")&&(G("((p90==1)&&(p111==1))"))))||(X("((p105!=1)||(p111!=1))")))))
Formula 0 simplified : !G(("((p76==1)&&(p111==1))" U ("((p90==0)||(p111==0))" & G"((p90==1)&&(p111==1))")) | X"((p105!=1)||(p111!=1))")
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t41, t43, t45, t47, t49, t51, t113, t114, t116, t117, t118, t120, t121, t123, t124, t125, t126, t128, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/91/23/114
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1107 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.09,303804,1,0,170,1.46057e+06,274,120,2693,1.67448e+06,291
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-11a-13 finished in 15036 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p0) U G(p1)) U G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 88 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 88 transition count 119
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 84 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 84 transition count 115
Applied a total of 28 rules in 3 ms. Remains 84 /98 variables (removed 14) and now considering 115/129 (removed 14) transitions.
// Phase 1: matrix 115 rows 84 cols
[2021-05-09 16:06:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:06:23] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 115 rows 84 cols
[2021-05-09 16:06:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:06:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-09 16:06:23] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 84 cols
[2021-05-09 16:06:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:06:23] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/98 places, 115/129 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), true, (AND p1 (NOT p0)), (NOT p1), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=8 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (NEQ s75 1) (NEQ s83 1)), p1:(OR (NEQ s35 1) (NEQ s82 1)), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25006 reset in 216 ms.
Product exploration explored 100000 steps with 24979 reset in 229 ms.
Graph (complete) has 264 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), true, (AND p1 (NOT p0)), (NOT p1), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 25004 reset in 213 ms.
Entered a terminal (fully accepting) state of product in 15657 steps with 3897 reset in 35 ms.
FORMULA DiscoveryGPU-PT-11a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-14 finished in 1349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 129/129 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 98 transition count 124
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 17 place count 86 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 86 transition count 117
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 82 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 82 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 81 transition count 112
Applied a total of 34 rules in 11 ms. Remains 81 /98 variables (removed 17) and now considering 112/129 (removed 17) transitions.
// Phase 1: matrix 112 rows 81 cols
[2021-05-09 16:06:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:06:25] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 112 rows 81 cols
[2021-05-09 16:06:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:06:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-09 16:06:25] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2021-05-09 16:06:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 81 cols
[2021-05-09 16:06:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:06:25] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/98 places, 112/129 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s62 1) (EQ s80 1)), p1:(AND (EQ s34 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3786 reset in 168 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA DiscoveryGPU-PT-11a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-15 finished in 390 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620576386302

--------------------
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-11a"
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-11a, 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-162048875200317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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