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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
321.495 10291.00 17391.00 463.20 FTFFTFFFFFTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.8K Feb 26 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 04:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 22K 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-02-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678971019262

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 12:50:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 12:50:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 12:50:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 12:50:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 12:50:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 731 ms
[2023-03-16 12:50:22] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 12:50:22] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 6 ms.
[2023-03-16 12:50:22] [INFO ] Skeletonized 6 HLPN properties in 2 ms. Removed 10 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=0 )
[2023-03-16 12:50:23] [INFO ] Flatten gal took : 18 ms
[2023-03-16 12:50:23] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:8) in guard (AND (GT $x 5) (LEQ $x 7))introduces in Quality(8) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:8) in guard (AND (GT $x 3) (LEQ $x 5))introduces in Quality(8) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:8) in guard (AND (GT $x 1) (LEQ $x 3))introduces in Quality(8) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:8) in guard (LEQ $x 1)introduces in Quality(8) 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 8 reducing to 4 values.
For transition elaborate3:(AND (GT $x 5) (LEQ $x 7)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 3) (LEQ $x 5)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 1) (LEQ $x 3)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 1) -> (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 2
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 2
[2023-03-16 12:50:23] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 15 ms.
[2023-03-16 12:50:23] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 7 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 12:50:23] [INFO ] Computed 6 place invariants in 10 ms
[2023-03-16 12:50:23] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 1 transitions.
Found 1 dead transitions using SMT.
Drop transitions removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-16 12:50:23] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-16 12:50:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 12:50:23] [INFO ] Invariant cache hit.
[2023-03-16 12:50:23] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/12 places, 9/10 transitions.
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/9 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 12/12 places, 8/10 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Support contains 10 out of 10 places after structural reductions.
[2023-03-16 12:50:23] [INFO ] Flatten gal took : 5 ms
[2023-03-16 12:50:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 12:50:23] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 10 cols
[2023-03-16 12:50:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 12:50:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 12:50:24] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 12:50:24] [INFO ] Invariant cache hit.
[2023-03-16 12:50:24] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-16 12:50:24] [INFO ] Invariant cache hit.
[2023-03-16 12:50:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-16 12:50:24] [INFO ] Invariant cache hit.
[2023-03-16 12:50:24] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-16 12:50:24] [INFO ] Invariant cache hit.
[2023-03-16 12:50:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s6 1) (GEQ s8 2) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1)), p0:(AND (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-00 finished in 491 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))'
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2 transition count 4
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 2 transition count 2
Applied a total of 14 rules in 6 ms. Remains 2 /10 variables (removed 8) and now considering 2/8 (removed 6) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 12:50:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 12:50:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-16 12:50:25] [INFO ] Invariant cache hit.
[2023-03-16 12:50:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-16 12:50:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 12:50:25] [INFO ] Invariant cache hit.
[2023-03-16 12:50:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/10 places, 2/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 2/10 places, 2/8 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-02-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-01 finished in 675 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))||F(p1)))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-16 12:50:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 12:50:25] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-16 12:50:25] [INFO ] Invariant cache hit.
[2023-03-16 12:50:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 12:50:25] [INFO ] Invariant cache hit.
[2023-03-16 12:50:25] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-16 12:50:25] [INFO ] Invariant cache hit.
[2023-03-16 12:50:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(OR (LT s4 1) (LT s6 1) (LT s8 1)), p0:(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][false, false, false, false]]
Product exploration explored 100000 steps with 32747 reset in 192 ms.
Stack based approach found an accepted trace after 350 steps with 115 reset with depth 6 and stack size 6 in 1 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-02 finished in 520 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(F((p0&&X(X(p1)))))))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 12:50:26] [INFO ] Invariant cache hit.
[2023-03-16 12:50:26] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-16 12:50:26] [INFO ] Invariant cache hit.
[2023-03-16 12:50:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 12:50:26] [INFO ] Invariant cache hit.
[2023-03-16 12:50:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-16 12:50:26] [INFO ] Invariant cache hit.
[2023-03-16 12:50:26] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (LT s5 1) (LT s6 1) (LT s8 2)), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15112 reset in 131 ms.
Stack based approach found an accepted trace after 145 steps with 19 reset with depth 14 and stack size 14 in 0 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-06 finished in 525 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||G(p1)))))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 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 8 transition count 7
Applied a total of 3 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-16 12:50:26] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 12:50:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-16 12:50:26] [INFO ] Invariant cache hit.
[2023-03-16 12:50:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-16 12:50:26] [INFO ] Invariant cache hit.
[2023-03-16 12:50:26] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-16 12:50:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 12:50:26] [INFO ] Invariant cache hit.
[2023-03-16 12:50:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/10 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 8/10 places, 7/8 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s2 1) (LT s4 1)), p0:(OR (LT s3 1) (LT s4 1) (LT s6 2))], 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 6928 reset in 273 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 17 and stack size 17 in 0 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-08 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !p1)))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 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 6 transition count 6
Applied a total of 6 rules in 2 ms. Remains 6 /10 variables (removed 4) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 12:50:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 12:50:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-16 12:50:27] [INFO ] Invariant cache hit.
[2023-03-16 12:50:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-16 12:50:27] [INFO ] Invariant cache hit.
[2023-03-16 12:50:27] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-16 12:50:27] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-16 12:50:27] [INFO ] Invariant cache hit.
[2023-03-16 12:50:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/10 places, 6/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 6/10 places, 6/8 transitions.
Stuttering acceptance computed with spot in 89 ms :[p1, true, p1]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s2 1) (LT s4 2)), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-09 finished in 242 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(!p1))))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 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 8 transition count 7
Applied a total of 3 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-16 12:50:27] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 12:50:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 12:50:27] [INFO ] Invariant cache hit.
[2023-03-16 12:50:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-16 12:50:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 12:50:27] [INFO ] Invariant cache hit.
[2023-03-16 12:50:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/10 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 8/10 places, 7/8 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13419 reset in 150 ms.
Stack based approach found an accepted trace after 15 steps with 4 reset with depth 8 and stack size 8 in 0 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-11 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-16 12:50:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 12:50:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-16 12:50:28] [INFO ] Invariant cache hit.
[2023-03-16 12:50:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 12:50:28] [INFO ] Invariant cache hit.
[2023-03-16 12:50:28] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-16 12:50:28] [INFO ] Invariant cache hit.
[2023-03-16 12:50:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-12 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:(GEQ s7 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 27 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-12 finished in 221 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||X(X(X(G(!p0))))))))'
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-16 12:50:28] [INFO ] Invariant cache hit.
[2023-03-16 12:50:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-16 12:50:28] [INFO ] Invariant cache hit.
[2023-03-16 12:50:28] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 12:50:28] [INFO ] Invariant cache hit.
[2023-03-16 12:50:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-16 12:50:28] [INFO ] Invariant cache hit.
[2023-03-16 12:50:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, p0, p0, p0, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLFireability-15 finished in 345 ms.
All properties solved by simple procedures.
Total runtime 6828 ms.
ITS solved all properties within timeout

BK_STOP 1678971029553

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DrinkVendingMachine-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DrinkVendingMachine-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819418900572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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