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.r135-smll-167819414900620.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 lolaxred
Input is DrinkVendingMachine-COL-98, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414900620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 9.0K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 27K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 14K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 48K 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-98-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678435304118

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-98
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 08:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 08:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:01:49] [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-10 08:01:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 08:01:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1114 ms
[2023-03-10 08:01:51] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 1176 PT places and 3.6529582908E10 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 08:01:51] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 9 ms.
[2023-03-10 08:01:51] [INFO ] Skeletonized 6 HLPN properties in 3 ms. Removed 10 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:392) in guard (LEQ $x 97)introduces in Quality(392) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:392) in guard (AND (GT $x 97) (LEQ $x 195))introduces in Quality(392) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:392) in guard (AND (GT $x 195) (LEQ $x 293))introduces in Quality(392) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:392) in guard (AND (GT $x 293) (LEQ $x 391))introduces in Quality(392) 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 392 reducing to 4 values.
For transition elaborate0:(LEQ $x 97) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 97) (LEQ $x 195)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 195) (LEQ $x 293)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 293) (LEQ $x 391)) -> (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 98
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 98
[2023-03-10 08:01:51] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 46 ms.
[2023-03-10 08:01:51] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-LTLFireability-09 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 10 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-10 08:01:51] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-10 08:01:51] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
[2023-03-10 08:01:51] [INFO ] Invariant cache hit.
[2023-03-10 08:01:51] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-10 08:01:51] [INFO ] Invariant cache hit.
[2023-03-10 08:01:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-10 08:01:51] [INFO ] Invariant cache hit.
[2023-03-10 08:01:51] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-10 08:01:51] [INFO ] Flatten gal took : 27 ms
[2023-03-10 08:01:51] [INFO ] Flatten gal took : 8 ms
[2023-03-10 08:01:52] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 250 steps, including 0 resets, run visited all 13 properties in 33 ms. (steps per millisecond=7 )
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(p0)&&F(p1)) U 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 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 6 ms. Remains 6 /12 variables (removed 6) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-10 08:01:52] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-10 08:01:52] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-10 08:01:52] [INFO ] Invariant cache hit.
[2023-03-10 08:01:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 08:01:52] [INFO ] Invariant cache hit.
[2023-03-10 08:01:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-10 08:01:52] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-10 08:01:52] [INFO ] Invariant cache hit.
[2023-03-10 08:01:52] [INFO ] Dead Transitions using invariants and state equation in 28 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 148 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 3) (GEQ s3 1) (GEQ s4 1)), p1:(LT s0 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 494 ms.
Stack based approach found an accepted trace after 118 steps with 0 reset with depth 119 and stack size 114 in 23 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-01 finished in 998 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((F(p2)&&p1))||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 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-10 08:01:53] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
[2023-03-10 08:01:53] [INFO ] Invariant cache hit.
[2023-03-10 08:01:53] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-10 08:01:53] [INFO ] Invariant cache hit.
[2023-03-10 08:01:53] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-10 08:01:53] [INFO ] Invariant cache hit.
[2023-03-10 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p2:(GEQ s2 1), p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(OR (LT s3 1) (LT s7 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Product exploration explored 100000 steps with 50000 reset in 327 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 p2) p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-98-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-02 finished in 1437 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((!p0 U (G(!p0)||(!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 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:55] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-03-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:55] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, p0, (AND p0 p1), p1, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s6 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-03 finished in 539 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))&&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 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:55] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:55] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:55] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:55] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 1)), p0:(LT 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 176 steps with 0 reset in 4 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-04 finished in 411 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)||(X(X(!p1)) U (X(X(G(!p1)))||(!p2&&X(X(!p1)))))))'
Support contains 9 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-10 08:01:55] [INFO ] Invariant cache hit.
[2023-03-10 08:01:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-10 08:01:56] [INFO ] Invariant cache hit.
[2023-03-10 08:01:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 08:01:56] [INFO ] Invariant cache hit.
[2023-03-10 08:01:56] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-10 08:01:56] [INFO ] Invariant cache hit.
[2023-03-10 08:01:56] [INFO ] Dead Transitions using invariants and state equation in 42 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 353 ms :[p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, true, p1]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(OR (LT s1 3) (LT s3 1) (LT s4 1) (AND (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1))), p2:(OR (AND (GEQ s1 2) (GEQ s3 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-05 finished in 586 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 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-10 08:01:56] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-10 08:01:56] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-10 08:01:56] [INFO ] Invariant cache hit.
[2023-03-10 08:01:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 08:01:56] [INFO ] Invariant cache hit.
[2023-03-10 08:01:56] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 08:01:56] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-10 08:01:56] [INFO ] Invariant cache hit.
[2023-03-10 08:01:56] [INFO ] Dead Transitions using invariants and state equation in 33 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 173 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 105 ms :[p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 2) (GEQ s3 1) (GEQ 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 761 reset in 263 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-06 finished in 561 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(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.
[2023-03-10 08:01:57] [INFO ] Invariant cache hit.
[2023-03-10 08:01:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-10 08:01:57] [INFO ] Invariant cache hit.
[2023-03-10 08:01:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 08:01:57] [INFO ] Invariant cache hit.
[2023-03-10 08:01:57] [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-10 08:01:57] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-10 08:01:57] [INFO ] Invariant cache hit.
[2023-03-10 08:01:57] [INFO ] Dead Transitions using invariants and state equation in 32 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 890 ms :[true, p0, (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 768 reset in 87 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-07 finished in 1157 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(X(X(F(!p0))))))'
Support contains 2 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.
// Phase 1: matrix 10 rows 12 cols
[2023-03-10 08:01:58] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 08:01:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-10 08:01:58] [INFO ] Invariant cache hit.
[2023-03-10 08:01:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 08:01:58] [INFO ] Invariant cache hit.
[2023-03-10 08:01:58] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-10 08:01:58] [INFO ] Invariant cache hit.
[2023-03-10 08:01:58] [INFO ] Dead Transitions using invariants and state equation in 44 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 258 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s3 1) (GEQ s7 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 213 reset in 176 ms.
Stack based approach found an accepted trace after 121 steps with 0 reset with depth 122 and stack size 122 in 1 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-08 finished in 627 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||(p1 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 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 6 ms. Remains 6 /12 variables (removed 6) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-10 08:01:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 08:01:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-10 08:01:58] [INFO ] Invariant cache hit.
[2023-03-10 08:01:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 08:01:58] [INFO ] Invariant cache hit.
[2023-03-10 08:01:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 08:01:59] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 08:01:59] [INFO ] Invariant cache hit.
[2023-03-10 08:01:59] [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 157 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1), p2:(GEQ s2 1), p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 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 2 reset in 161 ms.
Product exploration explored 100000 steps with 3 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (NOT p0) p2 p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (NOT p0) p2 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge based reduction with 9 factoid took 693 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Finished random walk after 6982 steps, including 2 resets, run visited all 5 properties in 52 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (NOT p0) p2 p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (NOT p0) p2 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 850 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
[2023-03-10 08:02:01] [INFO ] Invariant cache hit.
[2023-03-10 08:02:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 08:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:02:01] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-10 08:02:01] [INFO ] Computed and/alt/rep : 3/8/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 08:02:01] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 5 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 08:02:01] [INFO ] Invariant cache hit.
[2023-03-10 08:02:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-10 08:02:01] [INFO ] Invariant cache hit.
[2023-03-10 08:02:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 08:02:01] [INFO ] Invariant cache hit.
[2023-03-10 08:02:01] [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-10 08:02:01] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-10 08:02:01] [INFO ] Invariant cache hit.
[2023-03-10 08:02:01] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 6/6 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 838 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Finished random walk after 7441 steps, including 2 resets, run visited all 5 properties in 30 ms. (steps per millisecond=248 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 838 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
[2023-03-10 08:02:03] [INFO ] Invariant cache hit.
[2023-03-10 08:02:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 08:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:02:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-10 08:02:03] [INFO ] Computed and/alt/rep : 3/8/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 08:02:03] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Stuttering acceptance computed with spot in 115 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 1 reset in 185 ms.
Support contains 5 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 08:02:04] [INFO ] Invariant cache hit.
[2023-03-10 08:02:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-10 08:02:04] [INFO ] Invariant cache hit.
[2023-03-10 08:02:04] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 08:02:04] [INFO ] Invariant cache hit.
[2023-03-10 08:02:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 08:02:04] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-10 08:02:04] [INFO ] Invariant cache hit.
[2023-03-10 08:02:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 6/6 places, 7/7 transitions.
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-10 finished in 5802 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 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-10 08:02:04] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 08:02:04] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-10 08:02:04] [INFO ] Invariant cache hit.
[2023-03-10 08:02:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 08:02:04] [INFO ] Invariant cache hit.
[2023-03-10 08:02:04] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-10 08:02:04] [INFO ] Invariant cache hit.
[2023-03-10 08:02:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s6 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 210 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-11 finished in 319 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(p1)||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 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 08:02:05] [INFO ] Invariant cache hit.
[2023-03-10 08:02:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-10 08:02:05] [INFO ] Invariant cache hit.
[2023-03-10 08:02:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-10 08:02:05] [INFO ] Invariant cache hit.
[2023-03-10 08:02:05] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-10 08:02:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 08:02:05] [INFO ] Invariant cache hit.
[2023-03-10 08:02:05] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s6 1)), p0:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 744 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=372 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 353 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
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-10 08:02:06] [INFO ] Invariant cache hit.
[2023-03-10 08:02:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-10 08:02:06] [INFO ] Invariant cache hit.
[2023-03-10 08:02:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 08:02:06] [INFO ] Invariant cache hit.
[2023-03-10 08:02:06] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-10 08:02:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 08:02:06] [INFO ] Invariant cache hit.
[2023-03-10 08:02:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 597 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=298 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 586 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
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 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 08:02:08] [INFO ] Invariant cache hit.
[2023-03-10 08:02:08] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-10 08:02:08] [INFO ] Invariant cache hit.
[2023-03-10 08:02:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 08:02:08] [INFO ] Invariant cache hit.
[2023-03-10 08:02:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-10 08:02:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 08:02:08] [INFO ] Invariant cache hit.
[2023-03-10 08:02:08] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-12 finished in 3467 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(X((p1 U p2)))||G(!p2)||p0)))'
Support contains 8 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-10 08:02:08] [INFO ] Invariant cache hit.
[2023-03-10 08:02:08] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-10 08:02:08] [INFO ] Invariant cache hit.
[2023-03-10 08:02:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 08:02:08] [INFO ] Invariant cache hit.
[2023-03-10 08:02:08] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-10 08:02:08] [INFO ] Invariant cache hit.
[2023-03-10 08:02:08] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), false, false, p2, false, false, (NOT p2), true]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=1, aps=[p2:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p1:(AND (GEQ s1 3) (GEQ s3 1) (GEQ s4 1)), p0:(OR (LT s1 1) (LT s3 1) (LT s6 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24322 reset in 195 ms.
Product exploration explored 100000 steps with 24370 reset in 209 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 p2) p1 (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), true]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 336 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 594 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=297 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), true]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 353 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
[2023-03-10 08:02:10] [INFO ] Invariant cache hit.
[2023-03-10 08:02:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-10 08:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:02:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-10 08:02:10] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 08:02:10] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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-10 08:02:10] [INFO ] Invariant cache hit.
[2023-03-10 08:02:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-10 08:02:11] [INFO ] Invariant cache hit.
[2023-03-10 08:02:11] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 08:02:11] [INFO ] Invariant cache hit.
[2023-03-10 08:02:11] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-10 08:02:11] [INFO ] Invariant cache hit.
[2023-03-10 08:02:11] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 396 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=198 )
Knowledge obtained : [(AND p1 (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
[2023-03-10 08:02:12] [INFO ] Invariant cache hit.
[2023-03-10 08:02:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 08:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:02:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-10 08:02:12] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 08:02:12] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 517 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 24372 reset in 179 ms.
Product exploration explored 100000 steps with 24349 reset in 193 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
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 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 08:02:13] [INFO ] Invariant cache hit.
[2023-03-10 08:02:13] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-10 08:02:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 08:02:13] [INFO ] Invariant cache hit.
[2023-03-10 08:02:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 12/12 places, 10/10 transitions.
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-10 08:02:13] [INFO ] Invariant cache hit.
[2023-03-10 08:02:13] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-10 08:02:13] [INFO ] Invariant cache hit.
[2023-03-10 08:02:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 08:02:13] [INFO ] Invariant cache hit.
[2023-03-10 08:02:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-10 08:02:13] [INFO ] Invariant cache hit.
[2023-03-10 08:02:13] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-13 finished in 5495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
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 4 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-10 08:02:13] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 08:02:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-10 08:02:14] [INFO ] Invariant cache hit.
[2023-03-10 08:02:14] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 08:02:14] [INFO ] Invariant cache hit.
[2023-03-10 08:02:14] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-10 08:02:14] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-10 08:02:14] [INFO ] Invariant cache hit.
[2023-03-10 08:02:14] [INFO ] Dead Transitions using invariants and state equation in 34 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 164 ms. Remains : 8/12 places, 8/10 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1)), p1:(AND (GEQ s1 3) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 657 reset in 157 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-14 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(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.
// Phase 1: matrix 10 rows 12 cols
[2023-03-10 08:02:14] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 08:02:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-10 08:02:14] [INFO ] Invariant cache hit.
[2023-03-10 08:02:14] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 08:02:14] [INFO ] Invariant cache hit.
[2023-03-10 08:02:14] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-10 08:02:14] [INFO ] Invariant cache hit.
[2023-03-10 08:02:14] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s0 1), p1:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 795 reset in 294 ms.
Stack based approach found an accepted trace after 594 steps with 5 reset with depth 188 and stack size 185 in 3 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-15 finished in 643 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||(p1 U p2)))))'
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(p1)||p0)))'
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(X((p1 U p2)))||G(!p2)||p0)))'
[2023-03-10 08:02:15] [INFO ] Flatten gal took : 6 ms
[2023-03-10 08:02:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-10 08:02:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 34 arcs took 1 ms.
Total runtime 25932 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DrinkVendingMachine-COL-98
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA DrinkVendingMachine-COL-98-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-COL-98-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-COL-98-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678435340260

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 DrinkVendingMachine-COL-98-LTLFireability-12
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DrinkVendingMachine-COL-98-LTLFireability-12
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 DrinkVendingMachine-COL-98-LTLFireability-13
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DrinkVendingMachine-COL-98-LTLFireability-13
lola: result : true
lola: markings : 213
lola: fired transitions : 530
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DrinkVendingMachine-COL-98-LTLFireability-10
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DrinkVendingMachine-COL-98-LTLFireability-10
lola: result : false
lola: markings : 970136
lola: fired transitions : 4920758
lola: time used : 3.000000
lola: memory pages used : 7
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DrinkVendingMachine-COL-98-LTLFireability-10: LTL false LTL model checker
DrinkVendingMachine-COL-98-LTLFireability-12: LTL true LTL model checker
DrinkVendingMachine-COL-98-LTLFireability-13: LTL true LTL model checker


Time elapsed: 4 secs. Pages in use: 7

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-98"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DrinkVendingMachine-COL-98, 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 r135-smll-167819414900620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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