fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r137-smll-167819418900596
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DrinkVendingMachine-COL-24

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
359.020 13057.00 22587.00 459.20 TFFFFFFFTTFFFFTT normal

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.r137-smll-167819418900596.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DrinkVendingMachine-COL-24, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418900596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K 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 DrinkVendingMachine-COL-24-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-24-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678975030721

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-24
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 13:57:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 13:57:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 13:57:13] [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-16 13:57:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 13:57:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 793 ms
[2023-03-16 13:57:14] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 288 PT places and 3.3235344E7 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 13:57:14] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 9 ms.
[2023-03-16 13:57:14] [INFO ] Skeletonized 8 HLPN properties in 3 ms. Removed 8 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10010 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-03-16 13:57:14] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-16 13:57:15] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
[2023-03-16 13:57:15] [INFO ] Flatten gal took : 32 ms
FORMULA DrinkVendingMachine-COL-24-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 13:57:15] [INFO ] Flatten gal took : 4 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:96) in guard (LEQ $x 23)introduces in Quality(96) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:96) in guard (AND (GT $x 23) (LEQ $x 47))introduces in Quality(96) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:96) in guard (AND (GT $x 47) (LEQ $x 71))introduces in Quality(96) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:96) in guard (AND (GT $x 71) (LEQ $x 95))introduces in Quality(96) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 96 reducing to 4 values.
For transition elaborate0:(LEQ $x 23) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 23) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 47) (LEQ $x 71)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 71) (LEQ $x 95)) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 24
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 24
[2023-03-16 13:57:15] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 30 ms.
[2023-03-16 13:57:15] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-24-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-24-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 11 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 13:57:15] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 13:57:15] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-16 13:57:15] [INFO ] Invariant cache hit.
[2023-03-16 13:57:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-16 13:57:15] [INFO ] Invariant cache hit.
[2023-03-16 13:57:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-16 13:57:15] [INFO ] Invariant cache hit.
[2023-03-16 13:57:15] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 13:57:15] [INFO ] Flatten gal took : 8 ms
[2023-03-16 13:57:15] [INFO ] Flatten gal took : 7 ms
[2023-03-16 13:57:15] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 176 steps, including 0 resets, run visited all 10 properties in 20 ms. (steps per millisecond=8 )
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' '!(F((X(p1)&&p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:57:16] [INFO ] Invariant cache hit.
[2023-03-16 13:57:16] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
[2023-03-16 13:57:16] [INFO ] Invariant cache hit.
[2023-03-16 13:57:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-16 13:57:16] [INFO ] Invariant cache hit.
[2023-03-16 13:57:16] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-16 13:57:16] [INFO ] Invariant cache hit.
[2023-03-16 13:57:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 3) (GEQ s3 1) (GEQ s4 1)), p1:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 545 ms.
Product exploration explored 100000 steps with 50000 reset in 409 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 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-24-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-00 finished in 1920 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((G(!p0) U G(!p1))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:57:17] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
[2023-03-16 13:57:18] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 13:57:18] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-16 13:57:18] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 218 ms :[p1, p1, true, (AND (NOT p1) p0), p1]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p0:(AND (NOT (OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (NOT (AND (GEQ s3 1) (GEQ s7 1))))) ...], 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 65 steps with 15 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-02 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 7 ms. Remains 6 /12 variables (removed 6) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-16 13:57:18] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 13:57:18] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-16 13:57:18] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 13:57:18] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-16 13:57:18] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-16 13:57:18] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/12 places, 7/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-03 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:(OR (LT s1 1) (LT s3 1) (LT s4 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 2958 reset in 169 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-03 finished in 431 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 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-16 13:57:18] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 13:57:18] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 13:57:18] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-16 13:57:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 13:57:18] [INFO ] Invariant cache hit.
[2023-03-16 13:57:18] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 8/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 8/12 places, 8/10 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-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 s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 150 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-05 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 13:57:19] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 13:57:19] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-16 13:57:19] [INFO ] Invariant cache hit.
[2023-03-16 13:57:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-16 13:57:19] [INFO ] Invariant cache hit.
[2023-03-16 13:57:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-16 13:57:19] [INFO ] Invariant cache hit.
[2023-03-16 13:57:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, p0, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT 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 s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 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 DrinkVendingMachine-COL-24-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-06 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(G(p1))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:57:19] [INFO ] Invariant cache hit.
[2023-03-16 13:57:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-16 13:57:19] [INFO ] Invariant cache hit.
[2023-03-16 13:57:19] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 13:57:19] [INFO ] Invariant cache hit.
[2023-03-16 13:57:19] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-16 13:57:19] [INFO ] Invariant cache hit.
[2023-03-16 13:57:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LT s2 1), p0:(OR (LT s1 1) (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-07 finished in 342 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((p0||G(p1))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:57:19] [INFO ] Invariant cache hit.
[2023-03-16 13:57:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-16 13:57:20] [INFO ] Invariant cache hit.
[2023-03-16 13:57:20] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-16 13:57:20] [INFO ] Invariant cache hit.
[2023-03-16 13:57:20] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-16 13:57:20] [INFO ] Invariant cache hit.
[2023-03-16 13:57:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s3 1) (LT s6 1)), p0:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 117 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 (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-24-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-08 finished in 618 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)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:57:20] [INFO ] Invariant cache hit.
[2023-03-16 13:57:20] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-16 13:57:20] [INFO ] Invariant cache hit.
[2023-03-16 13:57:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-16 13:57:20] [INFO ] Invariant cache hit.
[2023-03-16 13:57:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-16 13:57:20] [INFO ] Invariant cache hit.
[2023-03-16 13:57:20] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 142 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-24-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-09 finished in 722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:57:21] [INFO ] Invariant cache hit.
[2023-03-16 13:57:21] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-16 13:57:21] [INFO ] Invariant cache hit.
[2023-03-16 13:57:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 13:57:21] [INFO ] Invariant cache hit.
[2023-03-16 13:57:21] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-16 13:57:21] [INFO ] Invariant cache hit.
[2023-03-16 13:57:21] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-11 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:(AND (GEQ s3 1) (GEQ s7 1) (GEQ s0 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 111 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-11 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:57:21] [INFO ] Invariant cache hit.
[2023-03-16 13:57:21] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
[2023-03-16 13:57:21] [INFO ] Invariant cache hit.
[2023-03-16 13:57:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-16 13:57:21] [INFO ] Invariant cache hit.
[2023-03-16 13:57:21] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-16 13:57:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:57:21] [INFO ] Invariant cache hit.
[2023-03-16 13:57:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-12 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:(AND (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1) (OR (LT s1 3) (LT s3 1) (LT s4 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 802 reset in 185 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-12 finished in 508 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)||(p0&&G(F(p1)))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:57:22] [INFO ] Invariant cache hit.
[2023-03-16 13:57:22] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-16 13:57:22] [INFO ] Invariant cache hit.
[2023-03-16 13:57:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 13:57:22] [INFO ] Invariant cache hit.
[2023-03-16 13:57:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-16 13:57:22] [INFO ] Invariant cache hit.
[2023-03-16 13:57:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(LT s0 1), p0:(OR (LT s1 3) (LT s3 1) (LT s4 1))], 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 20 reset in 201 ms.
Stack based approach found an accepted trace after 110 steps with 0 reset with depth 111 and stack size 105 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLFireability-13 finished in 636 ms.
All properties solved by simple procedures.
Total runtime 9460 ms.
ITS solved all properties within timeout

BK_STOP 1678975043778

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="DrinkVendingMachine-COL-24"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DrinkVendingMachine-COL-24, 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 r137-smll-167819418900596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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