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-165245689500548.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-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.5K Apr 29 20:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 29 20:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 20:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 20:24 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 26K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:06 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 189K 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-010-LTLFireability-00
FORMULA_NAME BART-COL-010-LTLFireability-01
FORMULA_NAME BART-COL-010-LTLFireability-02
FORMULA_NAME BART-COL-010-LTLFireability-03
FORMULA_NAME BART-COL-010-LTLFireability-04
FORMULA_NAME BART-COL-010-LTLFireability-05
FORMULA_NAME BART-COL-010-LTLFireability-06
FORMULA_NAME BART-COL-010-LTLFireability-07
FORMULA_NAME BART-COL-010-LTLFireability-08
FORMULA_NAME BART-COL-010-LTLFireability-09
FORMULA_NAME BART-COL-010-LTLFireability-10
FORMULA_NAME BART-COL-010-LTLFireability-11
FORMULA_NAME BART-COL-010-LTLFireability-12
FORMULA_NAME BART-COL-010-LTLFireability-13
FORMULA_NAME BART-COL-010-LTLFireability-14
FORMULA_NAME BART-COL-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652666754570

Running Version 202205111006
[2022-05-16 02:05:56] [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 02:05:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:05:56] [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 02:05:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:05:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 732 ms
[2022-05-16 02:05:57] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2022-05-16 02:05:57] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 12833 PT places and 1.407229512E10 transition bindings in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 02:05:57] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 5 ms.
[2022-05-16 02:05:57] [INFO ] Skeletonized 16 HLPN properties in 0 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
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 10
Arc [1:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2022-05-16 02:05:57] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 748 ms.
[2022-05-16 02:05:57] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
[2022-05-16 02:05:57] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:05:57] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:05:57] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:05:57] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:05:57] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:05:57] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 02:05:57] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 4 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-010-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-010-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 7 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 02:05:58] [INFO ] Computed 1 place invariants in 17 ms
[2022-05-16 02:05:58] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:05:58] [INFO ] Computed 1 place invariants in 11 ms
[2022-05-16 02:05:58] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:05:58] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:05:58] [INFO ] Dead Transitions using invariants and state equation in 138 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 02:05:58] [INFO ] Flatten gal took : 55 ms
[2022-05-16 02:05:58] [INFO ] Flatten gal took : 18 ms
[2022-05-16 02:05:58] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 155 steps, including 0 resets, run visited all 7 properties in 17 ms. (steps per millisecond=9 )
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' '!(G(F(G(F((F(p1)&&p0))))))'
Support contains 98 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 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 1 place count 132 transition count 201
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 9 rules applied. Total rules applied 10 place count 131 transition count 193
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 18 place count 123 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 123 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 122 transition count 192
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 48 place count 108 transition count 178
Applied a total of 48 rules in 25 ms. Remains 108 /132 variables (removed 24) and now considering 178/202 (removed 24) transitions.
// Phase 1: matrix 178 rows 108 cols
[2022-05-16 02:05:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:05:59] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 178 rows 108 cols
[2022-05-16 02:05:59] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:05:59] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-16 02:05:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 178 rows 108 cols
[2022-05-16 02:05:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:05:59] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/132 places, 178/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/132 places, 178/202 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s72 1) (GEQ s71 1) (GEQ s100 1) (GEQ s103 1) (GEQ s101 1) (GEQ s102 1) (GEQ s38 1) (GEQ s37 1) (GEQ s73 1)), p0:(AND (GEQ s0 1) (OR (GEQ s16 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5797 reset in 329 ms.
Stack based approach found an accepted trace after 3062 steps with 167 reset with depth 7 and stack size 7 in 8 ms.
FORMULA BART-COL-010-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-00 finished in 904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!X(((p0 U F(p1))&&p0))) U p2))'
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 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 02:05:59] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:05:59] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:05:59] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:00] [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 202 rows 132 cols
[2022-05-16 02:06:00] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 02:06:00] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 683 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), true, p1, (AND p1 p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s20 1) (GEQ s124 1) (GEQ s22 1) (GEQ s122 1) (GEQ s24 1) (GEQ s128 1) (GEQ s26 1) (GEQ s126 1) (GEQ s12 1) (GEQ s116 1) (GEQ s14 1) (GEQ s114 ...], 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 26 steps with 0 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-01 finished in 1125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p0))))'
Support contains 9 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 20 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 02:06:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:01] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:06:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:01] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:06:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:01] [INFO ] Dead Transitions using invariants and state equation in 95 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 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (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))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-COL-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-04 finished in 316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 9 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 9 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 02:06:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:01] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:06:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:01] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:06:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:01] [INFO ] Dead Transitions using invariants and state equation in 123 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 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(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))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-05 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((p0 U p1))&&(F(p0)||X((G(p1)||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 15 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 02:06:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:01] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:06:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:01] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 02:06:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:01] [INFO ] Dead Transitions using invariants and state equation in 72 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 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BART-COL-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s0 1), 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))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 196 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 p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-COL-010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-010-LTLFireability-06 finished in 998 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(((p0 U p1) U p1))&&X(p2)))))'
Support contains 78 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 02:06:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:02] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:02] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:06:02] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:02] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 02:06:03] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BART-COL-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s108 1) (GEQ s111 1) (GEQ s109 1) (GEQ s110 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p0:(GEQ s1 1), p2:(OR (GEQ s20 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3624 reset in 330 ms.
Product exploration explored 100000 steps with 3617 reset in 357 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 p0) (NOT p2)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Finished random walk after 144 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:06:05] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-16 02:06:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:06:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:06:05] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-16 02:06:05] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-16 02:06:06] [INFO ] Added : 166 causal constraints over 34 iterations in 640 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:06] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:06] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:06:06] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-16 02:06:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:06:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-16 02:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:06:06] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2022-05-16 02:06:06] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-16 02:06:07] [INFO ] Added : 166 causal constraints over 34 iterations in 487 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 78 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 02:06:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:07] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:07] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:07] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:06:07] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 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 : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Finished random walk after 100 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:08] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:06:08] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-16 02:06:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:06:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 02:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:06:08] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-16 02:06:08] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 02:06:08] [INFO ] Added : 166 causal constraints over 34 iterations in 481 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:09] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-16 02:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:06:09] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-16 02:06:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:06:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 02:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:06:09] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-16 02:06:09] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 02:06:09] [INFO ] Added : 166 causal constraints over 34 iterations in 443 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3627 reset in 357 ms.
Product exploration explored 100000 steps with 3690 reset in 211 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Support contains 78 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 202
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 23 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2022-05-16 02:06:11] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:11] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/132 places, 202/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Product exploration explored 100000 steps with 4028 reset in 267 ms.
Product exploration explored 100000 steps with 4055 reset in 283 ms.
Built C files in :
/tmp/ltsmin14332792230719226359
[2022-05-16 02:06:11] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14332792230719226359
Running compilation step : cd /tmp/ltsmin14332792230719226359;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 516 ms.
Running link step : cd /tmp/ltsmin14332792230719226359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin14332792230719226359;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16809603947789195558.hoa' '--buchi-type=spotba'
LTSmin run took 763 ms.
FORMULA BART-COL-010-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-010-LTLFireability-07 finished in 10452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(F(G((F(!p0) U p1)))))||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 02:06:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:13] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:13] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:06:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:13] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-COL-010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(LT s0 1), p1:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s73 1) (GEQ s16 1) (GEQ s65 1) (GEQ s8 1) (GEQ s69 1) (GEQ s57 1) (GEQ s61 1) (GEQ s48 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 575 reset in 381 ms.
Stack based approach found an accepted trace after 61404 steps with 356 reset with depth 161 and stack size 161 in 206 ms.
FORMULA BART-COL-010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-08 finished in 1052 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p1)&&(F(G(p2))||F(p3)))||p0)))'
Support contains 131 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 02:06:14] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 02:06:14] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:14] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p3) (NOT p2)), true]
Running random walk in product with property : BART-COL-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s78 1) (GEQ s77 1) (GEQ s108 1) (GEQ s111 1) (GEQ s109 1) (GEQ s110 1) (GEQ s42 1) (GEQ s41 1) (GEQ s79 1)), p3:(OR (GEQ s20 1) (GEQ s124 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA BART-COL-010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-010-LTLFireability-09 finished in 422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G((X(p0)||p0)) U F(p0)) U X((p1 U p2))))'
Support contains 90 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 8 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 02:06:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:06:14] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:06:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:14] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 02:06:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:14] [INFO ] Dead Transitions using invariants and state equation in 89 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 131 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1 1), p2:(GEQ s0 1), p1:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s68 1) (GEQ s16 1) (GEQ s60 1) (GEQ s8 1) (GEQ s64 1) (GEQ s52 1) (GEQ s56 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 152 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) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-COL-010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-010-LTLFireability-11 finished in 841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 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 0 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 34 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:06:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:15] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:06:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:06:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-16 02:06:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 02:06:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:06:15] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3539 reset in 61 ms.
Stack based approach found an accepted trace after 8 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BART-COL-010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-13 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((X(G(p0))&&p1)))&&X(p2)&&F(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 1 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 02:06:15] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:15] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:15] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 02:06:15] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 02:06:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:06:15] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BART-COL-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s20 1) (GEQ s24 1) (GEQ s12 1) (GEQ s73 1) (GEQ s16 1) (GEQ s65 1) (GEQ s8 1) (GEQ s69 1) (GEQ s57 1) (GEQ s61 1) (GEQ s48 1) (GEQ s105 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 4678 steps with 0 reset with depth 4679 and stack size 4679 in 15 ms.
FORMULA BART-COL-010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-010-LTLFireability-14 finished in 653 ms.
All properties solved by simple procedures.
Total runtime 20337 ms.

BK_STOP 1652666776555

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

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