Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598300740.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BART-COL-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598300740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.5K Feb 26 06:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 06:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 05:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 213K Mar 5 18:22 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-050-LTLFireability-00
FORMULA_NAME BART-COL-050-LTLFireability-01
FORMULA_NAME BART-COL-050-LTLFireability-02
FORMULA_NAME BART-COL-050-LTLFireability-03
FORMULA_NAME BART-COL-050-LTLFireability-04
FORMULA_NAME BART-COL-050-LTLFireability-05
FORMULA_NAME BART-COL-050-LTLFireability-06
FORMULA_NAME BART-COL-050-LTLFireability-07
FORMULA_NAME BART-COL-050-LTLFireability-08
FORMULA_NAME BART-COL-050-LTLFireability-09
FORMULA_NAME BART-COL-050-LTLFireability-10
FORMULA_NAME BART-COL-050-LTLFireability-11
FORMULA_NAME BART-COL-050-LTLFireability-12
FORMULA_NAME BART-COL-050-LTLFireability-13
FORMULA_NAME BART-COL-050-LTLFireability-14
FORMULA_NAME BART-COL-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678644319981

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:05:23] [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.
[2023-03-12 18:05:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 18:05:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 962 ms
[2023-03-12 18:05:24] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-12 18:05:24] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 22673 PT places and 7.03614756E10 transition bindings in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 18:05:25] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 21 ms.
[2023-03-12 18:05:25] [INFO ] Skeletonized 2 HLPN properties in 2 ms. Removed 14 properties that had guard overlaps.
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.
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 50
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [1:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2023-03-12 18:05:25] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 348 ms.
[2023-03-12 18:05:25] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
[2023-03-12 18:05:25] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-12 18:05:25] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-050-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-050-LTLFireability-15 TRUE 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 15 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 18:05:25] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-12 18:05:25] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-12 18:05:25] [INFO ] Invariant cache hit.
[2023-03-12 18:05:26] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-12 18:05:26] [INFO ] Invariant cache hit.
[2023-03-12 18:05:26] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1159 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2023-03-12 18:05:26] [INFO ] Flatten gal took : 91 ms
[2023-03-12 18:05:27] [INFO ] Flatten gal took : 35 ms
[2023-03-12 18:05:27] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 9086 steps, including 2 resets, run visited all 7 properties in 42 ms. (steps per millisecond=216 )
FORMULA BART-COL-050-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-COL-050-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p0) U 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 0 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 49 ms. Remains 91 /132 variables (removed 41) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 91 cols
[2023-03-12 18:05:27] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:05:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 18:05:27] [INFO ] Invariant cache hit.
[2023-03-12 18:05:27] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-12 18:05:27] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 18:05:27] [INFO ] Invariant cache hit.
[2023-03-12 18:05:28] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/132 places, 160/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 91/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 570 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LT s1 1), p1:(OR (GEQ s17 1) (GEQ s21 1) (GEQ s9 1) (GEQ s64 1) (GEQ s13 1) (GEQ s56 1) (GEQ s5 1) (GEQ s60 1) (GEQ s48 1) (GEQ s52 1) (GEQ s39 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 7339 steps with 3601 reset in 131 ms.
FORMULA BART-COL-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-00 finished in 1241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1&&(X(!p3)||p2)))))))'
Support contains 11 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 6 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-12 18:05:28] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:05:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 18:05:28] [INFO ] Invariant cache hit.
[2023-03-12 18:05:28] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-12 18:05:28] [INFO ] Invariant cache hit.
[2023-03-12 18:05:29] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) p3)), (NOT p0), (OR (NOT p1) (AND (NOT p2) p3)), (OR (AND (NOT p2) p3) (AND (NOT p1) p3))]
Running random walk in product with property : BART-COL-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s85 1) (GEQ s88 1) (GEQ s86 1) (GEQ s87 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p1:(GEQ s0 1), p2:(OR (GEQ s78 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 130 reset in 410 ms.
Stack based approach found an accepted trace after 49020 steps with 63 reset with depth 688 and stack size 688 in 200 ms.
FORMULA BART-COL-050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-03 finished in 1326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 128 place count 68 transition count 134
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 64 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 58 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 58 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 58 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 54 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 54 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 48 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 48 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 46 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 46 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 44 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 43 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 43 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 36 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 34 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 34 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 32 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 32 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 30 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 221 place count 30 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 225 place count 28 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 229 place count 28 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 233 place count 26 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 237 place count 26 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 241 place count 24 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 245 place count 24 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 249 place count 22 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 253 place count 22 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 257 place count 20 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 261 place count 20 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 265 place count 18 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 269 place count 18 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 273 place count 16 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 277 place count 16 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 281 place count 14 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 285 place count 14 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 289 place count 12 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 293 place count 12 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 297 place count 10 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 301 place count 10 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 305 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 309 place count 8 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 313 place count 6 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 317 place count 6 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 321 place count 4 transition count 9
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 326 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 328 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 328 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 65 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-12 18:05:30] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:05:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 18:05:30] [INFO ] Invariant cache hit.
[2023-03-12 18:05:30] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-12 18:05:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:05:30] [INFO ] Invariant cache hit.
[2023-03-12 18:05:30] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA BART-COL-050-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-06 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)))))'
Support contains 68 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
[2023-03-12 18:05:30] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:05:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 18:05:30] [INFO ] Invariant cache hit.
[2023-03-12 18:05:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-12 18:05:30] [INFO ] Invariant cache hit.
[2023-03-12 18:05:30] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s20 1) (GEQ s121 1) (GEQ s22 1) (GEQ s119 1) (GEQ s24 1) (GEQ s125 1) (GEQ s26 1) (GEQ s123 1) (GEQ s12 1) (GEQ s113 1) (GEQ s14 1) (GEQ s111 ...], 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][false, false, false]]
Product exploration explored 100000 steps with 32810 reset in 360 ms.
Product exploration explored 100000 steps with 32845 reset in 307 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 317 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 341 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:05:33] [INFO ] Invariant cache hit.
[2023-03-12 18:05:33] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:33] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-12 18:05:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:05:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:34] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-12 18:05:34] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-12 18:05:34] [INFO ] Added : 163 causal constraints over 33 iterations in 798 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-12 18:05:35] [INFO ] Invariant cache hit.
[2023-03-12 18:05:35] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 18:05:35] [INFO ] Invariant cache hit.
[2023-03-12 18:05:35] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-12 18:05:35] [INFO ] Invariant cache hit.
[2023-03-12 18:05:35] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 129/129 places, 199/199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 360 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:05:36] [INFO ] Invariant cache hit.
[2023-03-12 18:05:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:36] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-12 18:05:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:05:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:05:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:37] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-12 18:05:37] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-12 18:05:38] [INFO ] Added : 163 causal constraints over 33 iterations in 1037 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32821 reset in 375 ms.
Product exploration explored 100000 steps with 32803 reset in 329 ms.
Support contains 68 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-12 18:05:39] [INFO ] Invariant cache hit.
[2023-03-12 18:05:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 18:05:39] [INFO ] Invariant cache hit.
[2023-03-12 18:05:39] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-12 18:05:39] [INFO ] Invariant cache hit.
[2023-03-12 18:05:39] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 129/129 places, 199/199 transitions.
Treatment of property BART-COL-050-LTLFireability-07 finished in 9347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(!p1)))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 132 transition count 178
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 108 transition count 178
Applied a total of 48 rules in 10 ms. Remains 108 /132 variables (removed 24) and now considering 178/202 (removed 24) transitions.
// Phase 1: matrix 178 rows 108 cols
[2023-03-12 18:05:39] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:05:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 18:05:39] [INFO ] Invariant cache hit.
[2023-03-12 18:05:40] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-12 18:05:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 18:05:40] [INFO ] Invariant cache hit.
[2023-03-12 18:05:40] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/132 places, 178/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 108/132 places, 178/202 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : BART-COL-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s54 1) (GEQ s53 1) (GEQ s84 1) (GEQ s87 1) (GEQ s85 1) (GEQ s86 1) (GEQ s41 1) (GEQ s40 1) (GEQ s55 1)), p0:(OR (GEQ s19 1) (GEQ s100 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 162 reset in 282 ms.
Stack based approach found an accepted trace after 28539 steps with 68 reset with depth 2033 and stack size 2033 in 66 ms.
FORMULA BART-COL-050-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-050-LTLFireability-08 finished in 997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Support contains 69 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 3 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2023-03-12 18:05:40] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-12 18:05:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 18:05:40] [INFO ] Invariant cache hit.
[2023-03-12 18:05:41] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-12 18:05:41] [INFO ] Invariant cache hit.
[2023-03-12 18:05:41] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (GEQ s20 1) (GEQ s121 1) (GEQ s22 1) (GEQ s119 1) (GEQ s24 1) (GEQ s125 1) (GEQ s26 1) (GEQ s123 1) (GEQ s12 1) (GEQ s113 1) (GEQ s14 1) (GEQ s111 ...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 33075 reset in 251 ms.
Product exploration explored 100000 steps with 33088 reset in 214 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) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 370 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 3 factoid took 364 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-12 18:05:43] [INFO ] Invariant cache hit.
[2023-03-12 18:05:43] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 18:05:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:44] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-12 18:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:05:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:44] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-12 18:05:44] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 31 ms.
[2023-03-12 18:05:45] [INFO ] Added : 163 causal constraints over 33 iterations in 925 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 68 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-12 18:05:45] [INFO ] Invariant cache hit.
[2023-03-12 18:05:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-12 18:05:45] [INFO ] Invariant cache hit.
[2023-03-12 18:05:45] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-12 18:05:45] [INFO ] Invariant cache hit.
[2023-03-12 18:05:45] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 129/129 places, 199/199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 278 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-12 18:05:46] [INFO ] Invariant cache hit.
[2023-03-12 18:05:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:47] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-12 18:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:05:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:47] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 18:05:47] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-12 18:05:48] [INFO ] Added : 163 causal constraints over 33 iterations in 813 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33076 reset in 236 ms.
Product exploration explored 100000 steps with 33072 reset in 255 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 68 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 129 transition count 199
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 129 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 122 transition count 192
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 122 transition count 192
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 46 rules in 42 ms. Remains 122 /129 variables (removed 7) and now considering 192/199 (removed 7) transitions.
[2023-03-12 18:05:49] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 192 rows 122 cols
[2023-03-12 18:05:49] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-12 18:05:49] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/129 places, 192/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 122/129 places, 192/199 transitions.
Support contains 68 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 129 cols
[2023-03-12 18:05:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:05:49] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 18:05:49] [INFO ] Invariant cache hit.
[2023-03-12 18:05:49] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-12 18:05:49] [INFO ] Invariant cache hit.
[2023-03-12 18:05:50] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 129/129 places, 199/199 transitions.
Treatment of property BART-COL-050-LTLFireability-11 finished in 9250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 30 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2023-03-12 18:05:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:05:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 18:05:50] [INFO ] Invariant cache hit.
[2023-03-12 18:05:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-12 18:05:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 18:05:50] [INFO ] Invariant cache hit.
[2023-03-12 18:05:50] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0]
Running random walk in product with property : BART-COL-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s15 1) (GEQ s19 1) (GEQ s7 1) (GEQ s62 1) (GEQ s11 1) (GEQ s54 1) (GEQ s3 1) (GEQ s58 1) (GEQ s46 1) (GEQ s50 1) (GEQ s37 1) (GEQ s86 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-050-LTLFireability-12 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)))))'
Found a Shortening insensitive property : BART-COL-050-LTLFireability-07
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 97 transition count 167
Applied a total of 70 rules in 13 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2023-03-12 18:05:50] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 18:05:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 18:05:50] [INFO ] Invariant cache hit.
[2023-03-12 18:05:50] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-12 18:05:50] [INFO ] Invariant cache hit.
[2023-03-12 18:05:51] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 390 ms. Remains : 97/132 places, 167/202 transitions.
Running random walk in product with property : BART-COL-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s19 1) (GEQ s89 1) (GEQ s21 1) (GEQ s87 1) (GEQ s23 1) (GEQ s93 1) (GEQ s25 1) (GEQ s91 1) (GEQ s11 1) (GEQ s81 1) (GEQ s13 1) (GEQ s79 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32838 reset in 218 ms.
Product exploration explored 100000 steps with 32810 reset in 346 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 290 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 290 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:05:52] [INFO ] Invariant cache hit.
[2023-03-12 18:05:52] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:52] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-12 18:05:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:05:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-12 18:05:53] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-12 18:05:53] [INFO ] Added : 131 causal constraints over 27 iterations in 763 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-12 18:05:53] [INFO ] Invariant cache hit.
[2023-03-12 18:05:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-12 18:05:54] [INFO ] Invariant cache hit.
[2023-03-12 18:05:54] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-12 18:05:54] [INFO ] Invariant cache hit.
[2023-03-12 18:05:54] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 97/97 places, 167/167 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 339 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:05:55] [INFO ] Invariant cache hit.
[2023-03-12 18:05:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:55] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-12 18:05:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:05:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:05:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:05:55] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-12 18:05:55] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-12 18:05:56] [INFO ] Added : 131 causal constraints over 27 iterations in 679 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32830 reset in 313 ms.
Product exploration explored 100000 steps with 32843 reset in 276 ms.
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-12 18:05:57] [INFO ] Invariant cache hit.
[2023-03-12 18:05:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 18:05:57] [INFO ] Invariant cache hit.
[2023-03-12 18:05:57] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-12 18:05:57] [INFO ] Invariant cache hit.
[2023-03-12 18:05:57] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 97/97 places, 167/167 transitions.
Treatment of property BART-COL-050-LTLFireability-07 finished in 7256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(p1)))))'
Found a Shortening insensitive property : BART-COL-050-LTLFireability-11
Stuttering acceptance computed with spot in 364 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 98 transition count 168
Applied a total of 68 rules in 9 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2023-03-12 18:05:58] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-12 18:05:58] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-12 18:05:58] [INFO ] Invariant cache hit.
[2023-03-12 18:05:58] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-12 18:05:58] [INFO ] Invariant cache hit.
[2023-03-12 18:05:59] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1173 ms. Remains : 98/132 places, 168/202 transitions.
Running random walk in product with property : BART-COL-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (GEQ s20 1) (GEQ s90 1) (GEQ s22 1) (GEQ s88 1) (GEQ s24 1) (GEQ s94 1) (GEQ s26 1) (GEQ s92 1) (GEQ s12 1) (GEQ s82 1) (GEQ s14 1) (GEQ s80 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33078 reset in 175 ms.
Product exploration explored 100000 steps with 33085 reset in 187 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) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 306 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 3 factoid took 368 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-12 18:06:01] [INFO ] Invariant cache hit.
[2023-03-12 18:06:01] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:06:01] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-12 18:06:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:06:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:06:01] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-12 18:06:01] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-12 18:06:02] [INFO ] Added : 89 causal constraints over 19 iterations in 341 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 68 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-12 18:06:02] [INFO ] Invariant cache hit.
[2023-03-12 18:06:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 18:06:02] [INFO ] Invariant cache hit.
[2023-03-12 18:06:02] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-12 18:06:02] [INFO ] Invariant cache hit.
[2023-03-12 18:06:02] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 98/98 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-12 18:06:03] [INFO ] Invariant cache hit.
[2023-03-12 18:06:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 18:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:06:03] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-12 18:06:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:06:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:06:04] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 18:06:04] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-12 18:06:04] [INFO ] Added : 89 causal constraints over 19 iterations in 561 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33069 reset in 228 ms.
Product exploration explored 100000 steps with 33087 reset in 199 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 68 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-12 18:06:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 168 rows 98 cols
[2023-03-12 18:06:05] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 18:06:05] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 168/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 98/98 places, 168/168 transitions.
Support contains 68 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 98 cols
[2023-03-12 18:06:05] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:06:06] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 18:06:06] [INFO ] Invariant cache hit.
[2023-03-12 18:06:06] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-12 18:06:06] [INFO ] Invariant cache hit.
[2023-03-12 18:06:06] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 98/98 places, 168/168 transitions.
Treatment of property BART-COL-050-LTLFireability-11 finished in 8614 ms.
[2023-03-12 18:06:06] [INFO ] Flatten gal took : 10 ms
[2023-03-12 18:06:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-12 18:06:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 202 transitions and 404 arcs took 1 ms.
Total runtime 42851 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1439/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1439/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BART-COL-050-LTLFireability-07
Could not compute solution for formula : BART-COL-050-LTLFireability-11

BK_STOP 1678644367217

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BART-COL-050-LTLFireability-07
ltl formula formula --ltl=/tmp/1439/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 202 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1439/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1439/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1439/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1439/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
free(): double free detected in tcache 2
ltl formula name BART-COL-050-LTLFireability-11
ltl formula formula --ltl=/tmp/1439/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 202 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1439/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1439/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1439/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1439/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size

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-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BART-COL-050, 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 r009-oct2-167813598300740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-COL-050.tgz
mv BART-COL-050 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 ;