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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.4K Feb 26 07:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 07:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 06:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 06:56 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.5K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Feb 26 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 20:18 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 24K 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-10-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678971125856

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 12:52:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 12:52:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 12:52:09] [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:52:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 12:52:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 692 ms
[2023-03-16 12:52:09] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 120 PT places and 444460.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 12:52:10] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 8 ms.
[2023-03-16 12:52:10] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 3 formulas.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1970 steps, including 0 resets, run visited all 22 properties in 70 ms. (steps per millisecond=28 )
[2023-03-16 12:52:10] [INFO ] Flatten gal took : 28 ms
[2023-03-16 12:52:10] [INFO ] Flatten gal took : 5 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
[2023-03-16 12:52:10] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 27 ms.
[2023-03-16 12:52:10] [INFO ] Unfolded 13 HLPN properties in 0 ms.
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 15 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:52:10] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-16 12:52:10] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
[2023-03-16 12:52:10] [INFO ] Invariant cache hit.
[2023-03-16 12:52:10] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-16 12:52:10] [INFO ] Invariant cache hit.
[2023-03-16 12:52:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-16 12:52:11] [INFO ] Invariant cache hit.
[2023-03-16 12:52:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 12:52:11] [INFO ] Flatten gal took : 6 ms
[2023-03-16 12:52:11] [INFO ] Flatten gal took : 5 ms
[2023-03-16 12:52:11] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 22) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-16 12:52:11] [INFO ] Invariant cache hit.
[2023-03-16 12:52:12] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-16 12:52:12] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 12:52:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 12:52:12] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 12:52:12] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-16 12:52:12] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 3 ms.
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((G(p1)||X(F(p2)))))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 12:52:12] [INFO ] Invariant cache hit.
[2023-03-16 12:52:12] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-16 12:52:12] [INFO ] Invariant cache hit.
[2023-03-16 12:52:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-16 12:52:12] [INFO ] Invariant cache hit.
[2023-03-16 12:52:12] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-16 12:52:12] [INFO ] Invariant cache hit.
[2023-03-16 12:52:12] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s0 (ADD s8 s9 s10 s11)), p1:(LEQ s2 (ADD s4 s5 s6 s7)), p2:(LEQ s2 (ADD s8 s9 s10 s11))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 614 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-00 finished in 1407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(p1))) U (G((p2||G(p0)))&&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.
[2023-03-16 12:52:14] [INFO ] Invariant cache hit.
[2023-03-16 12:52:14] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-16 12:52:14] [INFO ] Invariant cache hit.
[2023-03-16 12:52:14] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-16 12:52:14] [INFO ] Invariant cache hit.
[2023-03-16 12:52:14] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-16 12:52:14] [INFO ] Invariant cache hit.
[2023-03-16 12:52:14] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 770 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(OR p2 p0), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 8}, { cond=(AND p2 p0), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(AND p2 p0), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(OR p2 p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 5}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1} source=9 dest: 2}, { cond=p2, acceptance={} source=9 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=9 dest: 4}, { cond=(AND p2 p0), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=p2, acceptance={} source=10 dest: 10}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=11 dest: 12}], [{ cond=(NOT p0), acceptance={} source=12 dest: 6}, { cond=p0, acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(LEQ (ADD s8 s9 s10 s11) s2), p0:(LEQ s3 s2), p1:(LEQ 3 s0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 2 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-02 finished in 1016 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)||X(F((p1&&X(p2))))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 12:52:15] [INFO ] Invariant cache hit.
[2023-03-16 12:52:15] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-16 12:52:15] [INFO ] Invariant cache hit.
[2023-03-16 12:52:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-16 12:52:15] [INFO ] Invariant cache hit.
[2023-03-16 12:52:15] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-16 12:52:15] [INFO ] Invariant cache hit.
[2023-03-16 12:52:15] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (GT 3 s1) (GT s0 s3)), p2:(GT 3 (ADD s8 s9 s10 s11)), p0:(LEQ 2 s1)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 3621 reset in 519 ms.
Stack based approach found an accepted trace after 61 steps with 1 reset with depth 21 and stack size 21 in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-03 finished in 1039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&F(G(p0)))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 12:52:16] [INFO ] Invariant cache hit.
[2023-03-16 12:52:16] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-16 12:52:16] [INFO ] Invariant cache hit.
[2023-03-16 12:52:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-16 12:52:16] [INFO ] Invariant cache hit.
[2023-03-16 12:52:16] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-16 12:52:16] [INFO ] Invariant cache hit.
[2023-03-16 12:52:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s8 s9 s10 s11) s3), p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 207 steps with 0 reset with depth 208 and stack size 183 in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-04 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((X(X(G(p1)))||(p0&&G(!p1)))))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 12:52:16] [INFO ] Invariant cache hit.
[2023-03-16 12:52:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-16 12:52:16] [INFO ] Invariant cache hit.
[2023-03-16 12:52:16] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-16 12:52:16] [INFO ] Invariant cache hit.
[2023-03-16 12:52:16] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-16 12:52:16] [INFO ] Invariant cache hit.
[2023-03-16 12:52:16] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s3 s2), p1:(GT 3 s2)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-05 finished in 446 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||G((!p1 U X(!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 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT 3 (ADD s8 s9 s10 s11)), p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-06 finished in 465 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 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 2 transition count 5
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 12 ms. Remains 2 /12 variables (removed 10) and now considering 2/10 (removed 8) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 12:52:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 12:52:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-16 12:52:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 2/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 2/12 places, 2/10 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s0)], 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 3873 reset in 63 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-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-08 finished in 232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((F(p1)&&X(X(p2))))))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 12:52:17] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-16 12:52:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-16 12:52:17] [INFO ] Invariant cache hit.
[2023-03-16 12:52:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 557 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 8}, { cond=p0, acceptance={0} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=(NOT p2), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(NOT p2), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=10 dest: 7}]], initial=0, aps=[p1:(LEQ s3 (ADD s4 s5 s6 s7)), p0:(LEQ (ADD s4 s5 s6 s7) s2), p2:(LEQ s3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-09 finished in 700 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)&&(G(p1)||(p1&&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.
[2023-03-16 12:52:18] [INFO ] Invariant cache hit.
[2023-03-16 12:52:18] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-16 12:52:18] [INFO ] Invariant cache hit.
[2023-03-16 12:52:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-16 12:52:18] [INFO ] Invariant cache hit.
[2023-03-16 12:52:18] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-16 12:52:18] [INFO ] Invariant cache hit.
[2023-03-16 12:52:18] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GT 3 (ADD s8 s9 s10 s11)), p2:(GT 3 s2), p1:(GT 2 s2)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-10 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||G((p1&&X(!p0)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 12:52:19] [INFO ] Invariant cache hit.
[2023-03-16 12:52:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-16 12:52:19] [INFO ] Invariant cache hit.
[2023-03-16 12:52:19] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-16 12:52:19] [INFO ] Invariant cache hit.
[2023-03-16 12:52:19] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-16 12:52:19] [INFO ] Invariant cache hit.
[2023-03-16 12:52:19] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, p0, (OR (NOT p1) p0), p0]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 3 s2), p1:(LEQ s1 s3)], 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 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-11 finished in 467 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((F((p0&&(p1||X(p2))))&&G((p3&&F(p4))))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 12:52:19] [INFO ] Invariant cache hit.
[2023-03-16 12:52:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-16 12:52:19] [INFO ] Invariant cache hit.
[2023-03-16 12:52:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 12:52:19] [INFO ] Invariant cache hit.
[2023-03-16 12:52:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-16 12:52:19] [INFO ] Invariant cache hit.
[2023-03-16 12:52:19] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p4), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p4)), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 (ADD s4 s5 s6 s7)), p0:(LEQ s3 (ADD s4 s5 s6 s7)), p4:(LEQ 1 (ADD s8 s9 s10 s11)), p1:(LEQ 1 s2), p2:(LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 s11))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5367 reset in 212 ms.
Product exploration explored 100000 steps with 5237 reset in 337 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 p3 p0 (NOT p4) (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X p4), (X (NOT (AND p3 (NOT p4)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p4))), (X (X p4)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4)))))]
Knowledge based reduction with 14 factoid took 1582 ms. Reduced automaton from 5 states, 13 edges and 5 AP (stutter sensitive) to 5 states, 13 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 12:52:22] [INFO ] Invariant cache hit.
[2023-03-16 12:52:22] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 12:52:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 12:52:22] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p4) (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X p4), (X (NOT (AND p3 (NOT p4)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p4))), (X (X p4)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 p3))), (F p4), (F (NOT (AND (NOT p1) p0))), (F (NOT p3)), (F (NOT (AND (NOT p4) p3))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 15 factoid took 1764 ms. Reduced automaton from 5 states, 13 edges and 5 AP (stutter sensitive) to 5 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
[2023-03-16 12:52:25] [INFO ] Invariant cache hit.
[2023-03-16 12:52:25] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 12:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:52:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 12:52:25] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 12:52:25] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (NOT p4)
[2023-03-16 12:52:25] [INFO ] Invariant cache hit.
[2023-03-16 12:52:25] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 12:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:52:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-16 12:52:25] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 12:52:25] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 12:52:25] [INFO ] Invariant cache hit.
[2023-03-16 12:52:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-16 12:52:25] [INFO ] Invariant cache hit.
[2023-03-16 12:52:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-16 12:52:25] [INFO ] Invariant cache hit.
[2023-03-16 12:52:25] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-16 12:52:25] [INFO ] Invariant cache hit.
[2023-03-16 12:52:25] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 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 p3 p0 (NOT p4) (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p4), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p3)), (X (X p0)), (X (X (NOT (AND p3 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p3 p0 (NOT p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT p4))), (X (X p4)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 1411 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter sensitive) to 5 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :5
Finished Best-First random walk after 943 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND p3 p0 (NOT p4) (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p4), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p3)), (X (X p0)), (X (X (NOT (AND p3 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p3 p0 (NOT p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT p4))), (X (X p4)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 p3))), (F p4), (F (NOT (AND (NOT p1) p0))), (F (NOT p3)), (F (NOT (AND (NOT p4) p3))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 1837 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter sensitive) to 5 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
[2023-03-16 12:52:30] [INFO ] Invariant cache hit.
[2023-03-16 12:52:30] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 12:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:52:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 12:52:30] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 12:52:30] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p4)
[2023-03-16 12:52:30] [INFO ] Invariant cache hit.
[2023-03-16 12:52:30] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 12:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:52:30] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 12:52:30] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 12:52:30] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5270 reset in 252 ms.
Product exploration explored 100000 steps with 5012 reset in 271 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Support contains 10 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: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 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:52:32] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 12:52:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-16 12:52:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 10/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 12:52:32] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 12:52:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-13 finished in 12729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 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 4 transition count 6
Applied a total of 12 rules in 2 ms. Remains 4 /12 variables (removed 8) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-16 12:52:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 12:52:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-16 12:52:32] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/12 places, 6/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 4/12 places, 6/10 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7191 reset in 117 ms.
Stack based approach found an accepted trace after 129 steps with 13 reset with depth 10 and stack size 10 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-14 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U G(p1))))'
Support contains 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
[2023-03-16 12:52:32] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-16 12:52:32] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-16 12:52:32] [INFO ] Invariant cache hit.
[2023-03-16 12:52:32] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 (ADD s8 s9 s10 s11)), p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-15 finished in 439 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((F((p0&&(p1||X(p2))))&&G((p3&&F(p4))))))'
Found a Shortening insensitive property : DrinkVendingMachine-COL-10-LTLCardinality-13
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LI_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 1 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
[2023-03-16 12:52:33] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 12:52:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 12:52:33] [INFO ] Invariant cache hit.
[2023-03-16 12:52:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-16 12:52:33] [INFO ] Invariant cache hit.
[2023-03-16 12:52:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 103 ms. Remains : 10/12 places, 9/10 transitions.
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p4), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p4)), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 (ADD s2 s3 s4 s5)), p0:(LEQ s1 (ADD s2 s3 s4 s5)), p4:(LEQ 1 (ADD s6 s7 s8 s9)), p1:(LEQ 1 s0), p2:(LEQ (ADD s2 s3 s4 s5) (ADD s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6100 reset in 244 ms.
Product exploration explored 100000 steps with 6251 reset in 272 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 p3 p0 (NOT p4) (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X p4), (X (NOT (AND p3 (NOT p4)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p4))), (X (X p4)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4)))))]
Knowledge based reduction with 14 factoid took 1669 ms. Reduced automaton from 5 states, 13 edges and 5 AP (stutter sensitive) to 5 states, 13 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 12:52:36] [INFO ] Invariant cache hit.
[2023-03-16 12:52:36] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 12:52:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-16 12:52:36] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p4) (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X p4), (X (NOT (AND p3 (NOT p4)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p4))), (X (X p4)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 p3))), (F p4), (F (NOT (AND (NOT p1) p0))), (F (NOT p3)), (F (NOT (AND (NOT p4) p3))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 15 factoid took 1904 ms. Reduced automaton from 5 states, 13 edges and 5 AP (stutter sensitive) to 5 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
[2023-03-16 12:52:39] [INFO ] Invariant cache hit.
[2023-03-16 12:52:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 12:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:52:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 12:52:39] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 12:52:39] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p4)
[2023-03-16 12:52:39] [INFO ] Invariant cache hit.
[2023-03-16 12:52:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 12:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:52:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 12:52:39] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 12:52:39] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 10 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-16 12:52:39] [INFO ] Invariant cache hit.
[2023-03-16 12:52:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 12:52:39] [INFO ] Invariant cache hit.
[2023-03-16 12:52:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-16 12:52:39] [INFO ] Invariant cache hit.
[2023-03-16 12:52:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 10/10 places, 9/9 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 p3 p0 (NOT p4) (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p4), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p3)), (X (X p0)), (X (X (NOT (AND p3 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p3 p0 (NOT p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT p4))), (X (X p4)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 1188 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter sensitive) to 5 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :5
Finished Best-First random walk after 584 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=292 )
Knowledge obtained : [(AND p3 p0 (NOT p4) (NOT p1) (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p4), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p3)), (X (X p0)), (X (X (NOT (AND p3 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p3 p0 (NOT p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT p4))), (X (X p4)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 p3))), (F p4), (F (NOT (AND (NOT p1) p0))), (F (NOT p3)), (F (NOT (AND (NOT p4) p3))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 1363 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter sensitive) to 5 states, 12 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
[2023-03-16 12:52:42] [INFO ] Invariant cache hit.
[2023-03-16 12:52:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 12:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:52:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-16 12:52:42] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 12:52:42] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p4)
[2023-03-16 12:52:42] [INFO ] Invariant cache hit.
[2023-03-16 12:52:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 12:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 12:52:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-16 12:52:42] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 12:52:42] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6108 reset in 222 ms.
Product exploration explored 100000 steps with 6061 reset in 249 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p4) (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2))]
Support contains 10 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-16 12:52:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 12:52:44] [INFO ] Invariant cache hit.
[2023-03-16 12:52:44] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 10/10 places, 9/9 transitions.
Support contains 10 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-16 12:52:44] [INFO ] Invariant cache hit.
[2023-03-16 12:52:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 12:52:44] [INFO ] Invariant cache hit.
[2023-03-16 12:52:44] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-16 12:52:44] [INFO ] Invariant cache hit.
[2023-03-16 12:52:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-13 finished in 11192 ms.
[2023-03-16 12:52:44] [INFO ] Flatten gal took : 9 ms
[2023-03-16 12:52:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-16 12:52:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 34 arcs took 1 ms.
Total runtime 35224 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2032/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DrinkVendingMachine-COL-10-LTLCardinality-13

BK_STOP 1678971165822

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name DrinkVendingMachine-COL-10-LTLCardinality-13
ltl formula formula --ltl=/tmp/2032/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 10 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2032/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2032/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2032/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2032/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="LTLCardinality"
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-10, examination is LTLCardinality"
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-167819418900579"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;