Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109800067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.9K Apr 30 07:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 07:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 07:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 36K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652630680651

Running Version 202205111006
[2022-05-15 16:04:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:04:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:04:41] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2022-05-15 16:04:41] [INFO ] Transformed 103 places.
[2022-05-15 16:04:41] [INFO ] Transformed 141 transitions.
[2022-05-15 16:04:41] [INFO ] Found NUPN structural information;
[2022-05-15 16:04:41] [INFO ] Parsed PT model containing 103 places and 141 transitions in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 91 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 91 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 88 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 88 transition count 123
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 37 place count 88 transition count 116
Applied a total of 37 rules in 24 ms. Remains 88 /103 variables (removed 15) and now considering 116/141 (removed 25) transitions.
// Phase 1: matrix 116 rows 88 cols
[2022-05-15 16:04:42] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 16:04:42] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 116 rows 88 cols
[2022-05-15 16:04:42] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 16:04:42] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-15 16:04:42] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 353 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/103 places, 116/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 87/103 places, 116/141 transitions.
Support contains 22 out of 87 places after structural reductions.
[2022-05-15 16:04:42] [INFO ] Flatten gal took : 31 ms
[2022-05-15 16:04:42] [INFO ] Flatten gal took : 11 ms
[2022-05-15 16:04:42] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 21 out of 87 places (down from 22) after GAL structural reductions.
Finished random walk after 613 steps, including 5 resets, run visited all 13 properties in 50 ms. (steps per millisecond=12 )
Computed a total of 12 stabilizing places and 11 stable transitions
Graph (complete) has 221 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||X(p1)))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 79 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 79 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 76 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 76 transition count 105
Applied a total of 22 rules in 10 ms. Remains 76 /87 variables (removed 11) and now considering 105/116 (removed 11) transitions.
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:42] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 16:04:42] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:04:43] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 16:04:43] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:43] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-15 16:04:43] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/87 places, 105/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/87 places, 105/116 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (EQ s15 0) (EQ s57 1)), p0:(AND (EQ s16 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-00 finished in 533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&F(F(p1))))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 82 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 82 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 81 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 81 transition count 110
Applied a total of 12 rules in 18 ms. Remains 81 /87 variables (removed 6) and now considering 110/116 (removed 6) transitions.
// Phase 1: matrix 110 rows 81 cols
[2022-05-15 16:04:43] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 16:04:43] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 110 rows 81 cols
[2022-05-15 16:04:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:04:43] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-15 16:04:43] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 81 cols
[2022-05-15 16:04:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:04:43] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/87 places, 110/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/87 places, 110/116 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NEQ s44 0) (NEQ s18 1)), p0:(OR (EQ s35 0) (EQ s46 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 253 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Computed a total of 12 stabilizing places and 11 stable transitions
Graph (complete) has 214 edges and 81 vertex of which 78 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-02 finished in 1057 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Graph (complete) has 221 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 97 edges and 81 vertex of which 70 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 76 edges and 70 vertex of which 38 / 70 are part of one of the 19 SCC in 2 ms
Free SCC test removed 19 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 91
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 41 place count 42 transition count 72
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 49 place count 34 transition count 56
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 34 transition count 56
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 26 transition count 40
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 26 transition count 40
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 18 transition count 24
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 18 transition count 24
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 10 transition count 16
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 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 2 with 4 rules applied. Total rules applied 109 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 6 transition count 11
Applied a total of 112 rules in 20 ms. Remains 6 /87 variables (removed 81) and now considering 11/116 (removed 105) transitions.
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:44] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:44] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-15 16:04:44] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:04:44] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/87 places, 11/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/87 places, 11/116 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s4 0) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-03 finished in 122 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U !F(!p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Graph (complete) has 221 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 97 edges and 81 vertex of which 70 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 75 edges and 70 vertex of which 36 / 70 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 52 transition count 91
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 41 place count 43 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 42 transition count 72
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 50 place count 34 transition count 56
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 34 transition count 56
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 66 place count 26 transition count 40
Iterating global reduction 3 with 8 rules applied. Total rules applied 74 place count 26 transition count 40
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 81 place count 19 transition count 26
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 19 transition count 26
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 95 place count 12 transition count 19
Iterating global reduction 3 with 7 rules applied. Total rules applied 102 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 10 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 10 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 7 transition count 13
Applied a total of 111 rules in 12 ms. Remains 7 /87 variables (removed 80) and now considering 13/116 (removed 103) transitions.
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 7 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:44] [INFO ] Implicit Places using invariants in 12 ms returned []
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 7 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:04:44] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2022-05-15 16:04:44] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 7 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/87 places, 13/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/87 places, 13/116 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-04 finished in 125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 79 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 79 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 76 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 76 transition count 105
Applied a total of 22 rules in 9 ms. Remains 76 /87 variables (removed 11) and now considering 105/116 (removed 11) transitions.
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:04:44] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:04:44] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 16:04:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:04:44] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/87 places, 105/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/87 places, 105/116 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s22 0) (NEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2507 steps with 94 reset in 19 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-07 finished in 260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Graph (complete) has 221 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 97 edges and 81 vertex of which 70 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 78 edges and 70 vertex of which 38 / 70 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 90
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 43 place count 41 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 33 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 33 transition count 55
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 25 transition count 39
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 83 place count 17 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 91 place count 17 transition count 23
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 9 transition count 15
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 9 transition count 15
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 2 with 4 rules applied. Total rules applied 111 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 5 transition count 10
Applied a total of 114 rules in 6 ms. Remains 5 /87 variables (removed 82) and now considering 10/116 (removed 106) transitions.
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:44] [INFO ] Implicit Places using invariants in 13 ms returned []
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:44] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2022-05-15 16:04:44] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:04:44] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:04:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:45] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/87 places, 10/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/87 places, 10/116 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 0)], 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 98 steps with 3 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-10 finished in 132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 78 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 78 transition count 107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 76 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 76 transition count 105
Applied a total of 22 rules in 5 ms. Remains 76 /87 variables (removed 11) and now considering 105/116 (removed 11) transitions.
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:04:45] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:45] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 16:04:45] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 16:04:45] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:45] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 16:04:45] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/87 places, 105/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/87 places, 105/116 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-12 finished in 309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(G(p0))))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Graph (complete) has 221 edges and 87 vertex of which 84 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 98 edges and 82 vertex of which 73 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Graph (trivial) has 80 edges and 73 vertex of which 40 / 73 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 53 transition count 93
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 44 place count 43 transition count 73
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 52 place count 35 transition count 57
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 35 transition count 57
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 27 transition count 41
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 27 transition count 41
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 20 transition count 27
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 20 transition count 27
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 97 place count 13 transition count 20
Iterating global reduction 2 with 7 rules applied. Total rules applied 104 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 8 transition count 14
Applied a total of 113 rules in 13 ms. Remains 8 /87 variables (removed 79) and now considering 14/116 (removed 102) transitions.
[2022-05-15 16:04:45] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:04:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:45] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 16:04:45] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:04:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:04:45] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-15 16:04:45] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:04:45] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:04:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:04:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/87 places, 14/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/87 places, 14/116 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s6 0) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-13 finished in 106 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G(p0))||X(p1)))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 79 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 79 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 76 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 76 transition count 105
Applied a total of 22 rules in 2 ms. Remains 76 /87 variables (removed 11) and now considering 105/116 (removed 11) transitions.
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:04:45] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:45] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 16:04:45] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 16:04:45] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 76 cols
[2022-05-15 16:04:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:04:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/87 places, 105/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/87 places, 105/116 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s72 0) (EQ s42 1)), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-14 finished in 283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(p0)))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 116/116 transitions.
Graph (complete) has 221 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 97 edges and 81 vertex of which 70 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 75 edges and 70 vertex of which 38 / 70 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 91
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 41 place count 42 transition count 72
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 50 place count 33 transition count 54
Iterating global reduction 2 with 9 rules applied. Total rules applied 59 place count 33 transition count 54
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 25 transition count 38
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 25 transition count 38
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 82 place count 18 transition count 24
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 18 transition count 24
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 11 transition count 17
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 11 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 10 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 10 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 7 transition count 12
Applied a total of 110 rules in 8 ms. Remains 7 /87 variables (removed 80) and now considering 12/116 (removed 104) transitions.
[2022-05-15 16:04:45] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2022-05-15 16:04:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 16:04:45] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2022-05-15 16:04:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-15 16:04:45] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:04:45] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2022-05-15 16:04:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:04:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/87 places, 12/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/87 places, 12/116 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-15 finished in 122 ms.
All properties solved by simple procedures.
Total runtime 4162 ms.

BK_STOP 1652630685968

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-10a"
export BK_EXAMINATION="LTLCardinality"
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-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260109800067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10a.tgz
mv DiscoveryGPU-PT-10a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;