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-165260109700035.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-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109700035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 8.7K Apr 30 07:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 30 07:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 06:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:57 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.6K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 28K 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-08a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652628911699

Running Version 202205111006
[2022-05-15 15:35:12] [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 15:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:35:13] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-15 15:35:13] [INFO ] Transformed 83 places.
[2022-05-15 15:35:13] [INFO ] Transformed 113 transitions.
[2022-05-15 15:35:13] [INFO ] Found NUPN structural information;
[2022-05-15 15:35:13] [INFO ] Parsed PT model containing 83 places and 113 transitions in 163 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 3 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 110
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 78 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 78 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 76 transition count 104
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 76 transition count 98
Applied a total of 20 rules in 21 ms. Remains 76 /83 variables (removed 7) and now considering 98/113 (removed 15) transitions.
// Phase 1: matrix 98 rows 76 cols
[2022-05-15 15:35:13] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 15:35:13] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 98 rows 76 cols
[2022-05-15 15:35:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:13] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-05-15 15:35:13] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/83 places, 98/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 75/83 places, 98/113 transitions.
Support contains 24 out of 75 places after structural reductions.
[2022-05-15 15:35:13] [INFO ] Flatten gal took : 26 ms
[2022-05-15 15:35:13] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:35:13] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 98 rows 75 cols
[2022-05-15 15:35:13] [INFO ] Computed 1 place invariants in 11 ms
[2022-05-15 15:35:13] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:35:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 15:35:13] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 185 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||G(p1))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Graph (complete) has 185 edges and 75 vertex of which 72 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 80 edges and 70 vertex of which 62 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Graph (trivial) has 62 edges and 62 vertex of which 28 / 62 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 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 48 transition count 76
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 38 place count 38 transition count 62
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 33 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 33 transition count 52
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 30 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 30 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 27 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 27 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 24 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 24 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 21 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 21 transition count 33
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 16 transition count 28
Applied a total of 78 rules in 21 ms. Remains 16 /75 variables (removed 59) and now considering 28/98 (removed 70) transitions.
[2022-05-15 15:35:14] [INFO ] Flow matrix only has 21 transitions (discarded 7 similar events)
// Phase 1: matrix 21 rows 16 cols
[2022-05-15 15:35:14] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:35:14] [INFO ] Implicit Places using invariants in 13 ms returned []
[2022-05-15 15:35:14] [INFO ] Flow matrix only has 21 transitions (discarded 7 similar events)
// Phase 1: matrix 21 rows 16 cols
[2022-05-15 15:35:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:35:14] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-15 15:35:14] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:35:14] [INFO ] Flow matrix only has 21 transitions (discarded 7 similar events)
// Phase 1: matrix 21 rows 16 cols
[2022-05-15 15:35:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:35:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/75 places, 28/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/75 places, 28/98 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s4 0) (EQ s12 1)), p0:(OR (EQ s1 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-01 finished in 407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(p0) U X((X(p1)&&p2)))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 72 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 72 transition count 95
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 69 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 69 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 66 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 66 transition count 89
Applied a total of 18 rules in 7 ms. Remains 66 /75 variables (removed 9) and now considering 89/98 (removed 9) transitions.
// Phase 1: matrix 89 rows 66 cols
[2022-05-15 15:35:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:14] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 89 rows 66 cols
[2022-05-15 15:35:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-15 15:35:14] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 89 rows 66 cols
[2022-05-15 15:35:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:14] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/75 places, 89/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/75 places, 89/98 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 p2 p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s16 1)), p2:(OR (EQ s53 0) (EQ s41 1)), p1:(AND (OR (EQ s11 0) (EQ s16 1)) (OR (EQ s55 0) (EQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 632 steps with 18 reset in 24 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-03 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Graph (complete) has 185 edges and 75 vertex of which 71 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 79 edges and 69 vertex of which 59 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (trivial) has 64 edges and 59 vertex of which 32 / 59 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 43 transition count 75
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 35 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 29 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 29 transition count 47
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 23 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 23 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 18 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 18 transition count 25
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 13 transition count 20
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 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 82 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 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 86 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 89 place count 8 transition count 14
Applied a total of 89 rules in 16 ms. Remains 8 /75 variables (removed 67) and now considering 14/98 (removed 84) transitions.
[2022-05-15 15:35:15] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:35:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:35:15] [INFO ] Implicit Places using invariants in 12 ms returned []
[2022-05-15 15:35:15] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:35:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:35:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-15 15:35:15] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:35:15] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:35:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:35:15] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/75 places, 14/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/75 places, 14/98 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s4 0) (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-08a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-04 finished in 115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(G(p0)))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Graph (complete) has 185 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 70 transition count 88
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 65 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 65 transition count 87
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 13 place count 64 transition count 87
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 18 place count 59 transition count 82
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 59 transition count 82
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 53 place count 44 transition count 67
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 37 transition count 53
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 37 transition count 53
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 30 transition count 39
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 30 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 24 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 24 transition count 33
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 18 transition count 21
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 18 transition count 21
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 13 transition count 16
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 13 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 13 transition count 16
Applied a total of 116 rules in 48 ms. Remains 13 /75 variables (removed 62) and now considering 16/98 (removed 82) transitions.
[2022-05-15 15:35:15] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2022-05-15 15:35:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:15] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-15 15:35:15] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2022-05-15 15:35:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 15:35:15] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-15 15:35:15] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:35:15] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2022-05-15 15:35:15] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 15:35:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/75 places, 16/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/75 places, 16/98 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-05 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 (EQ s8 0) (EQ s6 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-05 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(F(p0))&&p1))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 71 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 71 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 67 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 67 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 64 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 64 transition count 87
Applied a total of 22 rules in 13 ms. Remains 64 /75 variables (removed 11) and now considering 87/98 (removed 11) transitions.
// Phase 1: matrix 87 rows 64 cols
[2022-05-15 15:35:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:15] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 87 rows 64 cols
[2022-05-15 15:35:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 15:35:15] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 64 cols
[2022-05-15 15:35:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 87/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/75 places, 87/98 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s56 0) (EQ s48 1)), p1:(OR (EQ s30 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1374 reset in 222 ms.
Stack based approach found an accepted trace after 7077 steps with 98 reset with depth 76 and stack size 69 in 17 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-06 finished in 574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p1) U (G(p2)||X(!G(F(G(p1))))))||p0)))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 72 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 72 transition count 95
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 69 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 69 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 66 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 66 transition count 89
Applied a total of 18 rules in 7 ms. Remains 66 /75 variables (removed 9) and now considering 89/98 (removed 9) transitions.
// Phase 1: matrix 89 rows 66 cols
[2022-05-15 15:35:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:16] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 89 rows 66 cols
[2022-05-15 15:35:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-15 15:35:16] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 89 rows 66 cols
[2022-05-15 15:35:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:16] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/75 places, 89/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/75 places, 89/98 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (EQ s15 0) (EQ s20 1)), p2:(OR (EQ s15 0) (EQ s20 1)), p1:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 173 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-08 finished in 823 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0) U X(X(p0))))||G(X(p1))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 65 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 65 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 61 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 61 transition count 84
Applied a total of 28 rules in 4 ms. Remains 61 /75 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 61 cols
[2022-05-15 15:35:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:16] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 84 rows 61 cols
[2022-05-15 15:35:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 15:35:16] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 61 cols
[2022-05-15 15:35:16] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 15:35:17] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/75 places, 84/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/75 places, 84/98 transitions.
Stuttering acceptance computed with spot in 134 ms :[(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-08a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s22 1), p1:(EQ s14 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5057 reset in 124 ms.
Stack based approach found an accepted trace after 12 steps with 1 reset with depth 8 and stack size 8 in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-09 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||X(F(p1)))))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 66 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 66 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 63 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 63 transition count 86
Applied a total of 24 rules in 6 ms. Remains 63 /75 variables (removed 12) and now considering 86/98 (removed 12) transitions.
// Phase 1: matrix 86 rows 63 cols
[2022-05-15 15:35:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:17] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 86 rows 63 cols
[2022-05-15 15:35:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 15:35:17] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 86 rows 63 cols
[2022-05-15 15:35:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:17] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 86/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/75 places, 86/98 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s60 0) (EQ s53 1)), p1:(EQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 292 steps with 3 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-11 finished in 317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 98/98 transitions.
Graph (complete) has 185 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 78 edges and 68 vertex of which 56 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Graph (trivial) has 59 edges and 56 vertex of which 30 / 56 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 41 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 34 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 40 place count 27 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 47 place count 27 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 52 place count 22 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 57 place count 22 transition count 34
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 17 transition count 24
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 17 transition count 24
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 12 transition count 19
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 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 2 with 2 rules applied. Total rules applied 79 place count 11 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 11 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 8 transition count 13
Applied a total of 84 rules in 14 ms. Remains 8 /75 variables (removed 67) and now considering 13/98 (removed 85) transitions.
[2022-05-15 15:35:17] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:35:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:35:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 15:35:17] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:35:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:35:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-15 15:35:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:35:17] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:35:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:35:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/75 places, 13/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/75 places, 13/98 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-13 finished in 127 ms.
All properties solved by simple procedures.
Total runtime 4864 ms.

BK_STOP 1652628917785

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

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