About the Execution of ITS-Tools for BART-COL-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 399.947 | 19733.00 | 34519.00 | 543.80 | FFFFFFFTFTFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689400532.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-COL-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689400532
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.0K Apr 29 20:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 20:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 19:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 19:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 184K 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 BART-COL-002-LTLFireability-00
FORMULA_NAME BART-COL-002-LTLFireability-01
FORMULA_NAME BART-COL-002-LTLFireability-02
FORMULA_NAME BART-COL-002-LTLFireability-03
FORMULA_NAME BART-COL-002-LTLFireability-04
FORMULA_NAME BART-COL-002-LTLFireability-05
FORMULA_NAME BART-COL-002-LTLFireability-06
FORMULA_NAME BART-COL-002-LTLFireability-07
FORMULA_NAME BART-COL-002-LTLFireability-08
FORMULA_NAME BART-COL-002-LTLFireability-09
FORMULA_NAME BART-COL-002-LTLFireability-10
FORMULA_NAME BART-COL-002-LTLFireability-11
FORMULA_NAME BART-COL-002-LTLFireability-12
FORMULA_NAME BART-COL-002-LTLFireability-13
FORMULA_NAME BART-COL-002-LTLFireability-14
FORMULA_NAME BART-COL-002-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652665849496
Running Version 202205111006
[2022-05-16 01:50:51] [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-16 01:50:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:50:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 01:50:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:50:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1319 ms
[2022-05-16 01:50:52] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2022-05-16 01:50:52] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 10865 PT places and 2.814459024E9 transition bindings in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 01:50:52] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 7 ms.
[2022-05-16 01:50:52] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [2:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 2
[2022-05-16 01:50:53] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 324 ms.
[2022-05-16 01:50:53] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
[2022-05-16 01:50:53] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:50:53] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:50:53] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:50:53] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:50:53] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:50:53] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:50:53] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:50:53] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-002-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-002-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 16 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:53] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-16 01:50:53] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:53] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:50:53] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:53] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:50:53] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2022-05-16 01:50:53] [INFO ] Flatten gal took : 36 ms
[2022-05-16 01:50:54] [INFO ] Flatten gal took : 30 ms
[2022-05-16 01:50:54] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 10 properties in 17 ms. (steps per millisecond=1 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(p1))&&(F(p0)||F(p2))))'
Support contains 70 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 9 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 01:50:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:50:54] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 01:50:54] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:50:54] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 01:50:54] [INFO ] Computed 1 place invariants in 16 ms
[2022-05-16 01:50:55] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR p1 (AND (NOT p0) (NOT p2))), p1, p1, (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : BART-COL-002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1 1), p2:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s111 1) (GEQ s12 1) (GEQ s109 1) (GEQ s14 1) (G...], 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]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 1 ms.
FORMULA BART-COL-002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-002-LTLFireability-00 finished in 811 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p0)||G(F((F(!p0)&&p1))))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:55] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:50:55] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:55] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 01:50:55] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:55] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:50:55] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s42 1) (GEQ s111 1) (GEQ s110 1) (GEQ s109 1) (GEQ s108 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p1:(AND (LT s45 1) (LT s43 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11573 reset in 496 ms.
Stack based approach found an accepted trace after 18370 steps with 2098 reset with depth 8 and stack size 8 in 127 ms.
FORMULA BART-COL-002-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-002-LTLFireability-01 finished in 1157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U !F(!(F(p1)&&p1)))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:58] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:50:58] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:50:58] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:50:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:50:58] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1]
Running random walk in product with property : BART-COL-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s42 1) (GEQ s111 1) (GEQ s110 1) (GEQ s109 1) (GEQ s108 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p1:(OR (GEQ s45 1) (GEQ s43 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9523 reset in 480 ms.
Stack based approach found an accepted trace after 7769 steps with 721 reset with depth 20 and stack size 20 in 69 ms.
FORMULA BART-COL-002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-002-LTLFireability-02 finished in 2968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(((F(p1)||p0)&&(!X(p2) U p1))))&&X(p1)))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 9 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:50:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:50:59] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:50:59] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:50:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:50:59] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:50:59] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), true, (NOT p1), (OR (NOT p1) p2)]
Running random walk in product with property : BART-COL-002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s86 1) (GEQ s44 1) (GEQ s90 1) (GEQ s48 1) (GEQ s94 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s64 1) (GEQ s8 1) (GEQ s68 1) (GEQ s12 1) (GEQ...], 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]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA BART-COL-002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-002-LTLFireability-03 finished in 559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(G(p0))) U F(G(!p0))) U G(p1)))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 130 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 22 place count 121 transition count 191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 121 transition count 187
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 111 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 111 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 111 transition count 180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 46 place count 108 transition count 177
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 108 transition count 177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 52 place count 105 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 105 transition count 174
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 102 transition count 171
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 102 transition count 171
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 100 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 100 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 98 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 98 transition count 167
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 97 transition count 166
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 97 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 83 place count 91 transition count 160
Applied a total of 83 rules in 74 ms. Remains 91 /132 variables (removed 41) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 91 cols
[2022-05-16 01:51:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:00] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 160 rows 91 cols
[2022-05-16 01:51:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:00] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-05-16 01:51:00] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 160 rows 91 cols
[2022-05-16 01:51:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:00] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/132 places, 160/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), p0]
Running random walk in product with property : BART-COL-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s81 1) (GEQ s40 1) (GEQ s85 1) (GEQ s44 1) (GEQ s89 1) (GEQ s48 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s5 1) (GEQ s64 1) (GEQ s9 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA BART-COL-002-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-002-LTLFireability-04 finished in 572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0)))||F(X(X((F(p2)&&p1))))))'
Support contains 130 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:00] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:00] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:51:01] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BART-COL-002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (GEQ s118 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8424 reset in 344 ms.
Stack based approach found an accepted trace after 2011 steps with 168 reset with depth 18 and stack size 18 in 8 ms.
FORMULA BART-COL-002-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-002-LTLFireability-05 finished in 971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||X((X((F(p2)&&p3))&&X(p2)))))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:01] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:51:01] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:01] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 404 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : BART-COL-002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2) p1) (AND p0 (NOT p3) p1)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 2}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=8 dest: 0}]], initial=5, aps=[p0:(OR (GEQ s42 1) (GEQ s111 1) (GEQ s110 1) (GEQ s109 1) (GEQ s108 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p1:(GEQ s0 1), p2:(OR (GEQ s98 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-COL-002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-002-LTLFireability-06 finished in 759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (G(p0)||p1)) U p0)||X((G(p3)||p2))))'
Support contains 70 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 5 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 01:51:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:02] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 01:51:02] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:51:02] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 129 cols
[2022-05-16 01:51:02] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 01:51:02] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : BART-COL-002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s111 1) (GEQ s12 1) (GEQ s109 1) (GEQ s14 1) (GEQ s115 1) (GEQ...], 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 536 ms.
Product exploration explored 100000 steps with 50000 reset in 471 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))
Knowledge based reduction with 13 factoid took 500 ms. Reduced automaton from 7 states, 17 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-COL-002-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-002-LTLFireability-07 finished in 2457 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(p1))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 7 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 01:51:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:51:04] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 01:51:04] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:51:05] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 01:51:05] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 01:51:05] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BART-COL-002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s1 1), p0:(AND (LT s42 1) (LT s88 1) (LT s87 1) (LT s86 1) (LT s85 1) (LT s77 1) (LT s78 1) (LT s79 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BART-COL-002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-002-LTLFireability-08 finished in 609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&X(p1))))'
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 0 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:05] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:05] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:05] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s98 1) (GEQ s49 1) (GEQ s102 1) (GEQ s53 1) (GEQ s106 1) (GEQ s57 1) (GEQ s61 1) (GEQ s65 1) (GEQ s69 1) (GEQ s8 1) (GEQ s73 1) (GEQ s12 1) (G...], 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 7 steps with 0 reset in 1 ms.
FORMULA BART-COL-002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-002-LTLFireability-10 finished in 435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 9 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:51:05] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:51:06] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:51:06] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:51:06] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:51:06] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 01:51:06] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s86 1) (LT s44 1) (LT s90 1) (LT s48 1) (LT s94 1) (LT s52 1) (LT s56 1) (LT s60 1) (LT s64 1) (LT s8 1) (LT s68 1) (LT s12 1) (LT s16 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8608 reset in 243 ms.
Stack based approach found an accepted trace after 725 steps with 62 reset with depth 17 and stack size 17 in 2 ms.
FORMULA BART-COL-002-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-002-LTLFireability-11 finished in 622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||((p1 U G(p0))&&G(p2))))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 0 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:06] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:06] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:06] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 01:51:06] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:51:06] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 01:51:06] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : BART-COL-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s98 1) (GEQ s49 1) (GEQ s102 1) (GEQ s53 1) (GEQ s106 1) (GEQ s57 1) (GEQ s61 1) (GEQ s65 1) (GEQ s69 1) (GEQ s8 1) (GEQ s73 1) (GEQ s12 1) (G...], 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]]
Product exploration explored 100000 steps with 50000 reset in 320 ms.
Product exploration explored 100000 steps with 50000 reset in 349 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 505 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-COL-002-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-002-LTLFireability-12 finished in 1938 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((F(p1)&&(p1||F(p0)))))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 25 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:51:08] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:51:08] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:51:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:51:08] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:51:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:51:08] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/132 places, 119/202 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BART-COL-002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s0 1), p0:(GEQ s1 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-002-LTLFireability-13 finished in 565 ms.
All properties solved by simple procedures.
Total runtime 17964 ms.
BK_STOP 1652665869229
--------------------
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="BART-COL-002"
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 BART-COL-002, 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 r006-tajo-165245689400532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-COL-002.tgz
mv BART-COL-002 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 '
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 ;