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-165260110100259.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-48, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110100259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 7.5K Apr 30 05:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 05:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 05:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 05:57 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 3.9K 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.8K 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 34K 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-48-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-48-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652654998753

Running Version 202205111006
[2022-05-15 22:49:59] [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 22:49:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 22:49:59] [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 22:50:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 22:50:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 611 ms
[2022-05-15 22:50:00] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 576 PT places and 1.040901408E9 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 22:50:00] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 6 ms.
[2022-05-15 22:50:00] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10017 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :4
Finished Best-First random walk after 6506 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=929 )
[2022-05-15 22:50:01] [INFO ] Flatten gal took : 16 ms
[2022-05-15 22:50:01] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:192) in guard (AND (GT $x 143) (LEQ $x 191))introduces in Quality(192) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:192) in guard (AND (GT $x 95) (LEQ $x 143))introduces in Quality(192) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:192) in guard (AND (GT $x 47) (LEQ $x 95))introduces in Quality(192) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:192) in guard (LEQ $x 47)introduces in Quality(192) partition with 2 elements
Sort wr.t. initial and guards Quality has partition Partition [nbSubs=4, partition=[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, 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, 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, 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]]

Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 192 reducing to 4 values.
For transition elaborate3:(AND (GT $x 143) (LEQ $x 191)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 95) (LEQ $x 143)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 47) (LEQ $x 95)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 47) -> (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 48
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 48
[2022-05-15 22:50:01] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 14 ms.
[2022-05-15 22:50:01] [INFO ] Unfolded 10 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 7 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 22:50:01] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 22:50:01] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:01] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:01] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 22:50:01] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:01] [INFO ] Dead Transitions using invariants and state equation in 46 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 22:50:01] [INFO ] Flatten gal took : 6 ms
[2022-05-15 22:50:01] [INFO ] Flatten gal took : 2 ms
[2022-05-15 22:50:01] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=456 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:01] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-15 22:50:01] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 22:50:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:50:01] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 22:50:01] [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 7 ms.
[2022-05-15 22:50:01] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 623 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=47 )
Parikh walk visited 3 properties in 13 ms.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((F(X((G(!(p0 U p1))||F(p0))))&&X(!p1)))'
Support contains 9 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:02] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:02] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:02] [INFO ] Implicit Places using invariants and state equation in 27 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 22:50:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:02] [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 320 ms :[p1, p1, true, (AND p1 (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7) s9), p0:(LEQ (ADD s0 s1 s2 s3) s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-01 finished in 991 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X(F(G(p1)))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:03] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:03] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:03] [INFO ] Implicit Places using invariants and state equation in 28 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 22:50:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:03] [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 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s10 (ADD s4 s5 s6 s7)), p1:(LEQ s8 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 217 ms.
Stack based approach found an accepted trace after 126 steps with 0 reset with depth 127 and stack size 126 in 1 ms.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-02 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0) U X((!F(p1)&&X(p2))))||X(G(p3)))))'
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 22:50:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:03] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:03] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:03] [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 592 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), p1, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1)]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 11}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 12}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(NOT p1), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 11}, { cond=p1, acceptance={0} source=9 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=10 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={0} source=10 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 8}, { cond=(NOT p1), acceptance={} source=12 dest: 9}, { cond=(NOT p1), acceptance={0} source=12 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=12 dest: 11}, { cond=p1, acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(LEQ 1 (ADD s4 s5 s6 s7)), p1:(LEQ 1 s10), p3:(LEQ (ADD s0 s1 s2 s3) s9), p2:(LEQ s9 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 143 ms.
Stack based approach found an accepted trace after 44 steps with 1 reset with depth 42 and stack size 42 in 0 ms.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-03 finished in 899 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&G(F(p2))))'
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 7 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 22:50:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 22:50:04] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 22:50:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 22:50:04] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 22:50:04] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 22:50:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-15 22:50:04] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 22:50:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 22:50:04] [INFO ] Dead Transitions using invariants and state equation in 19 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 205 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(OR p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s3), p0:(GT s2 s1), p2:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 0 reset in 107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 557 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Finished random walk after 297 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=148 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F p2), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 615 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 22:50:06] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 22:50:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 22:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:50:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-15 22:50:06] [INFO ] Computed and/alt/rep : 2/7/2 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 22:50:06] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 22:50:06] [INFO ] Computed 2 place invariants in 0 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F p2), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 456 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-04 finished in 2788 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
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 4 ms. Remains 2 /12 variables (removed 10) and now considering 2/10 (removed 8) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 22:50:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:50:07] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 22:50:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:50:07] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 22:50:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 22:50:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:50:07] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 2/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/12 places, 2/10 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-06 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 s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 128 reset in 73 ms.
Stack based approach found an accepted trace after 894 steps with 1 reset with depth 544 and stack size 34 in 1 ms.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-06 finished in 218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((!(p0 U p1)&&p2)))||G(p3)))'
Support contains 7 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:07] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:07] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:07] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (NOT p2) p1), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3)]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p3 (NOT p2)) (AND p3 p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=1, aps=[p3:(LEQ s10 s9), p2:(OR (GT s10 s11) (GT (ADD s4 s5 s6 s7) s11)), p1:(LEQ (ADD s4 s5 s6 s7) s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 175 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 p3) p2 (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)))), (X (AND p2 (NOT p1))), (X (NOT (OR (NOT p2) p1))), (X (NOT (OR (AND p3 (NOT p2)) (AND p3 p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (AND (NOT p3) p2 (NOT p1))), true, (X (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1))))), (X (X (NOT p3))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND p3 p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (AND (NOT p3) p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 485 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 548330 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 548330 steps, saw 290631 distinct states, run finished after 3002 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:11] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 22:50:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:50:11] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:50:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:50:11] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 22:50:11] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 22:50:11] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 339 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=37 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)))), (X (AND p2 (NOT p1))), (X (NOT (OR (NOT p2) p1))), (X (NOT (OR (AND p3 (NOT p2)) (AND p3 p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (AND (NOT p3) p2 (NOT p1))), true, (X (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1))))), (X (X (NOT p3))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND p3 p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (AND (NOT p3) p2 (NOT p1))))]
False Knowledge obtained : [(F (OR p1 (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 15 factoid took 475 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 6 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:12] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:12] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:12] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:12] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:12] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:12] [INFO ] Implicit Places using invariants and state equation in 19 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 22:50:12] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 22:50:12] [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.
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) p2), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), true, (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10036 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 634423 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634423 steps, saw 333490 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:16] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:50:16] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:50:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:50:16] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 22:50:16] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 22:50:16] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 342 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=85 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), true, (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (OR p1 (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 104 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 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 22:50:17] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2022-05-15 22:50:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:17] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 10/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 125 ms.
Built C files in :
/tmp/ltsmin13463535023499584012
[2022-05-15 22:50:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13463535023499584012
Running compilation step : cd /tmp/ltsmin13463535023499584012;'/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 281 ms.
Running link step : cd /tmp/ltsmin13463535023499584012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13463535023499584012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13010106791060954094.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 22:50:32] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:32] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:32] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:32] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:32] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:50:32] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:50:32] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:50:32] [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.
Built C files in :
/tmp/ltsmin12021295895694313393
[2022-05-15 22:50:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12021295895694313393
Running compilation step : cd /tmp/ltsmin12021295895694313393;'/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 80 ms.
Running link step : cd /tmp/ltsmin12021295895694313393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin12021295895694313393;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3299160069732165135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 22:50:47] [INFO ] Flatten gal took : 2 ms
[2022-05-15 22:50:47] [INFO ] Flatten gal took : 1 ms
[2022-05-15 22:50:47] [INFO ] Time to serialize gal into /tmp/LTL2646725188444243173.gal : 2 ms
[2022-05-15 22:50:47] [INFO ] Time to serialize properties into /tmp/LTL15045016459987130250.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2646725188444243173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15045016459987130250.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2646725...267
Read 1 LTL properties
Checking formula 0 : !(((G(X((!(("(((ready_0+ready_1)+(ready_2+ready_3))>=2)")U("(((wait_0+wait_1)+(wait_2+wait_3))<=optionSlots_0)")))&&("((theOptions_0>o...266
Formula 0 simplified : !(GX("((theOptions_0>optionSlots_0)||(((wait_0+wait_1)+(wait_2+wait_3))>optionSlots_0))" & !("(((ready_0+ready_1)+(ready_2+ready_3))...254
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 22:51:02] [INFO ] Flatten gal took : 5 ms
[2022-05-15 22:51:02] [INFO ] Applying decomposition
[2022-05-15 22:51:02] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14901994255794031925.txt' '-o' '/tmp/graph14901994255794031925.bin' '-w' '/tmp/graph14901994255794031925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14901994255794031925.bin' '-l' '-1' '-v' '-w' '/tmp/graph14901994255794031925.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:51:02] [INFO ] Decomposing Gal with order
[2022-05-15 22:51:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:51:02] [INFO ] Flatten gal took : 22 ms
[2022-05-15 22:51:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-15 22:51:02] [INFO ] Time to serialize gal into /tmp/LTL12926771465377236298.gal : 1 ms
[2022-05-15 22:51:02] [INFO ] Time to serialize properties into /tmp/LTL211134755317901453.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12926771465377236298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL211134755317901453.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1292677...266
Read 1 LTL properties
Checking formula 0 : !(((G(X((!(("(((gu0.ready_0+gu0.ready_1)+(gu0.ready_2+gu0.ready_3))>=2)")U("(((gu1.wait_0+gu1.wait_1)+(gu1.wait_2+gu1.wait_3))<=gu1.op...338
Formula 0 simplified : !(GX("((gu2.theOptions_0>gu1.optionSlots_0)||(((gu1.wait_0+gu1.wait_1)+(gu1.wait_2+gu1.wait_3))>gu1.optionSlots_0))" & !("(((gu0.rea...326
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7377554997318852124
[2022-05-15 22:51:17] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7377554997318852124
Running compilation step : cd /tmp/ltsmin7377554997318852124;'/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 86 ms.
Running link step : cd /tmp/ltsmin7377554997318852124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7377554997318852124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((!((LTLAPp0==true) U (LTLAPp1==true))&&(LTLAPp2==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-09 finished in 85686 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(((G(X(p0)) U p0)||p1))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:33] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:33] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:33] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:33] [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 124 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s8), p1:(LEQ s9 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 69 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 p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-11 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)&&G(p1)))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:33] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:33] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 22:51:33] [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 88 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s9), p1:(GT 2 s11)], 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 0 ms.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-12 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))&&(p1 U (p1 U !p0))))'
Support contains 9 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:33] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:33] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:33] [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 22:51:33] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:33] [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 151 ms :[(NOT p0), true, true, (NOT p0), true]
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3)), p1:(LEQ (ADD s4 s5 s6 s7) s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-48-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-15 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((!(p0 U p1)&&p2)))||G(p3)))'
Found a SL insensitive property : DrinkVendingMachine-COL-48-LTLCardinality-09
Stuttering acceptance computed with spot in 168 ms :[true, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (NOT p2) p1), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3)]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 22:51:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:34] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:34] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:34] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:34] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Running random walk in product with property : DrinkVendingMachine-COL-48-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p3 (NOT p2)) (AND p3 p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=1, aps=[p3:(LEQ s10 s9), p2:(OR (GT s10 s11) (GT (ADD s4 s5 s6 s7) s11)), p1:(LEQ (ADD s4 s5 s6 s7) s11)], 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 132 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 p3) p2 (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)))), (X (AND p2 (NOT p1))), (X (NOT (OR (NOT p2) p1))), (X (NOT (OR (AND p3 (NOT p2)) (AND p3 p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (AND (NOT p3) p2 (NOT p1))), true, (X (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1))))), (X (X (NOT p3))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND p3 p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (AND (NOT p3) p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 478 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10043 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 687116 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 687116 steps, saw 360411 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:38] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:38] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:51:38] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:51:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:51:38] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 22:51:38] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 22:51:38] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 342 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=85 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)))), (X (AND p2 (NOT p1))), (X (NOT (OR (NOT p2) p1))), (X (NOT (OR (AND p3 (NOT p2)) (AND p3 p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (AND (NOT p3) p2 (NOT p1))), true, (X (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1))))), (X (X (NOT p3))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND p3 p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (AND (NOT p3) p2 (NOT p1))))]
False Knowledge obtained : [(F (OR p1 (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 15 factoid took 607 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 6 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:39] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:39] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:39] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:39] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:39] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:39] [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.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:39] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:39] [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.
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) p2), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), true, (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 614841 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614841 steps, saw 323654 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:42] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:51:42] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:51:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 22:51:42] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 22:51:42] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 22:51:42] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 342 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=85 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), true, (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (OR p1 (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 78 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 162 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 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 22:51:43] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2022-05-15 22:51:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:43] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 10/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Built C files in :
/tmp/ltsmin3003255276500782536
[2022-05-15 22:51:43] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3003255276500782536
Running compilation step : cd /tmp/ltsmin3003255276500782536;'/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 73 ms.
Running link step : cd /tmp/ltsmin3003255276500782536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3003255276500782536;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5500734243624336344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 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 22:51:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:51:59] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:51:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:59] [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 22:51:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:51:59] [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.
Built C files in :
/tmp/ltsmin4092129391150874217
[2022-05-15 22:51:59] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4092129391150874217
Running compilation step : cd /tmp/ltsmin4092129391150874217;'/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 69 ms.
Running link step : cd /tmp/ltsmin4092129391150874217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4092129391150874217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18085624249033373084.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 22:52:14] [INFO ] Flatten gal took : 2 ms
[2022-05-15 22:52:14] [INFO ] Flatten gal took : 1 ms
[2022-05-15 22:52:14] [INFO ] Time to serialize gal into /tmp/LTL17307876645905279468.gal : 0 ms
[2022-05-15 22:52:14] [INFO ] Time to serialize properties into /tmp/LTL576611696808040311.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17307876645905279468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL576611696808040311.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1730787...266
Read 1 LTL properties
Checking formula 0 : !(((G(X((!(("(((ready_0+ready_1)+(ready_2+ready_3))>=2)")U("(((wait_0+wait_1)+(wait_2+wait_3))<=optionSlots_0)")))&&("((theOptions_0>o...266
Formula 0 simplified : !(GX("((theOptions_0>optionSlots_0)||(((wait_0+wait_1)+(wait_2+wait_3))>optionSlots_0))" & !("(((ready_0+ready_1)+(ready_2+ready_3))...254
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 22:52:29] [INFO ] Flatten gal took : 3 ms
[2022-05-15 22:52:29] [INFO ] Applying decomposition
[2022-05-15 22:52:29] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5942197748908065252.txt' '-o' '/tmp/graph5942197748908065252.bin' '-w' '/tmp/graph5942197748908065252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5942197748908065252.bin' '-l' '-1' '-v' '-w' '/tmp/graph5942197748908065252.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:52:29] [INFO ] Decomposing Gal with order
[2022-05-15 22:52:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:52:29] [INFO ] Flatten gal took : 2 ms
[2022-05-15 22:52:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-15 22:52:29] [INFO ] Time to serialize gal into /tmp/LTL16356172206357458846.gal : 0 ms
[2022-05-15 22:52:29] [INFO ] Time to serialize properties into /tmp/LTL13021311459708053534.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16356172206357458846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13021311459708053534.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1635617...268
Read 1 LTL properties
Checking formula 0 : !(((G(X((!(("(((gu0.ready_0+gu0.ready_1)+(gu0.ready_2+gu0.ready_3))>=2)")U("(((gu1.wait_0+gu1.wait_1)+(gu1.wait_2+gu1.wait_3))<=gu1.op...338
Formula 0 simplified : !(GX("((gu2.theOptions_0>gu1.optionSlots_0)||(((gu1.wait_0+gu1.wait_1)+(gu1.wait_2+gu1.wait_3))>gu1.optionSlots_0))" & !("(((gu0.rea...326
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6492071627844609041
[2022-05-15 22:52:44] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6492071627844609041
Running compilation step : cd /tmp/ltsmin6492071627844609041;'/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/ltsmin6492071627844609041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6492071627844609041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((!((LTLAPp0==true) U (LTLAPp1==true))&&(LTLAPp2==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DrinkVendingMachine-COL-48-LTLCardinality-09 finished in 85453 ms.
[2022-05-15 22:52:59] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17935166430764492521
[2022-05-15 22:52:59] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2022-05-15 22:52:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 22:52:59] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2022-05-15 22:52:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 22:52:59] [INFO ] Applying decomposition
[2022-05-15 22:52:59] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2022-05-15 22:52:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 22:52:59] [INFO ] Flatten gal took : 1 ms
[2022-05-15 22:52:59] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17935166430764492521
Running compilation step : cd /tmp/ltsmin17935166430764492521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18334892989361246854.txt' '-o' '/tmp/graph18334892989361246854.bin' '-w' '/tmp/graph18334892989361246854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18334892989361246854.bin' '-l' '-1' '-v' '-w' '/tmp/graph18334892989361246854.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:52:59] [INFO ] Decomposing Gal with order
[2022-05-15 22:52:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:52:59] [INFO ] Flatten gal took : 1 ms
[2022-05-15 22:52:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-15 22:52:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality9145626011875409489.gal : 0 ms
[2022-05-15 22:52:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality2597541519743280617.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9145626011875409489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2597541519743280617.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !(((G(X((!(("(((gu0.ready_0+gu0.ready_1)+(gu0.ready_2+gu0.ready_3))>=2)")U("(((gu1.wait_0+gu1.wait_1)+(gu1.wait_2+gu1.wait_3))<=gu1.op...338
Formula 0 simplified : !(GX("((gu2.theOptions_0>gu1.optionSlots_0)||(((gu1.wait_0+gu1.wait_1)+(gu1.wait_2+gu1.wait_3))>gu1.optionSlots_0))" & !("(((gu0.rea...326
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin17935166430764492521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17935166430764492521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((!((LTLAPp0==true) U (LTLAPp1==true))&&(LTLAPp2==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: ([](X((!((LTLAPp0==true) U (LTLAPp1==true))&&(LTLAPp2==true))))||[]((LTLAPp3==true)))
pins2lts-mc-linux64( 1/ 8), 0.003: "([](X((!((LTLAPp0==true) U (LTLAPp1==true))&&(LTLAPp2==true))))||[]((LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.075: DFS-FIFO for weak LTL, using special progress label 15
pins2lts-mc-linux64( 0/ 8), 0.075: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.075: State length is 13, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.075: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.075: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.075: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.075: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.097: ~1 levels ~960 states ~6840 transitions
pins2lts-mc-linux64( 0/ 8), 0.119: ~1 levels ~1920 states ~14160 transitions
pins2lts-mc-linux64( 0/ 8), 0.150: ~1 levels ~3840 states ~29400 transitions
pins2lts-mc-linux64( 0/ 8), 0.196: ~1 levels ~7680 states ~60672 transitions
pins2lts-mc-linux64( 0/ 8), 0.263: ~1 levels ~15360 states ~124456 transitions
pins2lts-mc-linux64( 4/ 8), 0.397: ~1 levels ~30720 states ~261984 transitions
pins2lts-mc-linux64( 2/ 8), 0.638: ~1 levels ~61440 states ~541616 transitions
pins2lts-mc-linux64( 2/ 8), 1.005: ~1 levels ~122880 states ~1099904 transitions
pins2lts-mc-linux64( 7/ 8), 1.603: ~1 levels ~245760 states ~2228456 transitions
pins2lts-mc-linux64( 7/ 8), 2.397: ~1 levels ~491520 states ~4501680 transitions
pins2lts-mc-linux64( 7/ 8), 3.422: ~1 levels ~983040 states ~9069824 transitions
pins2lts-mc-linux64( 2/ 8), 5.320: ~1 levels ~1966080 states ~18263216 transitions
pins2lts-mc-linux64( 0/ 8), 8.729: ~1 levels ~3932160 states ~35566016 transitions
pins2lts-mc-linux64( 0/ 8), 15.636: ~1 levels ~7864320 states ~71481656 transitions
pins2lts-mc-linux64( 1/ 8), 29.669: ~1 levels ~15728640 states ~140566272 transitions
pins2lts-mc-linux64( 1/ 8), 57.877: ~1 levels ~31457280 states ~281045056 transitions
pins2lts-mc-linux64( 1/ 8), 117.673: ~1 levels ~62914560 states ~562486048 transitions
pins2lts-mc-linux64( 7/ 8), 244.166: ~1 levels ~125829120 states ~1147959680 transitions
pins2lts-mc-linux64( 0/ 8), 273.726: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 273.753:
pins2lts-mc-linux64( 0/ 8), 273.753: mean standard work distribution: 2.9% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 273.753:
pins2lts-mc-linux64( 0/ 8), 273.753: Explored 126900199 states 1181624732 transitions, fanout: 9.311
pins2lts-mc-linux64( 0/ 8), 273.753: Total exploration time 273.670 sec (273.630 sec minimum, 273.650 sec on average)
pins2lts-mc-linux64( 0/ 8), 273.753: States per second: 463698, Transitions per second: 4317699
pins2lts-mc-linux64( 0/ 8), 273.753:
pins2lts-mc-linux64( 0/ 8), 273.753: Progress states detected: 134217053
pins2lts-mc-linux64( 0/ 8), 273.753: Redundant explorations: -5.4516
pins2lts-mc-linux64( 0/ 8), 273.753:
pins2lts-mc-linux64( 0/ 8), 273.753: Queue width: 8B, total height: 16112625, memory: 122.93MB
pins2lts-mc-linux64( 0/ 8), 273.753: Tree memory: 1072.6MB, 8.4 B/state, compr.: 15.5%
pins2lts-mc-linux64( 0/ 8), 273.753: Tree fill ratio (roots/leafs): 99.0%/18.0%
pins2lts-mc-linux64( 0/ 8), 273.753: Stored 10 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 273.753: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 273.753: Est. total memory use: 1195.5MB (~1146.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17935166430764492521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((!((LTLAPp0==true) U (LTLAPp1==true))&&(LTLAPp2==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17935166430764492521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((!((LTLAPp0==true) U (LTLAPp1==true))&&(LTLAPp2==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-15 23:13:58] [INFO ] Applying decomposition
[2022-05-15 23:13:58] [INFO ] Flatten gal took : 2 ms
[2022-05-15 23:13:58] [INFO ] Decomposing Gal with order
[2022-05-15 23:13:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:13:58] [INFO ] Removed a total of 6 redundant transitions.
[2022-05-15 23:13:58] [INFO ] Flatten gal took : 3 ms
[2022-05-15 23:13:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-15 23:13:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality3117548231544586429.gal : 1 ms
[2022-05-15 23:13:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality5817897923523158310.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3117548231544586429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5817897923523158310.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !(((G(X((!(("(((gQuality0.ready_0+gQuality1.ready_1)+(gQuality2.ready_2+gQuality3.ready_3))>=2)")U("(((gQuality0.wait_0+gQuality1.wait...463
Formula 0 simplified : !(GX("((gtheOptions.theOptions_0>goptionSlots.optionSlots_0)||(((gQuality0.wait_0+gQuality1.wait_1)+(gQuality2.wait_2+gQuality3.wait...451
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 23:34:57] [INFO ] Flatten gal took : 3 ms
[2022-05-15 23:34:57] [INFO ] Input system was already deterministic with 10 transitions.
[2022-05-15 23:34:57] [INFO ] Transformed 12 places.
[2022-05-15 23:34:57] [INFO ] Transformed 10 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 23:34:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality18177815034620731762.gal : 1 ms
[2022-05-15 23:34:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality10553033187043336006.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18177815034620731762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10553033187043336006.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(X((!(("(((ready_0+ready_1)+(ready_2+ready_3))>=2)")U("(((wait_0+wait_1)+(wait_2+wait_3))<=optionSlots_0)")))&&("((theOptions_0>o...266
Formula 0 simplified : !(GX("((theOptions_0>optionSlots_0)||(((wait_0+wait_1)+(wait_2+wait_3))>optionSlots_0))" & !("(((ready_0+ready_1)+(ready_2+ready_3))...254
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-48"
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-48, 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-165260110100259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-48.tgz
mv DrinkVendingMachine-COL-48 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;