fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r153-tall-171631151800413
Last Updated
July 7, 2024

About the Execution of 2023-gold for DrinkVendingMachine-COL-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2244.911 42933.00 136576.00 941.70 FFFFFFTTFTFFFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151800413.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DrinkVendingMachine-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151800413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.3K Apr 13 03:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 13 03:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 03:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 13 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 13 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 24K May 18 16:42 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-10-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716447729980

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-10
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-23 07:02:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 07:02:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:02:11] [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.
[2024-05-23 07:02:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-23 07:02:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1197 ms
[2024-05-23 07:02:12] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 120 PT places and 444460.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-23 07:02:12] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 5 ms.
[2024-05-23 07:02:12] [INFO ] Skeletonized 7 HLPN properties in 1 ms. Removed 9 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-23 07:02:12] [INFO ] Flatten gal took : 11 ms
[2024-05-23 07:02:12] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:40) in guard (LEQ $x 9)introduces in Quality(40) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:40) in guard (AND (GT $x 9) (LEQ $x 19))introduces in Quality(40) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:40) in guard (AND (GT $x 19) (LEQ $x 29))introduces in Quality(40) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:40) in guard (AND (GT $x 29) (LEQ $x 39))introduces in Quality(40) 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 40 reducing to 4 values.
For transition elaborate0:(LEQ $x 9) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 9) (LEQ $x 19)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 19) (LEQ $x 29)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 29) (LEQ $x 39)) -> (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 10
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 10
[2024-05-23 07:02:12] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 10 ms.
[2024-05-23 07:02:12] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 6 formulas.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLFireability-14 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 6 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-23 07:02:13] [INFO ] Computed 6 invariants in 8 ms
[2024-05-23 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
[2024-05-23 07:02:13] [INFO ] Invariant cache hit.
[2024-05-23 07:02:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 07:02:13] [INFO ] Invariant cache hit.
[2024-05-23 07:02:13] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-23 07:02:13] [INFO ] Invariant cache hit.
[2024-05-23 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2024-05-23 07:02:13] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:02:13] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:02:13] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 07:02:13] [INFO ] Invariant cache hit.
[2024-05-23 07:02:13] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((G(p1)||(p1&&G(F(p2))))))))'
Support contains 5 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.
[2024-05-23 07:02:13] [INFO ] Invariant cache hit.
[2024-05-23 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-23 07:02:13] [INFO ] Invariant cache hit.
[2024-05-23 07:02:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 07:02:13] [INFO ] Invariant cache hit.
[2024-05-23 07:02:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-23 07:02:13] [INFO ] Invariant cache hit.
[2024-05-23 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 12/12 places, 10/10 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 415 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 3) (LT s3 1) (LT s4 1)), p1:(LT s0 1), p2:(OR (LT s3 1) (LT s7 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]]
Product exploration explored 100000 steps with 8613 reset in 227 ms.
Stack based approach found an accepted trace after 86 steps with 7 reset with depth 17 and stack size 17 in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-00 finished in 862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 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 4 ms. Remains 6 /12 variables (removed 6) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-23 07:02:14] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 07:02:14] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-23 07:02:14] [INFO ] Invariant cache hit.
[2024-05-23 07:02:14] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 07:02:14] [INFO ] Invariant cache hit.
[2024-05-23 07:02:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-23 07:02:14] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-23 07:02:14] [INFO ] Invariant cache hit.
[2024-05-23 07:02:14] [INFO ] Dead Transitions using invariants and state equation in 18 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 110 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s1 1) (LT s3 1) (LT 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 118 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-01 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F(p1)))))'
Support contains 5 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
[2024-05-23 07:02:14] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 07:02:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-23 07:02:14] [INFO ] Invariant cache hit.
[2024-05-23 07:02:14] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 07:02:14] [INFO ] Invariant cache hit.
[2024-05-23 07:02:14] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-23 07:02:14] [INFO ] Invariant cache hit.
[2024-05-23 07:02:14] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1)), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-02 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 5 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.
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s0 1), p0:(AND (LT s0 1) (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-04 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1)||G(F(!p2)))))'
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 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-23 07:02:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) p2), p2, p2, (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1)), p1:(OR (AND (GEQ s1 1) (GEQ s3 1) (GEQ s6 1)) (AND (GEQ s1 3) (GEQ s3 1) (GEQ s4 1))), p2:(OR (LT s1 3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2063 reset in 106 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-05 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(p1&&F(!p0))))))'
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 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-23 07:02:15] [INFO ] Invariant cache hit.
[2024-05-23 07:02:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 07:02:16] [INFO ] Invariant cache hit.
[2024-05-23 07:02:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-23 07:02:16] [INFO ] Invariant cache hit.
[2024-05-23 07:02:16] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 92 ms :[p0, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 2) (LT s3 1) (LT s5 1)), p0:(AND (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 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 8025 reset in 111 ms.
Product exploration explored 100000 steps with 8030 reset in 120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[p0, p0, p0, false, (AND p1 p0)]
Finished random walk after 120 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[p0, p0, p0, false, (AND p1 p0)]
Stuttering acceptance computed with spot in 251 ms :[p0, p0, p0, false, (AND p1 p0)]
[2024-05-23 07:02:17] [INFO ] Invariant cache hit.
[2024-05-23 07:02:17] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:02:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-23 07:02:17] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:02:17] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG p0
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:02:17] [INFO ] Invariant cache hit.
[2024-05-23 07:02:17] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-23 07:02:17] [INFO ] Invariant cache hit.
[2024-05-23 07:02:17] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-23 07:02:17] [INFO ] Invariant cache hit.
[2024-05-23 07:02:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-23 07:02:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:02:17] [INFO ] Invariant cache hit.
[2024-05-23 07:02:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 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 p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 159 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[p0, p0, p0, false, (AND p1 p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (AND p1 p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 393 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 464 ms :[p0, p0, p0, false, (AND p1 p0)]
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, false, (AND p1 p0)]
[2024-05-23 07:02:19] [INFO ] Invariant cache hit.
[2024-05-23 07:02:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 07:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:02:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 07:02:19] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:02:19] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0, false, (AND p1 p0)]
Product exploration explored 100000 steps with 13799 reset in 116 ms.
Product exploration explored 100000 steps with 13967 reset in 101 ms.
Built C files in :
/tmp/ltsmin8503521483540052842
[2024-05-23 07:02:19] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-23 07:02:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:02:19] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-23 07:02:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:02:19] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-23 07:02:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:02:19] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8503521483540052842
Running compilation step : cd /tmp/ltsmin8503521483540052842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 153 ms.
Running link step : cd /tmp/ltsmin8503521483540052842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8503521483540052842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8688703628508519012.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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.
[2024-05-23 07:02:34] [INFO ] Invariant cache hit.
[2024-05-23 07:02:34] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-23 07:02:34] [INFO ] Invariant cache hit.
[2024-05-23 07:02:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 07:02:34] [INFO ] Invariant cache hit.
[2024-05-23 07:02:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-23 07:02:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:02:34] [INFO ] Invariant cache hit.
[2024-05-23 07:02:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 12/12 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin9087365312740851436
[2024-05-23 07:02:34] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-23 07:02:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:02:34] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-23 07:02:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:02:34] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-23 07:02:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:02:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9087365312740851436
Running compilation step : cd /tmp/ltsmin9087365312740851436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin9087365312740851436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9087365312740851436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15627683841529001528.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 07:02:49] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:02:49] [INFO ] Flatten gal took : 1 ms
[2024-05-23 07:02:49] [INFO ] Time to serialize gal into /tmp/LTL1930270279910315618.gal : 0 ms
[2024-05-23 07:02:49] [INFO ] Time to serialize properties into /tmp/LTL6885625498825681309.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1930270279910315618.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5884952846194432117.hoa' '-atoms' '/tmp/LTL6885625498825681309.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6885625498825681309.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5884952846194432117.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
56 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.576788,34312,1,0,312,106459,31,137,432,157423,788
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-06 finished in 34706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(!p0)&&(X(X(G(!p0))) U G(!p1)))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-23 07:02:50] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 07:02:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 07:02:50] [INFO ] Invariant cache hit.
[2024-05-23 07:02:50] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-23 07:02:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:02:50] [INFO ] Invariant cache hit.
[2024-05-23 07:02:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR p0 p1), p1, (AND p0 (NOT p1)), p0]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s5 1)), p0:(AND (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 7337 reset in 107 ms.
Stack based approach found an accepted trace after 98 steps with 8 reset with depth 25 and stack size 24 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-11 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-23 07:02:51] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-23 07:02:51] [INFO ] Invariant cache hit.
[2024-05-23 07:02:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 07:02:51] [INFO ] Invariant cache hit.
[2024-05-23 07:02:51] [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.
[2024-05-23 07:02:51] [INFO ] Invariant cache hit.
[2024-05-23 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[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][false, false, false]]
Product exploration explored 100000 steps with 5613 reset in 101 ms.
Stack based approach found an accepted trace after 42 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-12 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(G(!p1)) U (!p2&&X(!p3)))||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 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:02:51] [INFO ] Invariant cache hit.
[2024-05-23 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-23 07:02:51] [INFO ] Invariant cache hit.
[2024-05-23 07:02:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 07:02:51] [INFO ] Invariant cache hit.
[2024-05-23 07:02:51] [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.
[2024-05-23 07:02:51] [INFO ] Invariant cache hit.
[2024-05-23 07:02:51] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), (AND (NOT p0) p1 p3), (AND (NOT p0) (NOT p1) p3), (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3)), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 4}], [{ cond=(AND p3 p1), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3 p1), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND p0 p3 (NOT p1)) (AND (NOT p2) p3 (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p3 p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p3 p1), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2) p3), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p3), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p2 p3), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p2 p3), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={0, 1} source=2 dest: 4}], [{ cond=p1, acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p2:(AND (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1)), p3:(LT s0 1), p1:(OR (LT s1 1) (LT s3 1) (LT s6...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1663 reset in 157 ms.
Stack based approach found an accepted trace after 251 steps with 1 reset with depth 173 and stack size 143 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-15 finished in 545 ms.
All properties solved by simple procedures.
Total runtime 40545 ms.

BK_STOP 1716447772913

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DrinkVendingMachine-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DrinkVendingMachine-COL-10, 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 r153-tall-171631151800413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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