About the Execution of ITS-Tools for DrinkVendingMachine-COL-98
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2937.420 | 39555.00 | 124039.00 | 125.00 | FFFFFTFTTFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110100275.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DrinkVendingMachine-COL-98, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110100275
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 7.5K Apr 30 05:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 05:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 05:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 05:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 48K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-98-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652655836729
Running Version 202205111006
[2022-05-15 23:03:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:03:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:03:57] [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.
[2022-05-15 23:03:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 23:03:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2022-05-15 23:03:58] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 1176 PT places and 3.6529582908E10 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 23:03:58] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 6 ms.
[2022-05-15 23:03:58] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10026 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=233 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 23:03:58] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-15 23:03:59] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:03:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-15 23:03:59] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 23:03:59] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-15 23:03:59] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 689 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=68 )
Parikh walk visited 3 properties in 31 ms.
[2022-05-15 23:03:59] [INFO ] Flatten gal took : 14 ms
[2022-05-15 23:03:59] [INFO ] Flatten gal took : 2 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:392) in guard (LEQ $x 97)introduces in Quality(392) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:392) in guard (AND (GT $x 97) (LEQ $x 195))introduces in Quality(392) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:392) in guard (AND (GT $x 195) (LEQ $x 293))introduces in Quality(392) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:392) in guard (AND (GT $x 293) (LEQ $x 391))introduces in Quality(392) partition with 2 elements
Sort wr.t. initial and guards Quality has partition Partition [nbSubs=4, partition=[3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 392 reducing to 4 values.
For transition elaborate0:(LEQ $x 97) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 97) (LEQ $x 195)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 195) (LEQ $x 293)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 293) (LEQ $x 391)) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 98
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 98
[2022-05-15 23:03:59] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 16 ms.
[2022-05-15 23:03:59] [INFO ] Unfolded 11 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 4 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:03:59] [INFO ] Computed 6 place invariants in 15 ms
[2022-05-15 23:03:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:03:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:03:59] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:03:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:03:59] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:03:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:03:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2022-05-15 23:03:59] [INFO ] Flatten gal took : 5 ms
[2022-05-15 23:03:59] [INFO ] Flatten gal took : 2 ms
[2022-05-15 23:03:59] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10092 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=672 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:03:59] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 23:03:59] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 23:03:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 23:03:59] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 23:03:59] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-15 23:03:59] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 1172 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=73 )
Parikh walk visited 3 properties in 52 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(!(G(!(F(p0)||p1)) U (X(p0)||p2))))))'
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.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:00] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 23:04:00] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:00] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:00] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:00] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:00] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:00] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:00] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR p2 p0), (OR p0 p2), (AND p2 (NOT p0) (NOT p1)), p0]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s2 (ADD s4 s5 s6 s7)), p0:(LEQ 2 s1), p1:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 302 ms.
Stack based approach found an accepted trace after 179 steps with 0 reset with depth 180 and stack size 180 in 1 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-00 finished in 876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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 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
Applied a total of 15 rules in 5 ms. Remains 2 /12 variables (removed 10) and now considering 5/10 (removed 5) transitions.
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:04:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:04:00] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:04:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:04:00] [INFO ] Implicit Places using invariants in 24 ms returned []
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:04:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:04:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-15 23:04:00] [INFO ] Redundant transitions in 14 ms returned [1, 2]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:04:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:04:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 3/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2/12 places, 3/10 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-01 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 s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2171 steps with 0 reset in 13 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-01 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(p0)&&p1)))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 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 3 ms. Remains 4 /12 variables (removed 8) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:04:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:04:01] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:04:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:04:01] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:04:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 23:04:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-15 23:04:01] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:04:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 23:04:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/12 places, 6/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/12 places, 6/10 transitions.
Stuttering acceptance computed with spot in 44 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s0 s3), p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-02 finished in 315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G((G(p0)&&F(p1))) U (G(!p1)&&p0)))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
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
[2022-05-15 23:04:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:01] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:01] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-15 23:04:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(LEQ (ADD s8 s9 s10 s11) s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-03 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(X(F((F(p0)&&X(G(p0))))))))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 23:04:01] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 23:04:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 23:04:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 23:04:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s2 s3 s4 s5) s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 187 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3436258 steps, run timeout after 3001 ms. (steps per millisecond=1145 ) properties seen :{}
Probabilistic random walk after 3436258 steps, saw 1135389 distinct states, run finished after 3004 ms. (steps per millisecond=1143 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 23:04:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 23:04:05] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:04:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 23:04:05] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:04:05] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 23:04:05] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 684 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=136 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 5 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 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 23:04:05] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:05] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 23:04:05] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2022-05-15 23:04:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 23:04:05] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 3961 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1320 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Built C files in :
/tmp/ltsmin4154901726976464028
[2022-05-15 23:04:06] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2022-05-15 23:04:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:06] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2022-05-15 23:04:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:06] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2022-05-15 23:04:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4154901726976464028
Running compilation step : cd /tmp/ltsmin4154901726976464028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 189 ms.
Running link step : cd /tmp/ltsmin4154901726976464028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4154901726976464028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10210173645241806622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 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 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 23:04:21] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 23:04:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-15 23:04:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 23:04:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin16841913242315866978
[2022-05-15 23:04:21] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2022-05-15 23:04:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:21] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2022-05-15 23:04:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:21] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2022-05-15 23:04:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:21] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16841913242315866978
Running compilation step : cd /tmp/ltsmin16841913242315866978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin16841913242315866978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16841913242315866978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13337341896905965669.hoa' '--buchi-type=spotba'
LTSmin run took 554 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-04 finished in 20814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(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 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:22] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:22] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT (ADD s8 s9 s10 s11) s1) (GT 2 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-06 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
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.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:22] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:22] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ (ADD s8 s9 s10 s11) s1), 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]]
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-08 finished in 653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F((X(F(G(p0)))||X(p1)))))))'
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.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:23] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:23] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:23] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:23] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:23] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-15 23:04:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:23] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2 (ADD s4 s5 s6 s7)), p1:(LEQ (ADD s8 s9 s10 s11) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10078 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1679 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:24] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:04:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 23:04:24] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:04:24] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 23:04:24] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 885 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=295 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:24] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-15 23:04:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10030 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1671 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:24] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 23:04:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-15 23:04:24] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 23:04:24] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 23:04:24] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 885 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=221 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 95 ms.
Built C files in :
/tmp/ltsmin17391070188761612504
[2022-05-15 23:04:25] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2022-05-15 23:04:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:25] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2022-05-15 23:04:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:25] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2022-05-15 23:04:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:04:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17391070188761612504
Running compilation step : cd /tmp/ltsmin17391070188761612504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin17391070188761612504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17391070188761612504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5020945443671562260.hoa' '--buchi-type=spotba'
LTSmin run took 9343 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-10 finished in 11683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !G(F((G(!p0)||G(p1))))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 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
[2022-05-15 23:04:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:04:35] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:04:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 23:04:35] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:04:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 23:04:35] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-15 23:04:35] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 23:04:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:04:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/12 places, 6/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/12 places, 6/10 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s3 s1), p1:(LEQ 3 s0)], 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 1 reset in 58 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-12 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(p0) U G(p1))))'
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 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:35] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 23:04:35] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:35] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:35] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 107 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s1 s2), p0:(AND (GT (ADD s8 s9 s10 s11) s1) (LEQ s1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-14 finished in 518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&((p1 U p2)||G(!p0))))'
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
[2022-05-15 23:04:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:35] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=4 dest: 3}]], initial=2, aps=[p2:(LEQ 3 (ADD s8 s9 s10 s11)), p1:(LEQ s2 s1), p0:(GT 3 (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLCardinality-15 finished in 282 ms.
All properties solved by simple procedures.
Total runtime 38357 ms.
BK_STOP 1652655876284
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DrinkVendingMachine-COL-98"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DrinkVendingMachine-COL-98, 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 r078-tall-165260110100275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-98.tgz
mv DrinkVendingMachine-COL-98 execution
cd execution
if [ "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 '
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 ;