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.r005-oct2-167813593500716.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 itstools
Input is BART-COL-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593500716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 04:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 04:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 04:23 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.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 06:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 06:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 195K 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-020-LTLFireability-00
FORMULA_NAME BART-COL-020-LTLFireability-01
FORMULA_NAME BART-COL-020-LTLFireability-02
FORMULA_NAME BART-COL-020-LTLFireability-03
FORMULA_NAME BART-COL-020-LTLFireability-04
FORMULA_NAME BART-COL-020-LTLFireability-05
FORMULA_NAME BART-COL-020-LTLFireability-06
FORMULA_NAME BART-COL-020-LTLFireability-07
FORMULA_NAME BART-COL-020-LTLFireability-08
FORMULA_NAME BART-COL-020-LTLFireability-09
FORMULA_NAME BART-COL-020-LTLFireability-10
FORMULA_NAME BART-COL-020-LTLFireability-11
FORMULA_NAME BART-COL-020-LTLFireability-12
FORMULA_NAME BART-COL-020-LTLFireability-13
FORMULA_NAME BART-COL-020-LTLFireability-14
FORMULA_NAME BART-COL-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678525109055

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-020
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-11 08:58:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 08:58:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:58:32] [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-11 08:58:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 08:58:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 837 ms
[2023-03-11 08:58:33] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-11 08:58:33] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 15293 PT places and 2.814459024E10 transition bindings in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 08:58:33] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 12 ms.
[2023-03-11 08:58:33] [INFO ] Skeletonized 1 HLPN properties in 4 ms. Removed 15 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.
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 20
Arc [1:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2023-03-11 08:58:33] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 335 ms.
[2023-03-11 08:58:33] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
[2023-03-11 08:58:33] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:58:33] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:58:33] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:58:33] [INFO ] Reduced 35 identical enabling conditions.
[2023-03-11 08:58:33] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-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 7 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-11 08:58:34] [INFO ] Computed 1 place invariants in 10 ms
[2023-03-11 08:58:34] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-11 08:58:34] [INFO ] Invariant cache hit.
[2023-03-11 08:58:34] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-11 08:58:34] [INFO ] Invariant cache hit.
[2023-03-11 08:58:34] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2023-03-11 08:58:34] [INFO ] Flatten gal took : 40 ms
[2023-03-11 08:58:34] [INFO ] Flatten gal took : 18 ms
[2023-03-11 08:58:34] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 3220 steps, including 0 resets, run visited all 8 properties in 30 ms. (steps per millisecond=107 )
FORMULA BART-COL-020-LTLFireability-14 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' '!(X(F((G(F(p0))||(X(G(p1))&&(G(F(p0))||(F(p0)&&F(p2))))))))'
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 32 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-11 08:58:35] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-11 08:58:35] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 08:58:35] [INFO ] Invariant cache hit.
[2023-03-11 08:58:35] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-11 08:58:35] [INFO ] Invariant cache hit.
[2023-03-11 08:58:36] [INFO ] Dead Transitions using invariants and state equation in 151 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 379 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 725 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-COL-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s1 1), p2:(AND (LT s78 1) (LT s77 1) (LT s85 1) (LT s88 1) (LT s86 1) (LT s87 1) (LT s42 1) (LT s41 1) (LT s79 1)), p1:(OR (GEQ s78 1) (GEQ s77 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 131 reset in 359 ms.
Stack based approach found an accepted trace after 44553 steps with 50 reset with depth 1958 and stack size 1958 in 112 ms.
FORMULA BART-COL-020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-00 finished in 1735 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' '!((p0 U X(G((!p1 U p2)))))'
Support contains 70 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 6 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2023-03-11 08:58:37] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-11 08:58:37] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 08:58:37] [INFO ] Invariant cache hit.
[2023-03-11 08:58:37] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-11 08:58:37] [INFO ] Invariant cache hit.
[2023-03-11 08:58:37] [INFO ] Dead Transitions using invariants and state equation in 121 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 302 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : BART-COL-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(GEQ s0 1), p1:(LT s1 1), 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 s...], 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]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 1 ms.
FORMULA BART-COL-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-020-LTLFireability-01 finished in 603 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' '!((p0 U (!p0&&G(!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 26 ms. Remains 108 /132 variables (removed 24) and now considering 178/202 (removed 24) transitions.
// Phase 1: matrix 178 rows 108 cols
[2023-03-11 08:58:37] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-11 08:58:38] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-11 08:58:38] [INFO ] Invariant cache hit.
[2023-03-11 08:58:38] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-11 08:58:38] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-11 08:58:38] [INFO ] Invariant cache hit.
[2023-03-11 08:58:38] [INFO ] Dead Transitions using invariants and state equation in 183 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 451 ms. Remains : 108/132 places, 178/202 transitions.
Stuttering acceptance computed with spot in 154 ms :[p1, true, (OR p0 p1)]
Running random walk in product with property : BART-COL-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (GEQ s19 1) (GEQ s100 1) (GEQ s21 1) (GEQ s98 1) (GEQ s23 1) (GEQ s104 1) (GEQ s25 1) (GEQ s102 1) (GEQ s11 1) (GEQ s92 1) (GEQ s13 1) (GEQ s90 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 1 ms.
FORMULA BART-COL-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-020-LTLFireability-03 finished in 635 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 68 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 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 27 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2023-03-11 08:58:38] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 08:58:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 08:58:38] [INFO ] Invariant cache hit.
[2023-03-11 08:58:38] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-11 08:58:38] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-11 08:58:38] [INFO ] Invariant cache hit.
[2023-03-11 08:58:38] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 436 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 309 ms.
Product exploration explored 100000 steps with 0 reset in 388 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 p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 298 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
[2023-03-11 08:58:40] [INFO ] Invariant cache hit.
[2023-03-11 08:58:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 08:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:58:40] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-11 08:58:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:58:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 08:58:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:58:41] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-11 08:58:41] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-11 08:58:41] [INFO ] Added : 131 causal constraints over 27 iterations in 591 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-11 08:58:41] [INFO ] Invariant cache hit.
[2023-03-11 08:58:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 08:58:41] [INFO ] Invariant cache hit.
[2023-03-11 08:58:41] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-11 08:58:42] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 08:58:42] [INFO ] Invariant cache hit.
[2023-03-11 08:58:42] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 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 p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(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 p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
[2023-03-11 08:58:42] [INFO ] Invariant cache hit.
[2023-03-11 08:58:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 08:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:58:43] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-11 08:58:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:58:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 08:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:58:43] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-11 08:58:43] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-11 08:58:43] [INFO ] Added : 131 causal constraints over 27 iterations in 730 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Product exploration explored 100000 steps with 0 reset in 246 ms.
Built C files in :
/tmp/ltsmin11272992188498676366
[2023-03-11 08:58:44] [INFO ] Computing symmetric may disable matrix : 167 transitions.
[2023-03-11 08:58:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:58:44] [INFO ] Computing symmetric may enable matrix : 167 transitions.
[2023-03-11 08:58:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:58:44] [INFO ] Computing Do-Not-Accords matrix : 167 transitions.
[2023-03-11 08:58:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:58:44] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11272992188498676366
Running compilation step : cd /tmp/ltsmin11272992188498676366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 593 ms.
Running link step : cd /tmp/ltsmin11272992188498676366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin11272992188498676366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17580477322057831666.hoa' '--buchi-type=spotba'
LTSmin run took 698 ms.
FORMULA BART-COL-020-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-020-LTLFireability-05 finished in 7692 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(G(!p0))&&((!p1 U X(X(p1))) U (p1&&(!p1 U X(X(p1))))))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-11 08:58:46] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-11 08:58:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-11 08:58:46] [INFO ] Invariant cache hit.
[2023-03-11 08:58:46] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-11 08:58:46] [INFO ] Invariant cache hit.
[2023-03-11 08:58:46] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 456 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BART-COL-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(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], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 293 ms.
Stack based approach found an accepted trace after 1941 steps with 0 reset with depth 1942 and stack size 1942 in 5 ms.
FORMULA BART-COL-020-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-06 finished in 1034 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||(F(!p1) U X(!p2))))))'
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 31 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-11 08:58:47] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-11 08:58:47] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-11 08:58:47] [INFO ] Invariant cache hit.
[2023-03-11 08:58:47] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-11 08:58:47] [INFO ] Invariant cache hit.
[2023-03-11 08:58:47] [INFO ] Dead Transitions using invariants and state equation in 172 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 422 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : BART-COL-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1), p2:(AND (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)) (GEQ s0 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 33224 reset in 224 ms.
Product exploration explored 100000 steps with 33179 reset in 285 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 p0 (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0)]
Finished random walk after 2105 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=263 )
Knowledge obtained : [(AND p0 (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND p2 p0))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0)]
Stuttering acceptance computed with spot in 228 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0)]
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2023-03-11 08:58:49] [INFO ] Invariant cache hit.
[2023-03-11 08:58:49] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 08:58:49] [INFO ] Invariant cache hit.
[2023-03-11 08:58:49] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-11 08:58:49] [INFO ] Invariant cache hit.
[2023-03-11 08:58:49] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 90/90 places, 160/160 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 p2) p0)]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Finished random walk after 503 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND (NOT p2) p0)]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (AND p0 p2))]
Knowledge based reduction with 1 factoid took 231 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 204 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 129 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 33204 reset in 187 ms.
Product exploration explored 100000 steps with 33134 reset in 143 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 266 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 160
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 11 place count 90 transition count 160
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 90 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 89 transition count 159
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 89 transition count 159
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 38 place count 89 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 89 transition count 159
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 58 place count 70 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 77 place count 70 transition count 140
Performed 33 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 110 place count 70 transition count 602
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Iterating post reduction 2 with 281 rules applied. Total rules applied 391 place count 70 transition count 321
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 416 place count 45 transition count 101
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 441 place count 45 transition count 101
Deduced a syphon composed of 24 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 45 transition count 100
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 442 rules in 47 ms. Remains 45 /90 variables (removed 45) and now considering 100/160 (removed 60) transitions.
[2023-03-11 08:58:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 45 cols
[2023-03-11 08:58:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 08:58:52] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/90 places, 100/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 45/90 places, 100/160 transitions.
Built C files in :
/tmp/ltsmin318211380540322522
[2023-03-11 08:58:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin318211380540322522
Running compilation step : cd /tmp/ltsmin318211380540322522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin318211380540322522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin318211380540322522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10924056538747315157.hoa' '--buchi-type=spotba'
LTSmin run took 1454 ms.
FORMULA BART-COL-020-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-020-LTLFireability-08 finished in 6667 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&&G((F(G(!p1))&&F(p2)))))))'
Support contains 99 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
[2023-03-11 08:58:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 08:58:53] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 08:58:53] [INFO ] Invariant cache hit.
[2023-03-11 08:58:54] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 08:58:54] [INFO ] Invariant cache hit.
[2023-03-11 08:58:54] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), p1, (NOT p2), (OR (NOT p2) p1), (NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LT s78 1) (LT s77 1) (LT s108 1) (LT s111 1) (LT s109 1) (LT s110 1) (LT s42 1) (LT s41 1) (LT s79 1)), p2:(AND (OR (GEQ s20 1) (GEQ s24 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 229 ms.
Stack based approach found an accepted trace after 27652 steps with 3 reset with depth 27439 and stack size 27439 in 56 ms.
FORMULA BART-COL-020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-09 finished in 943 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(F(p1))))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 10 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2023-03-11 08:58:54] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-11 08:58:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 08:58:54] [INFO ] Invariant cache hit.
[2023-03-11 08:58:55] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-11 08:58:55] [INFO ] Invariant cache hit.
[2023-03-11 08:58:55] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(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) (GEQ s43 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 170 ms.
Product exploration explored 100000 steps with 50000 reset in 145 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 p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-020-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-020-LTLFireability-10 finished in 1017 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((!p0&&F(p1)))||X(F(!p1))))'
Support contains 97 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
[2023-03-11 08:58:55] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 08:58:55] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 08:58:55] [INFO ] Invariant cache hit.
[2023-03-11 08:58:56] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-11 08:58:56] [INFO ] Invariant cache hit.
[2023-03-11 08:58:56] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 214 ms :[p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[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) (GEQ s105 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], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 471 reset in 276 ms.
Product exploration explored 100000 steps with 486 reset in 282 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 (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 615 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p1, 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 (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F p1)]
Knowledge based reduction with 3 factoid took 440 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p1, p1]
Stuttering acceptance computed with spot in 136 ms :[p1, p1]
Support contains 88 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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.
[2023-03-11 08:58:58] [INFO ] Invariant cache hit.
[2023-03-11 08:58:58] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 08:58:58] [INFO ] Invariant cache hit.
[2023-03-11 08:58:58] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-11 08:58:58] [INFO ] Invariant cache hit.
[2023-03-11 08:58:59] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. 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 : [(NOT p1)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[p1, p1]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 352 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[p1, p1]
Stuttering acceptance computed with spot in 148 ms :[p1, p1]
Stuttering acceptance computed with spot in 138 ms :[p1, p1]
Product exploration explored 100000 steps with 483 reset in 288 ms.
Product exploration explored 100000 steps with 494 reset in 253 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 117 ms :[p1, p1]
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 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 127 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 11 place count 127 transition count 197
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 127 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 120 transition count 190
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 120 transition count 190
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 116 transition count 186
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 116 transition count 186
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 112 transition count 182
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 112 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 109 transition count 179
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 109 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 107 transition count 177
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 107 transition count 177
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 105 transition count 175
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 105 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 104 transition count 174
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 104 transition count 174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 103 transition count 173
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 103 transition count 173
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 103 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 103 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 82 place count 90 transition count 159
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 95 place count 90 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 95 rules in 55 ms. Remains 90 /132 variables (removed 42) and now considering 159/202 (removed 43) transitions.
[2023-03-11 08:59:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 159 rows 90 cols
[2023-03-11 08:59:01] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-11 08:59:01] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/132 places, 159/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 90/132 places, 159/202 transitions.
Built C files in :
/tmp/ltsmin10449829556373267369
[2023-03-11 08:59:01] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10449829556373267369
Running compilation step : cd /tmp/ltsmin10449829556373267369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 355 ms.
Running link step : cd /tmp/ltsmin10449829556373267369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin10449829556373267369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14666477521365024426.hoa' '--buchi-type=spotba'
LTSmin run took 826 ms.
FORMULA BART-COL-020-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-020-LTLFireability-13 finished in 6759 ms.
All properties solved by simple procedures.
Total runtime 30374 ms.

BK_STOP 1678525142873

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-020"
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-5348"
echo " Executing tool itstools"
echo " Input is BART-COL-020, 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 r005-oct2-167813593500716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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