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-167819418900588.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-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418900588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.2K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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 25K 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-16-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678974836160

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-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 13:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 13:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 13:53:59] [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:53:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 13:53:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 714 ms
[2023-03-16 13:53:59] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 192 PT places and 4473952.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 13:54:00] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 6 ms.
[2023-03-16 13:54:00] [INFO ] Skeletonized 7 HLPN properties in 2 ms. Removed 9 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=0 )
[2023-03-16 13:54:00] [INFO ] Flatten gal took : 17 ms
[2023-03-16 13:54:00] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:64) in guard (AND (GT $x 47) (LEQ $x 63))introduces in Quality(64) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:64) in guard (AND (GT $x 31) (LEQ $x 47))introduces in Quality(64) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:64) in guard (AND (GT $x 15) (LEQ $x 31))introduces in Quality(64) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:64) in guard (LEQ $x 15)introduces in Quality(64) 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 64 reducing to 4 values.
For transition elaborate3:(AND (GT $x 47) (LEQ $x 63)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 31) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 15) (LEQ $x 31)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 15) -> (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 16
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 16
[2023-03-16 13:54:00] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 21 ms.
[2023-03-16 13:54:00] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-LTLFireability-10 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 7 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:54:00] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-16 13:54:00] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
[2023-03-16 13:54:00] [INFO ] Invariant cache hit.
[2023-03-16 13:54:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-16 13:54:00] [INFO ] Invariant cache hit.
[2023-03-16 13:54:00] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-16 13:54:00] [INFO ] Invariant cache hit.
[2023-03-16 13:54:00] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 13:54:00] [INFO ] Flatten gal took : 4 ms
[2023-03-16 13:54:00] [INFO ] Flatten gal took : 5 ms
[2023-03-16 13:54:00] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 197 steps, including 0 resets, run visited all 15 properties in 14 ms. (steps per millisecond=14 )
FORMULA DrinkVendingMachine-COL-16-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DrinkVendingMachine-COL-16-LTLFireability-05 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(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:54:01] [INFO ] Invariant cache hit.
[2023-03-16 13:54:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-16 13:54:01] [INFO ] Invariant cache hit.
[2023-03-16 13:54:01] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 13:54:01] [INFO ] Invariant cache hit.
[2023-03-16 13:54:01] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-16 13:54:01] [INFO ] Invariant cache hit.
[2023-03-16 13:54:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s11 1) (AND (GEQ s5 1) (GEQ s8 1) (GEQ s10 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 352 ms.
Product exploration explored 100000 steps with 50000 reset in 178 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 79 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-16-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-00 finished in 1127 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)||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:54:02] [INFO ] Invariant cache hit.
[2023-03-16 13:54:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-16 13:54:02] [INFO ] Invariant cache hit.
[2023-03-16 13:54:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-16 13:54:02] [INFO ] Invariant cache hit.
[2023-03-16 13:54:02] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-16 13:54:02] [INFO ] Invariant cache hit.
[2023-03-16 13:54:02] [INFO ] Dead Transitions using invariants and state equation in 31 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 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (LT s9 1) (GEQ s5 1) (GEQ s8 1) (GEQ s10 1)), p0:(LT s9 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 0 reset in 303 ms.
Stack based approach found an accepted trace after 22 steps with 2 reset with depth 17 and stack size 17 in 1 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-02 finished in 578 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(F(!(F(((p0 U p1)&&F(X(X(p0))))) U p2)))))'
Support contains 5 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 6 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:54:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 13:54:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-16 13:54:02] [INFO ] Invariant cache hit.
[2023-03-16 13:54:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 13:54:02] [INFO ] Invariant cache hit.
[2023-03-16 13:54:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-16 13:54:02] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-16 13:54:02] [INFO ] Invariant cache hit.
[2023-03-16 13:54:03] [INFO ] Dead Transitions using invariants and state equation in 33 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 156 ms. Remains : 8/12 places, 8/10 transitions.
Stuttering acceptance computed with spot in 798 ms :[p2, p2, (AND p2 p1 p0), (AND p0 p2), (AND p2 p1 p0), (AND p2 p1 p0), (AND p0 p2), (AND p0 p2), (AND p2 p1 p0), (AND p2 p1 p0), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p2)]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={0, 1, 2, 3} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 3} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 3} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0, 3} source=2 dest: 2}, { cond=p2, acceptance={0, 2, 3} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 3} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1, 2, 3} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=2 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2, 3} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0, 3} source=3 dest: 5}, { cond=p2, acceptance={0, 1, 2, 3} source=3 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 3} source=3 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=3 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 3} source=4 dest: 5}, { cond=(AND p1 p2), acceptance={0, 1, 2, 3} source=4 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 3} source=4 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=4 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={3} source=4 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2, 3} source=4 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 3} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={0, 2, 3} source=5 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 3} source=5 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2, 3} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2, 3} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=5 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1, 2} source=5 dest: 7}], [{ cond=(AND p0 p2), acceptance={0, 1, 2, 3} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 3} source=6 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 3} source=6 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0, 3} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={0, 1, 2, 3} source=7 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 3} source=7 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 3} source=8 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1, 2} source=8 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2, 3} source=8 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 3} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=8 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={3} source=8 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2, 3} source=8 dest: 10}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 3} source=9 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0, 2, 3} source=9 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 3} source=9 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2, 3} source=9 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=9 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2, 3} source=9 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 2} source=9 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1, 2} source=9 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={3} source=9 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={2, 3} source=9 dest: 11}], [{ cond=(AND p0 p1 p2), acceptance={0, 1, 2, 3} source=10 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 3} source=10 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 3} source=10 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=10 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=10 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1, 2} source=10 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=10 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={3} source=10 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2, 3} source=10 dest: 12}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 3} source=11 dest: 2}, { cond=(AND p1 p2), acceptance={0, 2, 3} source=11 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 3} source=11 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1, 2, 3} source=11 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=11 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2, 3} source=11 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={3} source=11 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={2, 3} source=11 dest: 11}], [{ cond=(AND p1 p2), acceptance={0, 1, 2, 3} source=12 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 3} source=12 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 3} source=12 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 3} source=12 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={3} source=12 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2, 3} source=12 dest: 12}]], initial=0, aps=[p2:(GEQ s5 1), p1:(AND (GEQ s2 1) (GEQ s4 1)), p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s6 3))], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-03 finished in 1212 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((X(p0)||(G(p1)&&X(F(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 2 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:54:04] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-16 13:54:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) p0)]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3)), p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72 steps with 21 reset in 2 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-04 finished in 372 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)))'
Support contains 1 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:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-06 finished in 241 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)&&F(G(((G(!p1)||X(p2))&&(X(p2)||F(p3)))))))'
Support contains 9 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:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-16 13:54:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:54:04] [INFO ] Invariant cache hit.
[2023-03-16 13:54:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 481 ms :[(OR p0 (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), p0, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), false, false]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=6 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s11 1), p1:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3)), p3:(OR (LT s6 1) (LT s8 1) (LT s10 2)), p2:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 4620 reset in 420 ms.
Stack based approach found an accepted trace after 272 steps with 13 reset with depth 4 and stack size 4 in 2 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-07 finished in 1077 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 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 0 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 5 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:54:05] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 13:54:05] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-16 13:54:05] [INFO ] Invariant cache hit.
[2023-03-16 13:54:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 13:54:05] [INFO ] Invariant cache hit.
[2023-03-16 13:54:05] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-16 13:54:05] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-16 13:54:05] [INFO ] Invariant cache hit.
[2023-03-16 13:54:05] [INFO ] Dead Transitions using invariants and state equation in 30 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 160 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s4 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 207 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 17 in 0 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-08 finished in 451 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)||G(F((!p1&&X(p2))))))'
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:54:06] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 13:54:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-16 13:54:06] [INFO ] Invariant cache hit.
[2023-03-16 13:54:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-16 13:54:06] [INFO ] Invariant cache hit.
[2023-03-16 13:54:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-16 13:54:06] [INFO ] Invariant cache hit.
[2023-03-16 13:54:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s8 1) (LT s10 2)), p1:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s10 1)), p2:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s10 1) (GEQ s6 1) (GEQ s8 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1098 reset in 239 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-09 finished in 568 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(p1)||X((p2 U (p3||G(p2)))))))'
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:54:06] [INFO ] Invariant cache hit.
[2023-03-16 13:54:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-16 13:54:06] [INFO ] Invariant cache hit.
[2023-03-16 13:54:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-16 13:54:06] [INFO ] Invariant cache hit.
[2023-03-16 13:54:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-16 13:54:06] [INFO ] Invariant cache hit.
[2023-03-16 13:54:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR p0 (AND (NOT p1) (NOT p2) (NOT p3))), p0, (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s9 1) (AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3))), p0:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s10 1)), p3:(AND (NOT (AND (GEQ s4 1) (GEQ s8 1))) (NOT (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 181 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-11 finished in 579 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 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 0 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 3 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:54:07] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 13:54:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-16 13:54:07] [INFO ] Invariant cache hit.
[2023-03-16 13:54:07] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 13:54:07] [INFO ] Invariant cache hit.
[2023-03-16 13:54:07] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-16 13:54:07] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-16 13:54:07] [INFO ] Invariant cache hit.
[2023-03-16 13:54:07] [INFO ] Dead Transitions using invariants and state equation in 31 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 151 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s4 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 172 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 23 in 0 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-12 finished in 393 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) U G(!p1)))'
Support contains 8 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 2 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:54:07] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 13:54:07] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-16 13:54:07] [INFO ] Invariant cache hit.
[2023-03-16 13:54:07] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-16 13:54:07] [INFO ] Invariant cache hit.
[2023-03-16 13:54:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-16 13:54:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:54:07] [INFO ] Invariant cache hit.
[2023-03-16 13:54:07] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 107 ms :[p1, (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3)), p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (AND (GEQ s4 1) (GEQ s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 240 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 100 in 0 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-14 finished in 552 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)))'
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:54:08] [INFO ] Invariant cache hit.
[2023-03-16 13:54:08] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-16 13:54:08] [INFO ] Invariant cache hit.
[2023-03-16 13:54:08] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-16 13:54:08] [INFO ] Invariant cache hit.
[2023-03-16 13:54:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-16 13:54:08] [INFO ] Invariant cache hit.
[2023-03-16 13:54:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-16-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-16-LTLFireability-15 finished in 368 ms.
All properties solved by simple procedures.
Total runtime 9729 ms.
ITS solved all properties within timeout

BK_STOP 1678974849709

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

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