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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.4K Apr 30 07:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 07:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 07:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 07:09 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:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 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 53K 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-15a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652636688733

Running Version 202205111006
[2022-05-15 17:44:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 17:44:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:44:50] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-05-15 17:44:50] [INFO ] Transformed 153 places.
[2022-05-15 17:44:50] [INFO ] Transformed 211 transitions.
[2022-05-15 17:44:50] [INFO ] Found NUPN structural information;
[2022-05-15 17:44:50] [INFO ] Parsed PT model containing 153 places and 211 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 211/211 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 201
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 201
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 136 transition count 194
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 136 transition count 194
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 130 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 130 transition count 182
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 55 place count 130 transition count 173
Applied a total of 55 rules in 36 ms. Remains 130 /153 variables (removed 23) and now considering 173/211 (removed 38) transitions.
// Phase 1: matrix 173 rows 130 cols
[2022-05-15 17:44:50] [INFO ] Computed 2 place invariants in 14 ms
[2022-05-15 17:44:50] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 173 rows 130 cols
[2022-05-15 17:44:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:44:50] [INFO ] State equation strengthened by 113 read => feed constraints.
[2022-05-15 17:44:50] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 130 cols
[2022-05-15 17:44:50] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 17:44:50] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/153 places, 173/211 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/153 places, 173/211 transitions.
Support contains 36 out of 130 places after structural reductions.
[2022-05-15 17:44:50] [INFO ] Flatten gal took : 37 ms
[2022-05-15 17:44:50] [INFO ] Flatten gal took : 14 ms
[2022-05-15 17:44:51] [INFO ] Input system was already deterministic with 173 transitions.
Support contains 34 out of 130 places (down from 36) after GAL structural reductions.
Finished random walk after 550 steps, including 3 resets, run visited all 34 properties in 89 ms. (steps per millisecond=6 )
Computed a total of 18 stabilizing places and 16 stable transitions
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!(p0 U p1)||F(p2)) U X(p3)))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 115 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 111 transition count 154
Applied a total of 38 rules in 26 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:51] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:51] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-15 17:44:51] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/130 places, 154/173 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/130 places, 154/173 transitions.
Stuttering acceptance computed with spot in 494 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), true, p2, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p2 (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s108 1) (EQ s109 1)), p1:(AND (EQ s7 1) (EQ s109 1)), p0:(OR (AND (EQ s108 1) (EQ s109 1)) (AND (EQ s13 1) (EQ s109 1))), p3:(EQ s81 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-00 finished in 809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(X(p0))||p1))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 126 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 2 places and 0 transitions.
Graph (complete) has 145 edges and 123 vertex of which 108 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Graph (trivial) has 120 edges and 108 vertex of which 60 / 108 are part of one of the 30 SCC in 4 ms
Free SCC test removed 30 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 78 transition count 138
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 65 place count 63 transition count 108
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 78 place count 50 transition count 82
Iterating global reduction 2 with 13 rules applied. Total rules applied 91 place count 50 transition count 82
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 38 transition count 58
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 38 transition count 58
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 127 place count 26 transition count 34
Iterating global reduction 2 with 12 rules applied. Total rules applied 139 place count 26 transition count 34
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 151 place count 14 transition count 22
Iterating global reduction 2 with 12 rules applied. Total rules applied 163 place count 14 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 9 transition count 15
Applied a total of 172 rules in 42 ms. Remains 9 /130 variables (removed 121) and now considering 15/173 (removed 158) transitions.
[2022-05-15 17:44:52] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 17:44:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:44:52] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 17:44:52] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 17:44:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:44:52] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-15 17:44:52] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:44:52] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 17:44:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:44:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/130 places, 15/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/130 places, 15/173 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s6 0), 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 104 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-02 finished in 197 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G((G(X(p1))&&G(p2)&&p0))))&&X(p3)))'
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 115 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 111 transition count 154
Applied a total of 38 rules in 8 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:44:52] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:52] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-15 17:44:52] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:52] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/130 places, 154/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/130 places, 154/173 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p3) (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s93 1) (EQ s109 1)), p2:(AND (EQ s8 1) (EQ s110 1)), p0:(AND (EQ s95 1) (EQ s110 1)), p1:(OR (EQ s100 0) (EQ s109 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-03 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0&&G(p1))))&&F(p2)))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 116 transition count 159
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 116 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 112 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 112 transition count 155
Applied a total of 36 rules in 28 ms. Remains 112 /130 variables (removed 18) and now considering 155/173 (removed 18) transitions.
// Phase 1: matrix 155 rows 112 cols
[2022-05-15 17:44:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:53] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 155 rows 112 cols
[2022-05-15 17:44:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:44:53] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-15 17:44:53] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 112 cols
[2022-05-15 17:44:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:53] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/130 places, 155/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/130 places, 155/173 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s74 1) (EQ s111 1)), p0:(OR (EQ s88 0) (EQ s110 0)), p1:(EQ s48 0)], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-04 finished in 573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 125 transition count 161
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 118 transition count 161
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 111 transition count 154
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 111 transition count 154
Applied a total of 29 rules in 31 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:53] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:44:53] [INFO ] State equation strengthened by 107 read => feed constraints.
[2022-05-15 17:44:53] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 183 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/130 places, 154/173 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 81 transition count 125
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 69 transition count 101
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 69 transition count 101
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 94 place count 57 transition count 77
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 57 transition count 77
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 118 place count 45 transition count 65
Iterating global reduction 0 with 12 rules applied. Total rules applied 130 place count 45 transition count 65
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 142 place count 33 transition count 41
Iterating global reduction 0 with 12 rules applied. Total rules applied 154 place count 33 transition count 41
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 166 place count 21 transition count 29
Iterating global reduction 0 with 12 rules applied. Total rules applied 178 place count 21 transition count 29
Applied a total of 178 rules in 15 ms. Remains 21 /110 variables (removed 89) and now considering 29/154 (removed 125) transitions.
[2022-05-15 17:44:53] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 17:44:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:44:53] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-15 17:44:53] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 17:44:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 17:44:53] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/130 places, 29/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/130 places, 29/173 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s14 0), p0:(AND (EQ s7 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-05 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 115 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 111 transition count 154
Applied a total of 38 rules in 10 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:53] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:44:54] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:54] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-15 17:44:54] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:44:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/130 places, 154/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/130 places, 154/173 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s71 1) (AND (EQ s18 1) (EQ s110 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][false, false, false]]
Product exploration explored 100000 steps with 2819 reset in 310 ms.
Stack based approach found an accepted trace after 166 steps with 4 reset with depth 22 and stack size 22 in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-06 finished in 650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||p1))&&F(p2)))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 124 transition count 167
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 124 transition count 167
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 119 transition count 162
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 119 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 117 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 117 transition count 160
Applied a total of 26 rules in 9 ms. Remains 117 /130 variables (removed 13) and now considering 160/173 (removed 13) transitions.
// Phase 1: matrix 160 rows 117 cols
[2022-05-15 17:44:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:54] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 160 rows 117 cols
[2022-05-15 17:44:54] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:44:54] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-05-15 17:44:54] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 117 cols
[2022-05-15 17:44:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:44:54] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/130 places, 160/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/130 places, 160/173 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s53 1), p1:(EQ s63 1), p0:(OR (EQ s66 0) (EQ s116 0))], 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]]
Stuttering criterion allowed to conclude after 242 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-08 finished in 485 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(G(p1))||p0))||p2)))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 126 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
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 126 transition count 162
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 119 transition count 162
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 113 transition count 156
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 113 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 112 transition count 155
Applied a total of 29 rules in 22 ms. Remains 112 /130 variables (removed 18) and now considering 155/173 (removed 18) transitions.
// Phase 1: matrix 155 rows 112 cols
[2022-05-15 17:44:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:55] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 155 rows 112 cols
[2022-05-15 17:44:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:55] [INFO ] State equation strengthened by 107 read => feed constraints.
[2022-05-15 17:44:55] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [111]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 179 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/130 places, 155/173 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 83 transition count 127
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 72 transition count 105
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 72 transition count 105
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 61 transition count 83
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 61 transition count 83
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 111 place count 50 transition count 72
Iterating global reduction 0 with 11 rules applied. Total rules applied 122 place count 50 transition count 72
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 133 place count 39 transition count 50
Iterating global reduction 0 with 11 rules applied. Total rules applied 144 place count 39 transition count 50
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 155 place count 28 transition count 39
Iterating global reduction 0 with 11 rules applied. Total rules applied 166 place count 28 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 167 place count 28 transition count 39
Applied a total of 167 rules in 23 ms. Remains 28 /111 variables (removed 83) and now considering 39/155 (removed 116) transitions.
[2022-05-15 17:44:55] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 28 cols
[2022-05-15 17:44:55] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-15 17:44:55] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 28 cols
[2022-05-15 17:44:55] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 17:44:55] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-05-15 17:44:55] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/130 places, 39/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 28/130 places, 39/173 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s13 0), p0:(OR (EQ s16 0) (EQ s27 0)), p1:(OR (EQ s7 1) (EQ s20 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1041 reset in 131 ms.
Product exploration explored 100000 steps with 1037 reset in 145 ms.
Computed a total of 25 stabilizing places and 28 stable transitions
Graph (complete) has 81 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 25 stabilizing places and 28 stable transitions
Detected a total of 25/28 stabilizing places and 28/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10009 steps, including 119 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 17:44:56] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 28 cols
[2022-05-15 17:44:56] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:56] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 17:44:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 17:44:56] [INFO ] After 42ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 8 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-09 finished in 1381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 123 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 123 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 117 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 117 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 114 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 114 transition count 157
Applied a total of 32 rules in 6 ms. Remains 114 /130 variables (removed 16) and now considering 157/173 (removed 16) transitions.
// Phase 1: matrix 157 rows 114 cols
[2022-05-15 17:44:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:56] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 157 rows 114 cols
[2022-05-15 17:44:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:56] [INFO ] State equation strengthened by 107 read => feed constraints.
[2022-05-15 17:44:56] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/130 places, 157/173 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 113/130 places, 157/173 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s107 1) (EQ s67 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-11 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(F(p0)))||(G(p2)&&p1))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 125 transition count 160
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 117 transition count 160
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 25 place count 109 transition count 152
Iterating global reduction 0 with 8 rules applied. Total rules applied 33 place count 109 transition count 152
Applied a total of 33 rules in 14 ms. Remains 109 /130 variables (removed 21) and now considering 152/173 (removed 21) transitions.
// Phase 1: matrix 152 rows 109 cols
[2022-05-15 17:44:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:56] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 152 rows 109 cols
[2022-05-15 17:44:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:56] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-15 17:44:56] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-05-15 17:44:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 152 rows 109 cols
[2022-05-15 17:44:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:57] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/130 places, 152/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/130 places, 152/173 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s44 1) (EQ s108 1)), p2:(AND (EQ s88 1) (EQ s107 1)), p0:(OR (EQ s44 0) (EQ s108 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 803 reset in 201 ms.
Stack based approach found an accepted trace after 616 steps with 4 reset with depth 133 and stack size 132 in 2 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-12 finished in 742 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||F((X(p2)&&p3))||p0)))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 115 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 111 transition count 154
Applied a total of 38 rules in 5 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:44:57] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:57] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-15 17:44:57] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-15 17:44:57] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 164 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/130 places, 154/173 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/130 places, 154/173 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p3) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(EQ s57 1), p2:(EQ s57 0), p1:(EQ s53 0), p0:(OR (EQ s34 0) (EQ s109 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 306 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 p1 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) p3)))
Knowledge based reduction with 16 factoid took 287 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-13 finished in 1224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p0)&&p1)))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 123 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 123 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 117 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 117 transition count 160
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 113 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 113 transition count 156
Applied a total of 34 rules in 5 ms. Remains 113 /130 variables (removed 17) and now considering 156/173 (removed 17) transitions.
// Phase 1: matrix 156 rows 113 cols
[2022-05-15 17:44:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:44:58] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 156 rows 113 cols
[2022-05-15 17:44:58] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:44:58] [INFO ] State equation strengthened by 107 read => feed constraints.
[2022-05-15 17:44:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/130 places, 156/173 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 112/130 places, 156/173 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (EQ s5 1) (EQ s111 1)), p1:(OR (EQ s74 0) (EQ s111 0))], 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 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-14 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0)))&&G(p1))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 115 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 111 transition count 154
Applied a total of 38 rules in 7 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:44:59] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:44:59] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-15 17:44:59] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 111 cols
[2022-05-15 17:44:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:44:59] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/130 places, 154/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/130 places, 154/173 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(AND (EQ s50 1) (EQ s110 1)), p0:(AND (EQ s30 1) (EQ s109 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-15 finished in 483 ms.
All properties solved by simple procedures.
Total runtime 9623 ms.

BK_STOP 1652636699617

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-15a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-15a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260109900148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15a.tgz
mv DiscoveryGPU-PT-15a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;